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/ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-502d2f4 [2018-10-12 20:44:30,822 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-12 20:44:30,824 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-12 20:44:30,836 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-12 20:44:30,836 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-12 20:44:30,837 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-12 20:44:30,838 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-12 20:44:30,840 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-12 20:44:30,842 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-12 20:44:30,843 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-12 20:44:30,844 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-12 20:44:30,844 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-12 20:44:30,845 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-12 20:44:30,846 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-12 20:44:30,847 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-12 20:44:30,848 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-12 20:44:30,849 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-12 20:44:30,851 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-12 20:44:30,853 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-12 20:44:30,854 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-12 20:44:30,855 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-12 20:44:30,856 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-12 20:44:30,859 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-12 20:44:30,859 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-12 20:44:30,860 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-12 20:44:30,860 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-12 20:44:30,861 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-12 20:44:30,862 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-12 20:44:30,863 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-12 20:44:30,864 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-12 20:44:30,864 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-12 20:44:30,865 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-12 20:44:30,865 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-12 20:44:30,866 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-12 20:44:30,867 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-12 20:44:30,867 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-12 20:44:30,868 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:44:30,883 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-12 20:44:30,883 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-12 20:44:30,884 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-12 20:44:30,884 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-12 20:44:30,885 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-12 20:44:30,885 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-12 20:44:30,885 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-12 20:44:30,886 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-12 20:44:30,886 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-12 20:44:30,886 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-12 20:44:30,886 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-12 20:44:30,887 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-12 20:44:30,887 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-12 20:44:30,888 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-12 20:44:30,888 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-12 20:44:30,937 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-12 20:44:30,958 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-12 20:44:30,964 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-12 20:44:30,966 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-12 20:44:30,967 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-12 20:44:30,967 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl [2018-10-12 20:44:30,968 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl' [2018-10-12 20:44:31,066 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-12 20:44:31,068 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-12 20:44:31,069 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-12 20:44:31,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-12 20:44:31,069 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-12 20:44:31,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:31" (1/1) ... [2018-10-12 20:44:31,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:31" (1/1) ... [2018-10-12 20:44:31,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:31" (1/1) ... [2018-10-12 20:44:31,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:31" (1/1) ... [2018-10-12 20:44:31,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:31" (1/1) ... [2018-10-12 20:44:31,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:31" (1/1) ... [2018-10-12 20:44:31,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:31" (1/1) ... [2018-10-12 20:44:31,155 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-12 20:44:31,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-12 20:44:31,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-12 20:44:31,160 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-12 20:44:31,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:31" (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:44:31,244 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-12 20:44:31,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-12 20:44:31,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-12 20:44:32,031 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-12 20:44:32,032 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:44:32 BoogieIcfgContainer [2018-10-12 20:44:32,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-12 20:44:32,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-12 20:44:32,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-12 20:44:32,037 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-12 20:44:32,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:31" (1/2) ... [2018-10-12 20:44:32,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3085a9ff and model type ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:44:32, skipping insertion in model container [2018-10-12 20:44:32,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:44:32" (2/2) ... [2018-10-12 20:44:32,040 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl [2018-10-12 20:44:32,052 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-12 20:44:32,063 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-12 20:44:32,081 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-12 20:44:32,114 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-12 20:44:32,115 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-12 20:44:32,115 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-12 20:44:32,116 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-12 20:44:32,116 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-12 20:44:32,116 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-12 20:44:32,116 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-12 20:44:32,116 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-12 20:44:32,116 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-12 20:44:32,143 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2018-10-12 20:44:32,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-12 20:44:32,165 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:32,166 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:32,168 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:32,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:32,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1887892157, now seen corresponding path program 1 times [2018-10-12 20:44:32,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:32,646 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:44:32,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 20:44:32,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-12 20:44:32,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-12 20:44:32,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-12 20:44:32,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-12 20:44:32,674 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 8 states. [2018-10-12 20:44:33,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:33,172 INFO L93 Difference]: Finished difference Result 223 states and 227 transitions. [2018-10-12 20:44:33,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-12 20:44:33,175 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-10-12 20:44:33,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:33,192 INFO L225 Difference]: With dead ends: 223 [2018-10-12 20:44:33,192 INFO L226 Difference]: Without dead ends: 223 [2018-10-12 20:44:33,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-10-12 20:44:33,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-12 20:44:33,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 155. [2018-10-12 20:44:33,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-12 20:44:33,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 158 transitions. [2018-10-12 20:44:33,250 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 158 transitions. Word has length 50 [2018-10-12 20:44:33,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:33,251 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 158 transitions. [2018-10-12 20:44:33,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-12 20:44:33,252 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 158 transitions. [2018-10-12 20:44:33,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-12 20:44:33,256 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:33,257 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 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:44:33,257 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:33,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:33,258 INFO L82 PathProgramCache]: Analyzing trace with hash 264487742, now seen corresponding path program 1 times [2018-10-12 20:44:33,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:33,703 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:33,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:33,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-12 20:44:33,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-12 20:44:33,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-12 20:44:33,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-12 20:44:33,707 INFO L87 Difference]: Start difference. First operand 155 states and 158 transitions. Second operand 8 states. [2018-10-12 20:44:34,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:34,315 INFO L93 Difference]: Finished difference Result 293 states and 298 transitions. [2018-10-12 20:44:34,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-12 20:44:34,317 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 104 [2018-10-12 20:44:34,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:34,321 INFO L225 Difference]: With dead ends: 293 [2018-10-12 20:44:34,321 INFO L226 Difference]: Without dead ends: 293 [2018-10-12 20:44:34,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 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:44:34,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-10-12 20:44:34,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 200. [2018-10-12 20:44:34,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-12 20:44:34,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 203 transitions. [2018-10-12 20:44:34,341 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 203 transitions. Word has length 104 [2018-10-12 20:44:34,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:34,342 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 203 transitions. [2018-10-12 20:44:34,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-12 20:44:34,342 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 203 transitions. [2018-10-12 20:44:34,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-12 20:44:34,345 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:34,345 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:34,345 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:34,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:34,346 INFO L82 PathProgramCache]: Analyzing trace with hash -484291215, now seen corresponding path program 1 times [2018-10-12 20:44:34,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:35,032 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:35,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:35,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-12 20:44:35,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-12 20:44:35,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-12 20:44:35,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-10-12 20:44:35,035 INFO L87 Difference]: Start difference. First operand 200 states and 203 transitions. Second operand 18 states. [2018-10-12 20:44:38,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:38,814 INFO L93 Difference]: Finished difference Result 448 states and 457 transitions. [2018-10-12 20:44:38,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-12 20:44:38,815 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 125 [2018-10-12 20:44:38,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:38,825 INFO L225 Difference]: With dead ends: 448 [2018-10-12 20:44:38,826 INFO L226 Difference]: Without dead ends: 448 [2018-10-12 20:44:38,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=811, Invalid=2611, Unknown=0, NotChecked=0, Total=3422 [2018-10-12 20:44:38,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-10-12 20:44:38,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 233. [2018-10-12 20:44:38,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-12 20:44:38,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 238 transitions. [2018-10-12 20:44:38,865 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 238 transitions. Word has length 125 [2018-10-12 20:44:38,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:38,869 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 238 transitions. [2018-10-12 20:44:38,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-12 20:44:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 238 transitions. [2018-10-12 20:44:38,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-12 20:44:38,874 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:38,874 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:38,874 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:38,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:38,875 INFO L82 PathProgramCache]: Analyzing trace with hash 199164581, now seen corresponding path program 1 times [2018-10-12 20:44:38,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:39,099 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-12 20:44:39,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:39,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-12 20:44:39,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-12 20:44:39,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-12 20:44:39,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-10-12 20:44:39,101 INFO L87 Difference]: Start difference. First operand 233 states and 238 transitions. Second operand 11 states. [2018-10-12 20:44:40,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:40,023 INFO L93 Difference]: Finished difference Result 864 states and 885 transitions. [2018-10-12 20:44:40,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-12 20:44:40,023 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 139 [2018-10-12 20:44:40,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:40,028 INFO L225 Difference]: With dead ends: 864 [2018-10-12 20:44:40,029 INFO L226 Difference]: Without dead ends: 864 [2018-10-12 20:44:40,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=499, Invalid=1853, Unknown=0, NotChecked=0, Total=2352 [2018-10-12 20:44:40,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2018-10-12 20:44:40,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 311. [2018-10-12 20:44:40,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-10-12 20:44:40,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 322 transitions. [2018-10-12 20:44:40,047 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 322 transitions. Word has length 139 [2018-10-12 20:44:40,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:40,048 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 322 transitions. [2018-10-12 20:44:40,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-12 20:44:40,048 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 322 transitions. [2018-10-12 20:44:40,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-12 20:44:40,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:40,051 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:40,051 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:40,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:40,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1220309906, now seen corresponding path program 2 times [2018-10-12 20:44:40,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:40,240 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 33 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-12 20:44:40,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:40,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-12 20:44:40,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-12 20:44:40,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-12 20:44:40,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-12 20:44:40,242 INFO L87 Difference]: Start difference. First operand 311 states and 322 transitions. Second operand 10 states. [2018-10-12 20:44:40,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:40,713 INFO L93 Difference]: Finished difference Result 357 states and 365 transitions. [2018-10-12 20:44:40,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-12 20:44:40,714 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 160 [2018-10-12 20:44:40,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:40,716 INFO L225 Difference]: With dead ends: 357 [2018-10-12 20:44:40,716 INFO L226 Difference]: Without dead ends: 357 [2018-10-12 20:44:40,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=254, Invalid=616, Unknown=0, NotChecked=0, Total=870 [2018-10-12 20:44:40,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-10-12 20:44:40,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 279. [2018-10-12 20:44:40,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-12 20:44:40,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 287 transitions. [2018-10-12 20:44:40,725 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 287 transitions. Word has length 160 [2018-10-12 20:44:40,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:40,725 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 287 transitions. [2018-10-12 20:44:40,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-12 20:44:40,726 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 287 transitions. [2018-10-12 20:44:40,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-12 20:44:40,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:40,729 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, 2, 2, 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, 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:44:40,729 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:40,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:40,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1432588018, now seen corresponding path program 2 times [2018-10-12 20:44:40,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:40,937 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 84 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-12 20:44:40,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:40,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-12 20:44:40,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-12 20:44:40,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-12 20:44:40,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-10-12 20:44:40,939 INFO L87 Difference]: Start difference. First operand 279 states and 287 transitions. Second operand 10 states. [2018-10-12 20:44:41,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:41,216 INFO L93 Difference]: Finished difference Result 383 states and 393 transitions. [2018-10-12 20:44:41,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-12 20:44:41,216 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 179 [2018-10-12 20:44:41,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:41,218 INFO L225 Difference]: With dead ends: 383 [2018-10-12 20:44:41,219 INFO L226 Difference]: Without dead ends: 383 [2018-10-12 20:44:41,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-10-12 20:44:41,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-10-12 20:44:41,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 279. [2018-10-12 20:44:41,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-12 20:44:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 286 transitions. [2018-10-12 20:44:41,226 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 286 transitions. Word has length 179 [2018-10-12 20:44:41,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:41,226 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 286 transitions. [2018-10-12 20:44:41,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-12 20:44:41,226 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 286 transitions. [2018-10-12 20:44:41,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-12 20:44:41,229 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:41,229 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, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:41,229 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:41,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:41,230 INFO L82 PathProgramCache]: Analyzing trace with hash 512218406, now seen corresponding path program 3 times [2018-10-12 20:44:41,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:41,470 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 25 proven. 94 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-12 20:44:41,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:41,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-12 20:44:41,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-12 20:44:41,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-12 20:44:41,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-12 20:44:41,472 INFO L87 Difference]: Start difference. First operand 279 states and 286 transitions. Second operand 10 states. [2018-10-12 20:44:41,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:41,839 INFO L93 Difference]: Finished difference Result 319 states and 325 transitions. [2018-10-12 20:44:41,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-12 20:44:41,839 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 193 [2018-10-12 20:44:41,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:41,842 INFO L225 Difference]: With dead ends: 319 [2018-10-12 20:44:41,842 INFO L226 Difference]: Without dead ends: 319 [2018-10-12 20:44:41,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 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:44:41,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-10-12 20:44:41,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 279. [2018-10-12 20:44:41,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-12 20:44:41,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 285 transitions. [2018-10-12 20:44:41,850 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 285 transitions. Word has length 193 [2018-10-12 20:44:41,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:41,850 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 285 transitions. [2018-10-12 20:44:41,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-12 20:44:41,851 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 285 transitions. [2018-10-12 20:44:41,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-12 20:44:41,853 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:41,853 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:41,854 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:41,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:41,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1098120329, now seen corresponding path program 4 times [2018-10-12 20:44:41,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:42,200 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 25 proven. 118 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-12 20:44:42,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:42,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-12 20:44:42,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-12 20:44:42,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-12 20:44:42,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-12 20:44:42,203 INFO L87 Difference]: Start difference. First operand 279 states and 285 transitions. Second operand 12 states. [2018-10-12 20:44:42,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:42,626 INFO L93 Difference]: Finished difference Result 296 states and 299 transitions. [2018-10-12 20:44:42,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-12 20:44:42,626 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 214 [2018-10-12 20:44:42,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:42,629 INFO L225 Difference]: With dead ends: 296 [2018-10-12 20:44:42,629 INFO L226 Difference]: Without dead ends: 296 [2018-10-12 20:44:42,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2018-10-12 20:44:42,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-12 20:44:42,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 267. [2018-10-12 20:44:42,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-12 20:44:42,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 270 transitions. [2018-10-12 20:44:42,635 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 270 transitions. Word has length 214 [2018-10-12 20:44:42,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:42,636 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 270 transitions. [2018-10-12 20:44:42,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-12 20:44:42,636 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 270 transitions. [2018-10-12 20:44:42,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-12 20:44:42,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:42,639 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, 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, 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] [2018-10-12 20:44:42,640 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:42,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:42,640 INFO L82 PathProgramCache]: Analyzing trace with hash -819109626, now seen corresponding path program 5 times [2018-10-12 20:44:42,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:43,150 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 81 proven. 23 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-12 20:44:43,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:43,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-12 20:44:43,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-12 20:44:43,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-12 20:44:43,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-10-12 20:44:43,152 INFO L87 Difference]: Start difference. First operand 267 states and 270 transitions. Second operand 14 states. [2018-10-12 20:44:44,123 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-12 20:44:44,598 WARN L178 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-10-12 20:44:45,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:45,754 INFO L93 Difference]: Finished difference Result 515 states and 524 transitions. [2018-10-12 20:44:45,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-12 20:44:45,755 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 235 [2018-10-12 20:44:45,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:45,757 INFO L225 Difference]: With dead ends: 515 [2018-10-12 20:44:45,757 INFO L226 Difference]: Without dead ends: 515 [2018-10-12 20:44:45,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=322, Invalid=1160, Unknown=0, NotChecked=0, Total=1482 [2018-10-12 20:44:45,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-10-12 20:44:45,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 271. [2018-10-12 20:44:45,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-12 20:44:45,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 275 transitions. [2018-10-12 20:44:45,765 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 275 transitions. Word has length 235 [2018-10-12 20:44:45,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:45,765 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 275 transitions. [2018-10-12 20:44:45,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-12 20:44:45,766 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 275 transitions. [2018-10-12 20:44:45,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-12 20:44:45,767 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:45,767 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:44:45,767 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:45,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:45,768 INFO L82 PathProgramCache]: Analyzing trace with hash 507620730, now seen corresponding path program 6 times [2018-10-12 20:44:45,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:46,273 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-12 20:44:46,513 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 97 proven. 27 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-12 20:44:46,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:46,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-12 20:44:46,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-12 20:44:46,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-12 20:44:46,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-12 20:44:46,515 INFO L87 Difference]: Start difference. First operand 271 states and 275 transitions. Second operand 16 states. [2018-10-12 20:44:48,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:48,286 INFO L93 Difference]: Finished difference Result 590 states and 601 transitions. [2018-10-12 20:44:48,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-12 20:44:48,286 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 249 [2018-10-12 20:44:48,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:48,290 INFO L225 Difference]: With dead ends: 590 [2018-10-12 20:44:48,290 INFO L226 Difference]: Without dead ends: 590 [2018-10-12 20:44:48,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=470, Invalid=1882, Unknown=0, NotChecked=0, Total=2352 [2018-10-12 20:44:48,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2018-10-12 20:44:48,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 285. [2018-10-12 20:44:48,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-10-12 20:44:48,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 290 transitions. [2018-10-12 20:44:48,298 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 290 transitions. Word has length 249 [2018-10-12 20:44:48,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:48,299 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 290 transitions. [2018-10-12 20:44:48,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-12 20:44:48,299 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 290 transitions. [2018-10-12 20:44:48,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-10-12 20:44:48,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:48,301 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 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, 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:44:48,302 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:48,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:48,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1431117550, now seen corresponding path program 7 times [2018-10-12 20:44:48,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:48,669 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 11 proven. 208 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-12 20:44:48,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:48,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-12 20:44:48,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-12 20:44:48,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-12 20:44:48,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-10-12 20:44:48,671 INFO L87 Difference]: Start difference. First operand 285 states and 290 transitions. Second operand 16 states. [2018-10-12 20:44:49,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:49,651 INFO L93 Difference]: Finished difference Result 589 states and 599 transitions. [2018-10-12 20:44:49,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-12 20:44:49,652 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 263 [2018-10-12 20:44:49,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:49,654 INFO L225 Difference]: With dead ends: 589 [2018-10-12 20:44:49,654 INFO L226 Difference]: Without dead ends: 589 [2018-10-12 20:44:49,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=632, Invalid=2230, Unknown=0, NotChecked=0, Total=2862 [2018-10-12 20:44:49,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-10-12 20:44:49,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 409. [2018-10-12 20:44:49,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-10-12 20:44:49,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 417 transitions. [2018-10-12 20:44:49,663 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 417 transitions. Word has length 263 [2018-10-12 20:44:49,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:49,664 INFO L481 AbstractCegarLoop]: Abstraction has 409 states and 417 transitions. [2018-10-12 20:44:49,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-12 20:44:49,664 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 417 transitions. [2018-10-12 20:44:49,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-10-12 20:44:49,666 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:49,666 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:49,667 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:49,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:49,667 INFO L82 PathProgramCache]: Analyzing trace with hash 469026255, now seen corresponding path program 8 times [2018-10-12 20:44:49,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:50,447 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 211 proven. 37 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2018-10-12 20:44:50,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:50,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-12 20:44:50,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-12 20:44:50,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-12 20:44:50,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-12 20:44:50,449 INFO L87 Difference]: Start difference. First operand 409 states and 417 transitions. Second operand 15 states. [2018-10-12 20:44:51,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:51,754 INFO L93 Difference]: Finished difference Result 867 states and 885 transitions. [2018-10-12 20:44:51,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-12 20:44:51,754 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 359 [2018-10-12 20:44:51,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:51,759 INFO L225 Difference]: With dead ends: 867 [2018-10-12 20:44:51,759 INFO L226 Difference]: Without dead ends: 867 [2018-10-12 20:44:51,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1458 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=810, Invalid=3746, Unknown=0, NotChecked=0, Total=4556 [2018-10-12 20:44:51,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-10-12 20:44:51,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 430. [2018-10-12 20:44:51,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-10-12 20:44:51,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 439 transitions. [2018-10-12 20:44:51,770 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 439 transitions. Word has length 359 [2018-10-12 20:44:51,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:51,771 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 439 transitions. [2018-10-12 20:44:51,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-12 20:44:51,771 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 439 transitions. [2018-10-12 20:44:51,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-10-12 20:44:51,773 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:51,773 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:51,774 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:51,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:51,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1672706000, now seen corresponding path program 9 times [2018-10-12 20:44:51,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:52,193 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 379 proven. 159 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-10-12 20:44:52,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:52,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-12 20:44:52,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-12 20:44:52,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-12 20:44:52,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-10-12 20:44:52,195 INFO L87 Difference]: Start difference. First operand 430 states and 439 transitions. Second operand 12 states. [2018-10-12 20:44:52,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:52,608 INFO L93 Difference]: Finished difference Result 433 states and 440 transitions. [2018-10-12 20:44:52,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-12 20:44:52,609 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 380 [2018-10-12 20:44:52,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:52,612 INFO L225 Difference]: With dead ends: 433 [2018-10-12 20:44:52,613 INFO L226 Difference]: Without dead ends: 433 [2018-10-12 20:44:52,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2018-10-12 20:44:52,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-10-12 20:44:52,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 430. [2018-10-12 20:44:52,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-10-12 20:44:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 437 transitions. [2018-10-12 20:44:52,620 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 437 transitions. Word has length 380 [2018-10-12 20:44:52,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:52,621 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 437 transitions. [2018-10-12 20:44:52,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-12 20:44:52,621 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 437 transitions. [2018-10-12 20:44:52,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-10-12 20:44:52,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:52,624 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:52,624 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:52,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:52,625 INFO L82 PathProgramCache]: Analyzing trace with hash 145646044, now seen corresponding path program 10 times [2018-10-12 20:44:52,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:52,958 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 411 proven. 176 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-10-12 20:44:52,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:52,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-12 20:44:52,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-12 20:44:52,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-12 20:44:52,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-10-12 20:44:52,960 INFO L87 Difference]: Start difference. First operand 430 states and 437 transitions. Second operand 14 states. [2018-10-12 20:44:53,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:53,403 INFO L93 Difference]: Finished difference Result 433 states and 438 transitions. [2018-10-12 20:44:53,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-12 20:44:53,404 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 394 [2018-10-12 20:44:53,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:53,407 INFO L225 Difference]: With dead ends: 433 [2018-10-12 20:44:53,407 INFO L226 Difference]: Without dead ends: 433 [2018-10-12 20:44:53,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2018-10-12 20:44:53,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-10-12 20:44:53,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 430. [2018-10-12 20:44:53,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-10-12 20:44:53,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 435 transitions. [2018-10-12 20:44:53,414 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 435 transitions. Word has length 394 [2018-10-12 20:44:53,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:53,415 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 435 transitions. [2018-10-12 20:44:53,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-12 20:44:53,415 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 435 transitions. [2018-10-12 20:44:53,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-10-12 20:44:53,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:53,418 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:53,418 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:53,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:53,418 INFO L82 PathProgramCache]: Analyzing trace with hash 898680552, now seen corresponding path program 11 times [2018-10-12 20:44:53,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:54,480 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 142 proven. 526 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-10-12 20:44:54,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:54,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-12 20:44:54,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-12 20:44:54,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-12 20:44:54,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2018-10-12 20:44:54,481 INFO L87 Difference]: Start difference. First operand 430 states and 435 transitions. Second operand 24 states. [2018-10-12 20:44:57,286 WARN L178 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-12 20:44:58,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:58,104 INFO L93 Difference]: Finished difference Result 601 states and 608 transitions. [2018-10-12 20:44:58,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-12 20:44:58,104 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 408 [2018-10-12 20:44:58,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:58,107 INFO L225 Difference]: With dead ends: 601 [2018-10-12 20:44:58,107 INFO L226 Difference]: Without dead ends: 601 [2018-10-12 20:44:58,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=766, Invalid=3140, Unknown=0, NotChecked=0, Total=3906 [2018-10-12 20:44:58,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-10-12 20:44:58,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 444. [2018-10-12 20:44:58,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-10-12 20:44:58,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 450 transitions. [2018-10-12 20:44:58,116 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 450 transitions. Word has length 408 [2018-10-12 20:44:58,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:58,117 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 450 transitions. [2018-10-12 20:44:58,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-12 20:44:58,117 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 450 transitions. [2018-10-12 20:44:58,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-10-12 20:44:58,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:58,120 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:58,120 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:58,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:58,121 INFO L82 PathProgramCache]: Analyzing trace with hash 270300, now seen corresponding path program 12 times [2018-10-12 20:44:58,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:02,007 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 36 proven. 697 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-12 20:45:02,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:02,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-12 20:45:02,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-12 20:45:02,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-12 20:45:02,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-10-12 20:45:02,010 INFO L87 Difference]: Start difference. First operand 444 states and 450 transitions. Second operand 20 states. [2018-10-12 20:45:02,873 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-12 20:45:03,377 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-12 20:45:04,117 WARN L178 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2018-10-12 20:45:05,031 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-12 20:45:05,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:05,615 INFO L93 Difference]: Finished difference Result 791 states and 802 transitions. [2018-10-12 20:45:05,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-12 20:45:05,617 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 422 [2018-10-12 20:45:05,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:05,621 INFO L225 Difference]: With dead ends: 791 [2018-10-12 20:45:05,621 INFO L226 Difference]: Without dead ends: 791 [2018-10-12 20:45:05,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1374 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=954, Invalid=3738, Unknown=0, NotChecked=0, Total=4692 [2018-10-12 20:45:05,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2018-10-12 20:45:05,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 626. [2018-10-12 20:45:05,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-10-12 20:45:05,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 635 transitions. [2018-10-12 20:45:05,632 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 635 transitions. Word has length 422 [2018-10-12 20:45:05,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:05,632 INFO L481 AbstractCegarLoop]: Abstraction has 626 states and 635 transitions. [2018-10-12 20:45:05,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-12 20:45:05,633 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 635 transitions. [2018-10-12 20:45:05,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2018-10-12 20:45:05,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:05,637 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:05,637 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:05,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:05,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1104068083, now seen corresponding path program 13 times [2018-10-12 20:45:05,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:07,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1524 backedges. 917 proven. 326 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2018-10-12 20:45:07,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:07,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-12 20:45:07,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-12 20:45:07,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-12 20:45:07,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-12 20:45:07,407 INFO L87 Difference]: Start difference. First operand 626 states and 635 transitions. Second operand 16 states. [2018-10-12 20:45:08,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:08,459 INFO L93 Difference]: Finished difference Result 603 states and 610 transitions. [2018-10-12 20:45:08,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-12 20:45:08,460 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 546 [2018-10-12 20:45:08,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:08,469 INFO L225 Difference]: With dead ends: 603 [2018-10-12 20:45:08,469 INFO L226 Difference]: Without dead ends: 603 [2018-10-12 20:45:08,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2018-10-12 20:45:08,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-10-12 20:45:08,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2018-10-12 20:45:08,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-10-12 20:45:08,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 610 transitions. [2018-10-12 20:45:08,479 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 610 transitions. Word has length 546 [2018-10-12 20:45:08,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:08,480 INFO L481 AbstractCegarLoop]: Abstraction has 603 states and 610 transitions. [2018-10-12 20:45:08,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-12 20:45:08,480 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 610 transitions. [2018-10-12 20:45:08,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2018-10-12 20:45:08,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:08,485 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 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, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:08,486 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:08,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:08,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1079482530, now seen corresponding path program 14 times [2018-10-12 20:45:08,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:09,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1697 backedges. 1155 proven. 80 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2018-10-12 20:45:09,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:09,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-12 20:45:09,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-12 20:45:09,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-12 20:45:09,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-12 20:45:09,127 INFO L87 Difference]: Start difference. First operand 603 states and 610 transitions. Second operand 15 states. [2018-10-12 20:45:10,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:10,201 INFO L93 Difference]: Finished difference Result 699 states and 704 transitions. [2018-10-12 20:45:10,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-12 20:45:10,201 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 567 [2018-10-12 20:45:10,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:10,206 INFO L225 Difference]: With dead ends: 699 [2018-10-12 20:45:10,206 INFO L226 Difference]: Without dead ends: 641 [2018-10-12 20:45:10,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=320, Invalid=1320, Unknown=0, NotChecked=0, Total=1640 [2018-10-12 20:45:10,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2018-10-12 20:45:10,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 603. [2018-10-12 20:45:10,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-10-12 20:45:10,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 607 transitions. [2018-10-12 20:45:10,214 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 607 transitions. Word has length 567 [2018-10-12 20:45:10,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:10,215 INFO L481 AbstractCegarLoop]: Abstraction has 603 states and 607 transitions. [2018-10-12 20:45:10,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-12 20:45:10,215 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 607 transitions. [2018-10-12 20:45:10,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2018-10-12 20:45:10,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:10,219 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 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:45:10,219 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:10,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:10,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1734435118, now seen corresponding path program 15 times [2018-10-12 20:45:10,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:10,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1817 backedges. 751 proven. 93 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2018-10-12 20:45:10,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:10,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-12 20:45:10,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-12 20:45:10,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-12 20:45:10,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-10-12 20:45:10,715 INFO L87 Difference]: Start difference. First operand 603 states and 607 transitions. Second operand 19 states. [2018-10-12 20:45:11,338 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-12 20:45:12,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:12,905 INFO L93 Difference]: Finished difference Result 977 states and 985 transitions. [2018-10-12 20:45:12,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-12 20:45:12,905 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 581 [2018-10-12 20:45:12,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:12,908 INFO L225 Difference]: With dead ends: 977 [2018-10-12 20:45:12,908 INFO L226 Difference]: Without dead ends: 977 [2018-10-12 20:45:12,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2437 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1174, Invalid=6136, Unknown=0, NotChecked=0, Total=7310 [2018-10-12 20:45:12,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2018-10-12 20:45:12,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 624. [2018-10-12 20:45:12,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2018-10-12 20:45:12,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 629 transitions. [2018-10-12 20:45:12,919 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 629 transitions. Word has length 581 [2018-10-12 20:45:12,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:12,919 INFO L481 AbstractCegarLoop]: Abstraction has 624 states and 629 transitions. [2018-10-12 20:45:12,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-12 20:45:12,919 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 629 transitions. [2018-10-12 20:45:12,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2018-10-12 20:45:12,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:12,924 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 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, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:12,924 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:12,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:12,924 INFO L82 PathProgramCache]: Analyzing trace with hash 483336441, now seen corresponding path program 16 times [2018-10-12 20:45:12,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:14,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2011 backedges. 586 proven. 1161 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-10-12 20:45:14,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:14,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-12 20:45:14,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-12 20:45:14,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-12 20:45:14,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2018-10-12 20:45:14,109 INFO L87 Difference]: Start difference. First operand 624 states and 629 transitions. Second operand 28 states. [2018-10-12 20:45:16,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:16,942 INFO L93 Difference]: Finished difference Result 809 states and 816 transitions. [2018-10-12 20:45:16,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-12 20:45:16,942 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 602 [2018-10-12 20:45:16,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:16,946 INFO L225 Difference]: With dead ends: 809 [2018-10-12 20:45:16,946 INFO L226 Difference]: Without dead ends: 809 [2018-10-12 20:45:16,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=937, Invalid=4175, Unknown=0, NotChecked=0, Total=5112 [2018-10-12 20:45:16,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2018-10-12 20:45:16,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 638. [2018-10-12 20:45:16,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2018-10-12 20:45:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 644 transitions. [2018-10-12 20:45:16,955 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 644 transitions. Word has length 602 [2018-10-12 20:45:16,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:16,956 INFO L481 AbstractCegarLoop]: Abstraction has 638 states and 644 transitions. [2018-10-12 20:45:16,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-12 20:45:16,956 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 644 transitions. [2018-10-12 20:45:16,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2018-10-12 20:45:16,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:16,961 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:16,961 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:16,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:16,961 INFO L82 PathProgramCache]: Analyzing trace with hash 2108622893, now seen corresponding path program 17 times [2018-10-12 20:45:16,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:17,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 1002 proven. 170 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2018-10-12 20:45:17,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:17,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-12 20:45:17,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-12 20:45:17,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-12 20:45:17,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-10-12 20:45:17,645 INFO L87 Difference]: Start difference. First operand 638 states and 644 transitions. Second operand 23 states. [2018-10-12 20:45:19,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:19,736 INFO L93 Difference]: Finished difference Result 1151 states and 1164 transitions. [2018-10-12 20:45:19,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-12 20:45:19,737 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 616 [2018-10-12 20:45:19,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:19,742 INFO L225 Difference]: With dead ends: 1151 [2018-10-12 20:45:19,743 INFO L226 Difference]: Without dead ends: 1151 [2018-10-12 20:45:19,747 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4560 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1871, Invalid=11011, Unknown=0, NotChecked=0, Total=12882 [2018-10-12 20:45:19,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2018-10-12 20:45:19,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 710. [2018-10-12 20:45:19,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2018-10-12 20:45:19,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 718 transitions. [2018-10-12 20:45:19,757 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 718 transitions. Word has length 616 [2018-10-12 20:45:19,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:19,758 INFO L481 AbstractCegarLoop]: Abstraction has 710 states and 718 transitions. [2018-10-12 20:45:19,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-12 20:45:19,758 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 718 transitions. [2018-10-12 20:45:19,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2018-10-12 20:45:19,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:19,763 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 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, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:19,763 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:19,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:19,764 INFO L82 PathProgramCache]: Analyzing trace with hash 38968450, now seen corresponding path program 18 times [2018-10-12 20:45:19,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:20,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2360 backedges. 696 proven. 1412 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-10-12 20:45:20,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:20,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-12 20:45:20,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-12 20:45:20,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-12 20:45:20,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-10-12 20:45:20,956 INFO L87 Difference]: Start difference. First operand 710 states and 718 transitions. Second operand 22 states. [2018-10-12 20:45:22,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:22,892 INFO L93 Difference]: Finished difference Result 1080 states and 1090 transitions. [2018-10-12 20:45:22,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-12 20:45:22,895 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 637 [2018-10-12 20:45:22,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:22,901 INFO L225 Difference]: With dead ends: 1080 [2018-10-12 20:45:22,901 INFO L226 Difference]: Without dead ends: 1080 [2018-10-12 20:45:22,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2743 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1546, Invalid=6464, Unknown=0, NotChecked=0, Total=8010 [2018-10-12 20:45:22,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2018-10-12 20:45:22,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 911. [2018-10-12 20:45:22,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 911 states. [2018-10-12 20:45:22,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 920 transitions. [2018-10-12 20:45:22,912 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 920 transitions. Word has length 637 [2018-10-12 20:45:22,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:22,913 INFO L481 AbstractCegarLoop]: Abstraction has 911 states and 920 transitions. [2018-10-12 20:45:22,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-12 20:45:22,913 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 920 transitions. [2018-10-12 20:45:22,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 797 [2018-10-12 20:45:22,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:22,920 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 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, 13, 13, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:22,920 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:22,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:22,921 INFO L82 PathProgramCache]: Analyzing trace with hash 658288368, now seen corresponding path program 19 times [2018-10-12 20:45:22,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:24,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3889 backedges. 2364 proven. 992 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2018-10-12 20:45:24,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:24,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-12 20:45:24,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-12 20:45:24,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-12 20:45:24,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-10-12 20:45:24,245 INFO L87 Difference]: Start difference. First operand 911 states and 920 transitions. Second operand 22 states. [2018-10-12 20:45:25,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:25,234 INFO L93 Difference]: Finished difference Result 931 states and 937 transitions. [2018-10-12 20:45:25,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-12 20:45:25,234 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 796 [2018-10-12 20:45:25,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:25,239 INFO L225 Difference]: With dead ends: 931 [2018-10-12 20:45:25,239 INFO L226 Difference]: Without dead ends: 877 [2018-10-12 20:45:25,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=469, Invalid=1883, Unknown=0, NotChecked=0, Total=2352 [2018-10-12 20:45:25,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2018-10-12 20:45:25,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 874. [2018-10-12 20:45:25,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-10-12 20:45:25,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 879 transitions. [2018-10-12 20:45:25,248 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 879 transitions. Word has length 796 [2018-10-12 20:45:25,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:25,249 INFO L481 AbstractCegarLoop]: Abstraction has 874 states and 879 transitions. [2018-10-12 20:45:25,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-12 20:45:25,249 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 879 transitions. [2018-10-12 20:45:25,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2018-10-12 20:45:25,256 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:25,256 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 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, 14, 14, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:25,256 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:25,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:25,257 INFO L82 PathProgramCache]: Analyzing trace with hash 2136801553, now seen corresponding path program 20 times [2018-10-12 20:45:25,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:25,888 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-12 20:45:26,128 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-12 20:45:26,393 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-10-12 20:45:26,701 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-10-12 20:45:27,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4380 backedges. 1867 proven. 228 refuted. 0 times theorem prover too weak. 2285 trivial. 0 not checked. [2018-10-12 20:45:27,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:27,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-12 20:45:27,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-12 20:45:27,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-12 20:45:27,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2018-10-12 20:45:27,697 INFO L87 Difference]: Start difference. First operand 874 states and 879 transitions. Second operand 28 states. [2018-10-12 20:45:31,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:31,374 INFO L93 Difference]: Finished difference Result 1102 states and 1109 transitions. [2018-10-12 20:45:31,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-12 20:45:31,375 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 831 [2018-10-12 20:45:31,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:31,379 INFO L225 Difference]: With dead ends: 1102 [2018-10-12 20:45:31,380 INFO L226 Difference]: Without dead ends: 1102 [2018-10-12 20:45:31,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=824, Invalid=3868, Unknown=0, NotChecked=0, Total=4692 [2018-10-12 20:45:31,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2018-10-12 20:45:31,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 888. [2018-10-12 20:45:31,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-10-12 20:45:31,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 894 transitions. [2018-10-12 20:45:31,389 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 894 transitions. Word has length 831 [2018-10-12 20:45:31,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:31,390 INFO L481 AbstractCegarLoop]: Abstraction has 888 states and 894 transitions. [2018-10-12 20:45:31,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-12 20:45:31,390 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 894 transitions. [2018-10-12 20:45:31,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 846 [2018-10-12 20:45:31,396 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:31,397 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:31,397 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:31,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:31,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1325850181, now seen corresponding path program 21 times [2018-10-12 20:45:31,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:32,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4585 backedges. 137 proven. 3863 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2018-10-12 20:45:32,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:32,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-12 20:45:32,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-12 20:45:32,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-12 20:45:32,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2018-10-12 20:45:32,563 INFO L87 Difference]: Start difference. First operand 888 states and 894 transitions. Second operand 28 states. [2018-10-12 20:45:35,680 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-12 20:45:35,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:35,956 INFO L93 Difference]: Finished difference Result 1403 states and 1414 transitions. [2018-10-12 20:45:35,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-12 20:45:35,956 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 845 [2018-10-12 20:45:35,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:35,961 INFO L225 Difference]: With dead ends: 1403 [2018-10-12 20:45:35,961 INFO L226 Difference]: Without dead ends: 1403 [2018-10-12 20:45:35,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4801 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2389, Invalid=11417, Unknown=0, NotChecked=0, Total=13806 [2018-10-12 20:45:35,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-10-12 20:45:35,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1168. [2018-10-12 20:45:35,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1168 states. [2018-10-12 20:45:35,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1177 transitions. [2018-10-12 20:45:35,973 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1177 transitions. Word has length 845 [2018-10-12 20:45:35,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:35,974 INFO L481 AbstractCegarLoop]: Abstraction has 1168 states and 1177 transitions. [2018-10-12 20:45:35,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-12 20:45:35,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1177 transitions. [2018-10-12 20:45:35,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1040 [2018-10-12 20:45:35,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:35,984 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:35,985 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:35,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:35,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1539810092, now seen corresponding path program 22 times [2018-10-12 20:45:35,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:37,407 INFO L134 CoverageAnalysis]: Checked inductivity of 7292 backedges. 4825 proven. 1324 refuted. 0 times theorem prover too weak. 1143 trivial. 0 not checked. [2018-10-12 20:45:37,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:37,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-12 20:45:37,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-12 20:45:37,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-12 20:45:37,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-10-12 20:45:37,409 INFO L87 Difference]: Start difference. First operand 1168 states and 1177 transitions. Second operand 24 states. [2018-10-12 20:45:38,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:38,987 INFO L93 Difference]: Finished difference Result 1117 states and 1124 transitions. [2018-10-12 20:45:38,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-12 20:45:38,988 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1039 [2018-10-12 20:45:38,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:38,992 INFO L225 Difference]: With dead ends: 1117 [2018-10-12 20:45:38,992 INFO L226 Difference]: Without dead ends: 1117 [2018-10-12 20:45:38,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=564, Invalid=2406, Unknown=0, NotChecked=0, Total=2970 [2018-10-12 20:45:38,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2018-10-12 20:45:38,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1117. [2018-10-12 20:45:38,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2018-10-12 20:45:39,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1124 transitions. [2018-10-12 20:45:39,001 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1124 transitions. Word has length 1039 [2018-10-12 20:45:39,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:39,001 INFO L481 AbstractCegarLoop]: Abstraction has 1117 states and 1124 transitions. [2018-10-12 20:45:39,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-12 20:45:39,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1124 transitions. [2018-10-12 20:45:39,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1061 [2018-10-12 20:45:39,011 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:39,012 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 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, 19, 19, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:39,012 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:39,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:39,012 INFO L82 PathProgramCache]: Analyzing trace with hash -573127711, now seen corresponding path program 23 times [2018-10-12 20:45:39,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:40,069 INFO L134 CoverageAnalysis]: Checked inductivity of 7698 backedges. 4779 proven. 234 refuted. 0 times theorem prover too weak. 2685 trivial. 0 not checked. [2018-10-12 20:45:40,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:40,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-12 20:45:40,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-12 20:45:40,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-12 20:45:40,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-10-12 20:45:40,071 INFO L87 Difference]: Start difference. First operand 1117 states and 1124 transitions. Second operand 23 states. [2018-10-12 20:45:41,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:41,787 INFO L93 Difference]: Finished difference Result 1235 states and 1240 transitions. [2018-10-12 20:45:41,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-12 20:45:41,787 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1060 [2018-10-12 20:45:41,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:41,793 INFO L225 Difference]: With dead ends: 1235 [2018-10-12 20:45:41,793 INFO L226 Difference]: Without dead ends: 1235 [2018-10-12 20:45:41,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=808, Invalid=3614, Unknown=0, NotChecked=0, Total=4422 [2018-10-12 20:45:41,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2018-10-12 20:45:41,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1117. [2018-10-12 20:45:41,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2018-10-12 20:45:41,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1122 transitions. [2018-10-12 20:45:41,801 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1122 transitions. Word has length 1060 [2018-10-12 20:45:41,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:41,802 INFO L481 AbstractCegarLoop]: Abstraction has 1117 states and 1122 transitions. [2018-10-12 20:45:41,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-12 20:45:41,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1122 transitions. [2018-10-12 20:45:41,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1075 [2018-10-12 20:45:41,811 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:41,812 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:41,812 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:41,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:41,813 INFO L82 PathProgramCache]: Analyzing trace with hash -2096515283, now seen corresponding path program 24 times [2018-10-12 20:45:41,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:42,925 INFO L134 CoverageAnalysis]: Checked inductivity of 7974 backedges. 2927 proven. 268 refuted. 0 times theorem prover too weak. 4779 trivial. 0 not checked. [2018-10-12 20:45:42,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:42,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-12 20:45:42,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-12 20:45:42,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-12 20:45:42,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2018-10-12 20:45:42,927 INFO L87 Difference]: Start difference. First operand 1117 states and 1122 transitions. Second operand 27 states. [2018-10-12 20:45:45,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:45,802 INFO L93 Difference]: Finished difference Result 1669 states and 1678 transitions. [2018-10-12 20:45:45,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-10-12 20:45:45,803 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 1074 [2018-10-12 20:45:45,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:45,808 INFO L225 Difference]: With dead ends: 1669 [2018-10-12 20:45:45,808 INFO L226 Difference]: Without dead ends: 1669 [2018-10-12 20:45:45,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7278 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2723, Invalid=17017, Unknown=0, NotChecked=0, Total=19740 [2018-10-12 20:45:45,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2018-10-12 20:45:45,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1138. [2018-10-12 20:45:45,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2018-10-12 20:45:45,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1144 transitions. [2018-10-12 20:45:45,823 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1144 transitions. Word has length 1074 [2018-10-12 20:45:45,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:45,824 INFO L481 AbstractCegarLoop]: Abstraction has 1138 states and 1144 transitions. [2018-10-12 20:45:45,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-12 20:45:45,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1144 transitions. [2018-10-12 20:45:45,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1096 [2018-10-12 20:45:45,833 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:45,834 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 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, 20, 20, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:45,834 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:45,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:45,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1114481834, now seen corresponding path program 25 times [2018-10-12 20:45:45,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:47,696 INFO L134 CoverageAnalysis]: Checked inductivity of 8401 backedges. 3327 proven. 325 refuted. 0 times theorem prover too weak. 4749 trivial. 0 not checked. [2018-10-12 20:45:47,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:47,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-12 20:45:47,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-12 20:45:47,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-12 20:45:47,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1004, Unknown=0, NotChecked=0, Total=1122 [2018-10-12 20:45:47,698 INFO L87 Difference]: Start difference. First operand 1138 states and 1144 transitions. Second operand 34 states. [2018-10-12 20:45:53,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:53,887 INFO L93 Difference]: Finished difference Result 1478 states and 1487 transitions. [2018-10-12 20:45:53,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-12 20:45:53,887 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 1095 [2018-10-12 20:45:53,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:53,892 INFO L225 Difference]: With dead ends: 1478 [2018-10-12 20:45:53,892 INFO L226 Difference]: Without dead ends: 1478 [2018-10-12 20:45:53,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1682 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1439, Invalid=5701, Unknown=0, NotChecked=0, Total=7140 [2018-10-12 20:45:53,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2018-10-12 20:45:53,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1152. [2018-10-12 20:45:53,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2018-10-12 20:45:53,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1159 transitions. [2018-10-12 20:45:53,906 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1159 transitions. Word has length 1095 [2018-10-12 20:45:53,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:53,907 INFO L481 AbstractCegarLoop]: Abstraction has 1152 states and 1159 transitions. [2018-10-12 20:45:53,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-12 20:45:53,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1159 transitions. [2018-10-12 20:45:53,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1110 [2018-10-12 20:45:53,917 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:53,918 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:53,918 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:53,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:53,918 INFO L82 PathProgramCache]: Analyzing trace with hash -555695586, now seen corresponding path program 26 times [2018-10-12 20:45:53,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:56,054 INFO L134 CoverageAnalysis]: Checked inductivity of 8691 backedges. 3525 proven. 387 refuted. 0 times theorem prover too weak. 4779 trivial. 0 not checked. [2018-10-12 20:45:56,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:56,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-12 20:45:56,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-12 20:45:56,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-12 20:45:56,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2018-10-12 20:45:56,056 INFO L87 Difference]: Start difference. First operand 1152 states and 1159 transitions. Second operand 31 states. [2018-10-12 20:45:59,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:59,926 INFO L93 Difference]: Finished difference Result 1871 states and 1885 transitions. [2018-10-12 20:45:59,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-10-12 20:45:59,927 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 1109 [2018-10-12 20:45:59,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:59,934 INFO L225 Difference]: With dead ends: 1871 [2018-10-12 20:45:59,934 INFO L226 Difference]: Without dead ends: 1871 [2018-10-12 20:45:59,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11628 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3946, Invalid=26504, Unknown=0, NotChecked=0, Total=30450 [2018-10-12 20:45:59,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2018-10-12 20:45:59,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1252. [2018-10-12 20:45:59,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2018-10-12 20:45:59,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1261 transitions. [2018-10-12 20:45:59,947 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1261 transitions. Word has length 1109 [2018-10-12 20:45:59,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:59,948 INFO L481 AbstractCegarLoop]: Abstraction has 1252 states and 1261 transitions. [2018-10-12 20:45:59,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-12 20:45:59,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1261 transitions. [2018-10-12 20:45:59,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1131 [2018-10-12 20:45:59,958 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:59,958 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 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, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:59,959 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:59,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:59,959 INFO L82 PathProgramCache]: Analyzing trace with hash -693355647, now seen corresponding path program 27 times [2018-10-12 20:45:59,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:01,771 INFO L134 CoverageAnalysis]: Checked inductivity of 9139 backedges. 2078 proven. 6097 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2018-10-12 20:46:01,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:01,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-12 20:46:01,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-12 20:46:01,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-12 20:46:01,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2018-10-12 20:46:01,774 INFO L87 Difference]: Start difference. First operand 1252 states and 1261 transitions. Second operand 30 states. [2018-10-12 20:46:05,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:05,136 INFO L93 Difference]: Finished difference Result 1748 states and 1759 transitions. [2018-10-12 20:46:05,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-12 20:46:05,136 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 1130 [2018-10-12 20:46:05,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:05,142 INFO L225 Difference]: With dead ends: 1748 [2018-10-12 20:46:05,142 INFO L226 Difference]: Without dead ends: 1748 [2018-10-12 20:46:05,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8106 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3604, Invalid=17566, Unknown=0, NotChecked=0, Total=21170 [2018-10-12 20:46:05,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2018-10-12 20:46:05,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1523. [2018-10-12 20:46:05,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1523 states. [2018-10-12 20:46:05,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 1533 transitions. [2018-10-12 20:46:05,156 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 1533 transitions. Word has length 1130 [2018-10-12 20:46:05,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:05,157 INFO L481 AbstractCegarLoop]: Abstraction has 1523 states and 1533 transitions. [2018-10-12 20:46:05,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-12 20:46:05,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1533 transitions. [2018-10-12 20:46:05,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1360 [2018-10-12 20:46:05,171 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:05,172 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 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, 26, 26, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:05,172 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:05,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:05,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1023470489, now seen corresponding path program 28 times [2018-10-12 20:46:05,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:07,327 INFO L134 CoverageAnalysis]: Checked inductivity of 13760 backedges. 9508 proven. 2240 refuted. 0 times theorem prover too weak. 2012 trivial. 0 not checked. [2018-10-12 20:46:07,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:07,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-12 20:46:07,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-12 20:46:07,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-12 20:46:07,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2018-10-12 20:46:07,329 INFO L87 Difference]: Start difference. First operand 1523 states and 1533 transitions. Second operand 28 states. [2018-10-12 20:46:08,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:08,976 INFO L93 Difference]: Finished difference Result 1458 states and 1466 transitions. [2018-10-12 20:46:08,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-12 20:46:08,976 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1359 [2018-10-12 20:46:08,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:08,980 INFO L225 Difference]: With dead ends: 1458 [2018-10-12 20:46:08,980 INFO L226 Difference]: Without dead ends: 1458 [2018-10-12 20:46:08,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=787, Invalid=3373, Unknown=0, NotChecked=0, Total=4160 [2018-10-12 20:46:08,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2018-10-12 20:46:08,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1458. [2018-10-12 20:46:08,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1458 states. [2018-10-12 20:46:08,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 1466 transitions. [2018-10-12 20:46:08,992 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 1466 transitions. Word has length 1359 [2018-10-12 20:46:08,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:08,992 INFO L481 AbstractCegarLoop]: Abstraction has 1458 states and 1466 transitions. [2018-10-12 20:46:08,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-12 20:46:08,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 1466 transitions. [2018-10-12 20:46:09,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1381 [2018-10-12 20:46:09,003 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:09,004 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:09,004 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:09,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:09,005 INFO L82 PathProgramCache]: Analyzing trace with hash 368413500, now seen corresponding path program 29 times [2018-10-12 20:46:09,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:11,067 INFO L134 CoverageAnalysis]: Checked inductivity of 14335 backedges. 8542 proven. 332 refuted. 0 times theorem prover too weak. 5461 trivial. 0 not checked. [2018-10-12 20:46:11,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:11,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-12 20:46:11,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-12 20:46:11,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-12 20:46:11,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2018-10-12 20:46:11,069 INFO L87 Difference]: Start difference. First operand 1458 states and 1466 transitions. Second operand 27 states. [2018-10-12 20:46:13,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:13,472 INFO L93 Difference]: Finished difference Result 1658 states and 1663 transitions. [2018-10-12 20:46:13,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-12 20:46:13,473 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 1380 [2018-10-12 20:46:13,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:13,479 INFO L225 Difference]: With dead ends: 1658 [2018-10-12 20:46:13,479 INFO L226 Difference]: Without dead ends: 1558 [2018-10-12 20:46:13,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1538 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1142, Invalid=5178, Unknown=0, NotChecked=0, Total=6320 [2018-10-12 20:46:13,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2018-10-12 20:46:13,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1437. [2018-10-12 20:46:13,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1437 states. [2018-10-12 20:46:13,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 1442 transitions. [2018-10-12 20:46:13,494 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 1442 transitions. Word has length 1380 [2018-10-12 20:46:13,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:13,495 INFO L481 AbstractCegarLoop]: Abstraction has 1437 states and 1442 transitions. [2018-10-12 20:46:13,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-12 20:46:13,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1442 transitions. [2018-10-12 20:46:13,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1395 [2018-10-12 20:46:13,507 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:13,507 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:13,508 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:13,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:13,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1326961224, now seen corresponding path program 30 times [2018-10-12 20:46:13,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:16,019 INFO L134 CoverageAnalysis]: Checked inductivity of 14710 backedges. 5398 proven. 436 refuted. 0 times theorem prover too weak. 8876 trivial. 0 not checked. [2018-10-12 20:46:16,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:16,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-12 20:46:16,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-12 20:46:16,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-12 20:46:16,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2018-10-12 20:46:16,021 INFO L87 Difference]: Start difference. First operand 1437 states and 1442 transitions. Second operand 38 states. [2018-10-12 20:46:19,775 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-10-12 20:46:23,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:23,204 INFO L93 Difference]: Finished difference Result 1665 states and 1672 transitions. [2018-10-12 20:46:23,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-12 20:46:23,204 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1394 [2018-10-12 20:46:23,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:23,210 INFO L225 Difference]: With dead ends: 1665 [2018-10-12 20:46:23,210 INFO L226 Difference]: Without dead ends: 1665 [2018-10-12 20:46:23,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2066 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1665, Invalid=7077, Unknown=0, NotChecked=0, Total=8742 [2018-10-12 20:46:23,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2018-10-12 20:46:23,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1451. [2018-10-12 20:46:23,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2018-10-12 20:46:23,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 1457 transitions. [2018-10-12 20:46:23,225 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 1457 transitions. Word has length 1394 [2018-10-12 20:46:23,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:23,225 INFO L481 AbstractCegarLoop]: Abstraction has 1451 states and 1457 transitions. [2018-10-12 20:46:23,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-12 20:46:23,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 1457 transitions. [2018-10-12 20:46:23,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1409 [2018-10-12 20:46:23,237 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:23,237 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:23,237 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:23,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:23,238 INFO L82 PathProgramCache]: Analyzing trace with hash -2128362692, now seen corresponding path program 31 times [2018-10-12 20:46:23,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:26,026 INFO L134 CoverageAnalysis]: Checked inductivity of 15099 backedges. 306 proven. 13078 refuted. 0 times theorem prover too weak. 1715 trivial. 0 not checked. [2018-10-12 20:46:26,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:26,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-12 20:46:26,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-12 20:46:26,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-12 20:46:26,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1104, Unknown=0, NotChecked=0, Total=1260 [2018-10-12 20:46:26,028 INFO L87 Difference]: Start difference. First operand 1451 states and 1457 transitions. Second operand 36 states. [2018-10-12 20:46:29,821 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-12 20:46:30,297 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-12 20:46:31,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:31,606 INFO L93 Difference]: Finished difference Result 2134 states and 2145 transitions. [2018-10-12 20:46:31,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-12 20:46:31,613 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 1408 [2018-10-12 20:46:31,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:31,619 INFO L225 Difference]: With dead ends: 2134 [2018-10-12 20:46:31,619 INFO L226 Difference]: Without dead ends: 2134 [2018-10-12 20:46:31,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12230 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=4995, Invalid=26867, Unknown=0, NotChecked=0, Total=31862 [2018-10-12 20:46:31,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2018-10-12 20:46:31,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 1829. [2018-10-12 20:46:31,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1829 states. [2018-10-12 20:46:31,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 1838 transitions. [2018-10-12 20:46:31,640 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 1838 transitions. Word has length 1408 [2018-10-12 20:46:31,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:31,641 INFO L481 AbstractCegarLoop]: Abstraction has 1829 states and 1838 transitions. [2018-10-12 20:46:31,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-12 20:46:31,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 1838 transitions. [2018-10-12 20:46:31,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1673 [2018-10-12 20:46:31,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:31,658 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:31,658 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:31,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:31,658 INFO L82 PathProgramCache]: Analyzing trace with hash -919987517, now seen corresponding path program 32 times [2018-10-12 20:46:31,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:34,651 INFO L134 CoverageAnalysis]: Checked inductivity of 22093 backedges. 15694 proven. 3518 refuted. 0 times theorem prover too weak. 2881 trivial. 0 not checked. [2018-10-12 20:46:34,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:34,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-12 20:46:34,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-12 20:46:34,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-12 20:46:34,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2018-10-12 20:46:34,653 INFO L87 Difference]: Start difference. First operand 1829 states and 1838 transitions. Second operand 32 states. [2018-10-12 20:46:36,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:36,799 INFO L93 Difference]: Finished difference Result 1750 states and 1757 transitions. [2018-10-12 20:46:36,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-12 20:46:36,800 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 1672 [2018-10-12 20:46:36,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:36,805 INFO L225 Difference]: With dead ends: 1750 [2018-10-12 20:46:36,805 INFO L226 Difference]: Without dead ends: 1750 [2018-10-12 20:46:36,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1188 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1048, Invalid=4502, Unknown=0, NotChecked=0, Total=5550 [2018-10-12 20:46:36,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2018-10-12 20:46:36,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1750. [2018-10-12 20:46:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2018-10-12 20:46:36,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 1757 transitions. [2018-10-12 20:46:36,821 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 1757 transitions. Word has length 1672 [2018-10-12 20:46:36,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:36,822 INFO L481 AbstractCegarLoop]: Abstraction has 1750 states and 1757 transitions. [2018-10-12 20:46:36,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-12 20:46:36,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 1757 transitions. [2018-10-12 20:46:36,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1694 [2018-10-12 20:46:36,842 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:36,843 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:36,843 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:36,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:36,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1232257838, now seen corresponding path program 33 times [2018-10-12 20:46:36,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:38,779 INFO L134 CoverageAnalysis]: Checked inductivity of 22816 backedges. 12691 proven. 444 refuted. 0 times theorem prover too weak. 9681 trivial. 0 not checked. [2018-10-12 20:46:38,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:38,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-12 20:46:38,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-12 20:46:38,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-12 20:46:38,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2018-10-12 20:46:38,781 INFO L87 Difference]: Start difference. First operand 1750 states and 1757 transitions. Second operand 31 states. [2018-10-12 20:46:42,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:42,069 INFO L93 Difference]: Finished difference Result 1868 states and 1873 transitions. [2018-10-12 20:46:42,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-12 20:46:42,069 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 1693 [2018-10-12 20:46:42,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:42,073 INFO L225 Difference]: With dead ends: 1868 [2018-10-12 20:46:42,073 INFO L226 Difference]: Without dead ends: 1868 [2018-10-12 20:46:42,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1536, Invalid=7020, Unknown=0, NotChecked=0, Total=8556 [2018-10-12 20:46:42,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2018-10-12 20:46:42,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1750. [2018-10-12 20:46:42,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2018-10-12 20:46:42,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 1755 transitions. [2018-10-12 20:46:42,084 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 1755 transitions. Word has length 1693 [2018-10-12 20:46:42,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:42,085 INFO L481 AbstractCegarLoop]: Abstraction has 1750 states and 1755 transitions. [2018-10-12 20:46:42,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-12 20:46:42,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 1755 transitions. [2018-10-12 20:46:42,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1708 [2018-10-12 20:46:42,102 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:42,102 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:42,102 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:42,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:42,103 INFO L82 PathProgramCache]: Analyzing trace with hash 282475358, now seen corresponding path program 34 times [2018-10-12 20:46:42,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:44,427 INFO L134 CoverageAnalysis]: Checked inductivity of 23304 backedges. 7435 proven. 527 refuted. 0 times theorem prover too weak. 15342 trivial. 0 not checked. [2018-10-12 20:46:44,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:44,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-12 20:46:44,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-12 20:46:44,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-12 20:46:44,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1036, Unknown=0, NotChecked=0, Total=1190 [2018-10-12 20:46:44,429 INFO L87 Difference]: Start difference. First operand 1750 states and 1755 transitions. Second operand 35 states. [2018-10-12 20:46:49,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:49,364 INFO L93 Difference]: Finished difference Result 2400 states and 2409 transitions. [2018-10-12 20:46:49,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-10-12 20:46:49,364 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 1707 [2018-10-12 20:46:49,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:49,367 INFO L225 Difference]: With dead ends: 2400 [2018-10-12 20:46:49,367 INFO L226 Difference]: Without dead ends: 2400 [2018-10-12 20:46:49,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17008 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5419, Invalid=37637, Unknown=0, NotChecked=0, Total=43056 [2018-10-12 20:46:49,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2018-10-12 20:46:49,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 1771. [2018-10-12 20:46:49,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2018-10-12 20:46:49,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 1777 transitions. [2018-10-12 20:46:49,380 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 1777 transitions. Word has length 1707 [2018-10-12 20:46:49,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:49,381 INFO L481 AbstractCegarLoop]: Abstraction has 1771 states and 1777 transitions. [2018-10-12 20:46:49,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-12 20:46:49,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 1777 transitions. [2018-10-12 20:46:49,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1729 [2018-10-12 20:46:49,398 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:49,398 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:49,399 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:49,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:49,399 INFO L82 PathProgramCache]: Analyzing trace with hash 155227497, now seen corresponding path program 35 times [2018-10-12 20:46:49,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:50,224 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-12 20:46:50,476 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-12 20:46:53,146 INFO L134 CoverageAnalysis]: Checked inductivity of 24048 backedges. 8185 proven. 561 refuted. 0 times theorem prover too weak. 15302 trivial. 0 not checked. [2018-10-12 20:46:53,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:53,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-12 20:46:53,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-12 20:46:53,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-12 20:46:53,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1544, Unknown=0, NotChecked=0, Total=1722 [2018-10-12 20:46:53,148 INFO L87 Difference]: Start difference. First operand 1771 states and 1777 transitions. Second operand 42 states. [2018-10-12 20:46:59,858 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2018-10-12 20:47:02,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:02,318 INFO L93 Difference]: Finished difference Result 2139 states and 2148 transitions. [2018-10-12 20:47:02,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-12 20:47:02,318 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1728 [2018-10-12 20:47:02,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:02,323 INFO L225 Difference]: With dead ends: 2139 [2018-10-12 20:47:02,323 INFO L226 Difference]: Without dead ends: 2139 [2018-10-12 20:47:02,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2754 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=2274, Invalid=9068, Unknown=0, NotChecked=0, Total=11342 [2018-10-12 20:47:02,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2018-10-12 20:47:02,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1785. [2018-10-12 20:47:02,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1785 states. [2018-10-12 20:47:02,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 1792 transitions. [2018-10-12 20:47:02,339 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 1792 transitions. Word has length 1728 [2018-10-12 20:47:02,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:02,340 INFO L481 AbstractCegarLoop]: Abstraction has 1785 states and 1792 transitions. [2018-10-12 20:47:02,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-12 20:47:02,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 1792 transitions. [2018-10-12 20:47:02,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1743 [2018-10-12 20:47:02,365 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:02,366 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:47:02,366 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:02,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:02,367 INFO L82 PathProgramCache]: Analyzing trace with hash 209975453, now seen corresponding path program 36 times [2018-10-12 20:47:02,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:47:04,592 INFO L134 CoverageAnalysis]: Checked inductivity of 24550 backedges. 8520 proven. 688 refuted. 0 times theorem prover too weak. 15342 trivial. 0 not checked. [2018-10-12 20:47:04,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:47:04,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-12 20:47:04,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-12 20:47:04,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-12 20:47:04,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1292, Unknown=0, NotChecked=0, Total=1482 [2018-10-12 20:47:04,594 INFO L87 Difference]: Start difference. First operand 1785 states and 1792 transitions. Second operand 39 states. [2018-10-12 20:47:10,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:10,856 INFO L93 Difference]: Finished difference Result 2630 states and 2644 transitions. [2018-10-12 20:47:10,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2018-10-12 20:47:10,857 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 1742 [2018-10-12 20:47:10,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:10,863 INFO L225 Difference]: With dead ends: 2630 [2018-10-12 20:47:10,863 INFO L226 Difference]: Without dead ends: 2630 [2018-10-12 20:47:10,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24773 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7404, Invalid=53852, Unknown=0, NotChecked=0, Total=61256 [2018-10-12 20:47:10,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2018-10-12 20:47:10,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 1913. [2018-10-12 20:47:10,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1913 states. [2018-10-12 20:47:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 1922 transitions. [2018-10-12 20:47:10,884 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 1922 transitions. Word has length 1742 [2018-10-12 20:47:10,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:10,885 INFO L481 AbstractCegarLoop]: Abstraction has 1913 states and 1922 transitions. [2018-10-12 20:47:10,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-12 20:47:10,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 1922 transitions. [2018-10-12 20:47:10,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1764 [2018-10-12 20:47:10,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:10,908 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:47:10,908 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:10,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:10,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1537029454, now seen corresponding path program 37 times [2018-10-12 20:47:10,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:47:14,399 INFO L134 CoverageAnalysis]: Checked inductivity of 25315 backedges. 4604 proven. 18271 refuted. 0 times theorem prover too weak. 2440 trivial. 0 not checked. [2018-10-12 20:47:14,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:47:14,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-12 20:47:14,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-12 20:47:14,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-12 20:47:14,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1218, Unknown=0, NotChecked=0, Total=1406 [2018-10-12 20:47:14,401 INFO L87 Difference]: Start difference. First operand 1913 states and 1922 transitions. Second operand 38 states. [2018-10-12 20:47:19,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:19,805 INFO L93 Difference]: Finished difference Result 2535 states and 2546 transitions. [2018-10-12 20:47:19,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-10-12 20:47:19,805 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1763 [2018-10-12 20:47:19,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:19,809 INFO L225 Difference]: With dead ends: 2535 [2018-10-12 20:47:19,809 INFO L226 Difference]: Without dead ends: 2535 [2018-10-12 20:47:19,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18146 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6942, Invalid=37368, Unknown=0, NotChecked=0, Total=44310 [2018-10-12 20:47:19,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2018-10-12 20:47:19,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 2254. [2018-10-12 20:47:19,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2254 states. [2018-10-12 20:47:19,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 2264 transitions. [2018-10-12 20:47:19,831 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 2264 transitions. Word has length 1763 [2018-10-12 20:47:19,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:19,832 INFO L481 AbstractCegarLoop]: Abstraction has 2254 states and 2264 transitions. [2018-10-12 20:47:19,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-12 20:47:19,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 2264 transitions. [2018-10-12 20:47:19,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2063 [2018-10-12 20:47:19,861 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:19,862 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:47:19,862 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:19,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:19,863 INFO L82 PathProgramCache]: Analyzing trace with hash -947970224, now seen corresponding path program 38 times [2018-10-12 20:47:19,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:47:24,027 INFO L134 CoverageAnalysis]: Checked inductivity of 35712 backedges. 26156 proven. 5221 refuted. 0 times theorem prover too weak. 4335 trivial. 0 not checked. [2018-10-12 20:47:24,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:47:24,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-12 20:47:24,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-12 20:47:24,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-12 20:47:24,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2018-10-12 20:47:24,029 INFO L87 Difference]: Start difference. First operand 2254 states and 2264 transitions. Second operand 36 states. [2018-10-12 20:47:27,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:27,108 INFO L93 Difference]: Finished difference Result 2161 states and 2169 transitions. [2018-10-12 20:47:27,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-12 20:47:27,108 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 2062 [2018-10-12 20:47:27,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:27,111 INFO L225 Difference]: With dead ends: 2161 [2018-10-12 20:47:27,112 INFO L226 Difference]: Without dead ends: 2161 [2018-10-12 20:47:27,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1562 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1347, Invalid=5793, Unknown=0, NotChecked=0, Total=7140 [2018-10-12 20:47:27,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2161 states. [2018-10-12 20:47:27,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2161 to 2161. [2018-10-12 20:47:27,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2161 states. [2018-10-12 20:47:27,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2161 states to 2161 states and 2169 transitions. [2018-10-12 20:47:27,130 INFO L78 Accepts]: Start accepts. Automaton has 2161 states and 2169 transitions. Word has length 2062 [2018-10-12 20:47:27,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:27,131 INFO L481 AbstractCegarLoop]: Abstraction has 2161 states and 2169 transitions. [2018-10-12 20:47:27,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-12 20:47:27,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 2169 transitions. [2018-10-12 20:47:27,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2084 [2018-10-12 20:47:27,163 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:27,164 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 44, 44, 44, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:47:27,164 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:27,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:27,165 INFO L82 PathProgramCache]: Analyzing trace with hash 697706853, now seen corresponding path program 39 times [2018-10-12 20:47:27,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:47:29,656 INFO L134 CoverageAnalysis]: Checked inductivity of 36646 backedges. 19545 proven. 570 refuted. 0 times theorem prover too weak. 16531 trivial. 0 not checked. [2018-10-12 20:47:29,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:47:29,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-12 20:47:29,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-12 20:47:29,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-12 20:47:29,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1036, Unknown=0, NotChecked=0, Total=1190 [2018-10-12 20:47:29,658 INFO L87 Difference]: Start difference. First operand 2161 states and 2169 transitions. Second operand 35 states. [2018-10-12 20:47:33,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:33,623 INFO L93 Difference]: Finished difference Result 2389 states and 2394 transitions. [2018-10-12 20:47:33,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-12 20:47:33,624 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 2083 [2018-10-12 20:47:33,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:33,627 INFO L225 Difference]: With dead ends: 2389 [2018-10-12 20:47:33,627 INFO L226 Difference]: Without dead ends: 2261 [2018-10-12 20:47:33,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2852 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1990, Invalid=9140, Unknown=0, NotChecked=0, Total=11130 [2018-10-12 20:47:33,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2018-10-12 20:47:33,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 2140. [2018-10-12 20:47:33,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2018-10-12 20:47:33,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2145 transitions. [2018-10-12 20:47:33,646 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2145 transitions. Word has length 2083 [2018-10-12 20:47:33,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:33,647 INFO L481 AbstractCegarLoop]: Abstraction has 2140 states and 2145 transitions. [2018-10-12 20:47:33,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-12 20:47:33,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2145 transitions. [2018-10-12 20:47:33,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2098 [2018-10-12 20:47:33,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:33,679 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:47:33,679 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:33,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:33,680 INFO L82 PathProgramCache]: Analyzing trace with hash -707954255, now seen corresponding path program 40 times [2018-10-12 20:47:33,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:47:34,647 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-12 20:47:34,882 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-12 20:47:35,139 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-10-12 20:47:35,470 WARN L178 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-10-12 20:47:39,417 INFO L134 CoverageAnalysis]: Checked inductivity of 37261 backedges. 11793 proven. 700 refuted. 0 times theorem prover too weak. 24768 trivial. 0 not checked. [2018-10-12 20:47:39,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:47:39,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-12 20:47:39,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-12 20:47:39,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-12 20:47:39,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1720, Unknown=0, NotChecked=0, Total=1892 [2018-10-12 20:47:39,419 INFO L87 Difference]: Start difference. First operand 2140 states and 2145 transitions. Second operand 44 states. [2018-10-12 20:47:46,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:46,155 INFO L93 Difference]: Finished difference Result 2368 states and 2375 transitions. [2018-10-12 20:47:46,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-12 20:47:46,155 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 2097 [2018-10-12 20:47:46,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:46,160 INFO L225 Difference]: With dead ends: 2368 [2018-10-12 20:47:46,160 INFO L226 Difference]: Without dead ends: 2368 [2018-10-12 20:47:46,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3045 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1856, Invalid=9916, Unknown=0, NotChecked=0, Total=11772 [2018-10-12 20:47:46,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2018-10-12 20:47:46,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2154. [2018-10-12 20:47:46,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2018-10-12 20:47:46,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 2160 transitions. [2018-10-12 20:47:46,172 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 2160 transitions. Word has length 2097 [2018-10-12 20:47:46,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:46,173 INFO L481 AbstractCegarLoop]: Abstraction has 2154 states and 2160 transitions. [2018-10-12 20:47:46,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-12 20:47:46,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 2160 transitions. [2018-10-12 20:47:46,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2112 [2018-10-12 20:47:46,197 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:46,198 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:47:46,198 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:46,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:46,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1536704795, now seen corresponding path program 41 times [2018-10-12 20:47:46,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:47:50,775 INFO L134 CoverageAnalysis]: Checked inductivity of 37890 backedges. 543 proven. 33570 refuted. 0 times theorem prover too weak. 3777 trivial. 0 not checked. [2018-10-12 20:47:50,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:47:50,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-12 20:47:50,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-12 20:47:50,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-12 20:47:50,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1660, Unknown=0, NotChecked=0, Total=1892 [2018-10-12 20:47:50,777 INFO L87 Difference]: Start difference. First operand 2154 states and 2160 transitions. Second operand 44 states. [2018-10-12 20:47:58,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:58,566 INFO L93 Difference]: Finished difference Result 3005 states and 3016 transitions. [2018-10-12 20:47:58,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2018-10-12 20:47:58,566 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 2111 [2018-10-12 20:47:58,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:58,570 INFO L225 Difference]: With dead ends: 3005 [2018-10-12 20:47:58,570 INFO L226 Difference]: Without dead ends: 3005 [2018-10-12 20:47:58,574 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25981 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9304, Invalid=53948, Unknown=0, NotChecked=0, Total=63252 [2018-10-12 20:47:58,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2018-10-12 20:47:58,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 2630. [2018-10-12 20:47:58,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2018-10-12 20:47:58,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 2639 transitions. [2018-10-12 20:47:58,589 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 2639 transitions. Word has length 2111 [2018-10-12 20:47:58,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:58,590 INFO L481 AbstractCegarLoop]: Abstraction has 2630 states and 2639 transitions. [2018-10-12 20:47:58,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-12 20:47:58,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 2639 transitions. [2018-10-12 20:47:58,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2446 [2018-10-12 20:47:58,624 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:58,625 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:47:58,625 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:58,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:58,626 INFO L82 PathProgramCache]: Analyzing trace with hash 966046052, now seen corresponding path program 42 times [2018-10-12 20:47:58,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:48:03,849 INFO L134 CoverageAnalysis]: Checked inductivity of 52275 backedges. 39088 proven. 7412 refuted. 0 times theorem prover too weak. 5775 trivial. 0 not checked. [2018-10-12 20:48:03,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:48:03,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-12 20:48:03,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-12 20:48:03,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-12 20:48:03,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1353, Unknown=0, NotChecked=0, Total=1560 [2018-10-12 20:48:03,851 INFO L87 Difference]: Start difference. First operand 2630 states and 2639 transitions. Second operand 40 states. [2018-10-12 20:48:07,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:48:07,133 INFO L93 Difference]: Finished difference Result 2523 states and 2530 transitions. [2018-10-12 20:48:07,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-12 20:48:07,133 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 2445 [2018-10-12 20:48:07,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:48:07,137 INFO L225 Difference]: With dead ends: 2523 [2018-10-12 20:48:07,138 INFO L226 Difference]: Without dead ends: 2523 [2018-10-12 20:48:07,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1987 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1684, Invalid=7246, Unknown=0, NotChecked=0, Total=8930 [2018-10-12 20:48:07,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2523 states. [2018-10-12 20:48:07,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2523 to 2523. [2018-10-12 20:48:07,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2523 states. [2018-10-12 20:48:07,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 2530 transitions. [2018-10-12 20:48:07,151 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 2530 transitions. Word has length 2445 [2018-10-12 20:48:07,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:48:07,152 INFO L481 AbstractCegarLoop]: Abstraction has 2523 states and 2530 transitions. [2018-10-12 20:48:07,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-12 20:48:07,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 2530 transitions. [2018-10-12 20:48:07,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2467 [2018-10-12 20:48:07,183 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:48:07,184 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:48:07,184 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:48:07,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:48:07,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1481738159, now seen corresponding path program 43 times [2018-10-12 20:48:07,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:48:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:48:10,404 INFO L134 CoverageAnalysis]: Checked inductivity of 53399 backedges. 26571 proven. 710 refuted. 0 times theorem prover too weak. 26118 trivial. 0 not checked. [2018-10-12 20:48:10,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:48:10,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-12 20:48:10,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-12 20:48:10,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-12 20:48:10,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1292, Unknown=0, NotChecked=0, Total=1482 [2018-10-12 20:48:10,406 INFO L87 Difference]: Start difference. First operand 2523 states and 2530 transitions. Second operand 39 states. [2018-10-12 20:48:15,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:48:15,368 INFO L93 Difference]: Finished difference Result 2641 states and 2646 transitions. [2018-10-12 20:48:15,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-12 20:48:15,369 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 2466 [2018-10-12 20:48:15,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:48:15,373 INFO L225 Difference]: With dead ends: 2641 [2018-10-12 20:48:15,373 INFO L226 Difference]: Without dead ends: 2641 [2018-10-12 20:48:15,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3659 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2504, Invalid=11538, Unknown=0, NotChecked=0, Total=14042 [2018-10-12 20:48:15,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2641 states. [2018-10-12 20:48:15,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2641 to 2523. [2018-10-12 20:48:15,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2523 states. [2018-10-12 20:48:15,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 2528 transitions. [2018-10-12 20:48:15,389 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 2528 transitions. Word has length 2466 [2018-10-12 20:48:15,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:48:15,390 INFO L481 AbstractCegarLoop]: Abstraction has 2523 states and 2528 transitions. [2018-10-12 20:48:15,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-12 20:48:15,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 2528 transitions. [2018-10-12 20:48:15,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2481 [2018-10-12 20:48:15,424 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:48:15,425 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:48:15,425 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:48:15,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:48:15,426 INFO L82 PathProgramCache]: Analyzing trace with hash -329338467, now seen corresponding path program 44 times [2018-10-12 20:48:15,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:48:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:48:19,238 INFO L134 CoverageAnalysis]: Checked inductivity of 54155 backedges. 15115 proven. 870 refuted. 0 times theorem prover too weak. 38170 trivial. 0 not checked. [2018-10-12 20:48:19,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:48:19,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-12 20:48:19,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-12 20:48:19,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-12 20:48:19,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1576, Unknown=0, NotChecked=0, Total=1806 [2018-10-12 20:48:19,240 INFO L87 Difference]: Start difference. First operand 2523 states and 2528 transitions. Second operand 43 states. [2018-10-12 20:48:27,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:48:27,200 INFO L93 Difference]: Finished difference Result 3271 states and 3280 transitions. [2018-10-12 20:48:27,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 249 states. [2018-10-12 20:48:27,200 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 2480 [2018-10-12 20:48:27,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:48:27,204 INFO L225 Difference]: With dead ends: 3271 [2018-10-12 20:48:27,205 INFO L226 Difference]: Without dead ends: 3271 [2018-10-12 20:48:27,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34132 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=9762, Invalid=72320, Unknown=0, NotChecked=0, Total=82082 [2018-10-12 20:48:27,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3271 states. [2018-10-12 20:48:27,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3271 to 2544. [2018-10-12 20:48:27,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2544 states. [2018-10-12 20:48:27,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 2550 transitions. [2018-10-12 20:48:27,231 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 2550 transitions. Word has length 2480 [2018-10-12 20:48:27,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:48:27,233 INFO L481 AbstractCegarLoop]: Abstraction has 2544 states and 2550 transitions. [2018-10-12 20:48:27,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-12 20:48:27,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 2550 transitions. [2018-10-12 20:48:27,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2502 [2018-10-12 20:48:27,280 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:48:27,281 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:48:27,281 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:48:27,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:48:27,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1283952422, now seen corresponding path program 45 times [2018-10-12 20:48:27,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:48:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:48:32,690 INFO L134 CoverageAnalysis]: Checked inductivity of 55300 backedges. 16327 proven. 853 refuted. 0 times theorem prover too weak. 38120 trivial. 0 not checked. [2018-10-12 20:48:32,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:48:32,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-12 20:48:32,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-12 20:48:32,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-12 20:48:32,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=2196, Unknown=0, NotChecked=0, Total=2450 [2018-10-12 20:48:32,692 INFO L87 Difference]: Start difference. First operand 2544 states and 2550 transitions. Second operand 50 states. [2018-10-12 20:48:42,132 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2018-10-12 20:48:42,488 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2018-10-12 20:48:45,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:48:45,229 INFO L93 Difference]: Finished difference Result 2940 states and 2949 transitions. [2018-10-12 20:48:45,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-12 20:48:45,230 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 2501 [2018-10-12 20:48:45,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:48:45,233 INFO L225 Difference]: With dead ends: 2940 [2018-10-12 20:48:45,234 INFO L226 Difference]: Without dead ends: 2940 [2018-10-12 20:48:45,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4090 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=3297, Invalid=13215, Unknown=0, NotChecked=0, Total=16512 [2018-10-12 20:48:45,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2018-10-12 20:48:45,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2558. [2018-10-12 20:48:45,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2558 states. [2018-10-12 20:48:45,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 2565 transitions. [2018-10-12 20:48:45,252 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 2565 transitions. Word has length 2501 [2018-10-12 20:48:45,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:48:45,253 INFO L481 AbstractCegarLoop]: Abstraction has 2558 states and 2565 transitions. [2018-10-12 20:48:45,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-12 20:48:45,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 2565 transitions. [2018-10-12 20:48:45,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2516 [2018-10-12 20:48:45,286 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:48:45,287 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:48:45,287 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:48:45,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:48:45,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1748662862, now seen corresponding path program 46 times [2018-10-12 20:48:45,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:48:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:48:49,033 INFO L134 CoverageAnalysis]: Checked inductivity of 56070 backedges. 16827 proven. 1073 refuted. 0 times theorem prover too weak. 38170 trivial. 0 not checked. [2018-10-12 20:48:49,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:48:49,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-12 20:48:49,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-12 20:48:49,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-12 20:48:49,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1888, Unknown=0, NotChecked=0, Total=2162 [2018-10-12 20:48:49,035 INFO L87 Difference]: Start difference. First operand 2558 states and 2565 transitions. Second operand 47 states. [2018-10-12 20:48:58,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:48:58,278 INFO L93 Difference]: Finished difference Result 3529 states and 3543 transitions. [2018-10-12 20:48:58,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 291 states. [2018-10-12 20:48:58,279 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 2515 [2018-10-12 20:48:58,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:48:58,284 INFO L225 Difference]: With dead ends: 3529 [2018-10-12 20:48:58,284 INFO L226 Difference]: Without dead ends: 3529 [2018-10-12 20:48:58,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 331 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46772 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12801, Invalid=97755, Unknown=0, NotChecked=0, Total=110556 [2018-10-12 20:48:58,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3529 states. [2018-10-12 20:48:58,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3529 to 2714. [2018-10-12 20:48:58,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2714 states. [2018-10-12 20:48:58,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 2723 transitions. [2018-10-12 20:48:58,308 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 2723 transitions. Word has length 2515 [2018-10-12 20:48:58,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:48:58,309 INFO L481 AbstractCegarLoop]: Abstraction has 2714 states and 2723 transitions. [2018-10-12 20:48:58,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-12 20:48:58,309 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 2723 transitions. [2018-10-12 20:48:58,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2537 [2018-10-12 20:48:58,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:48:58,343 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:48:58,343 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:48:58,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:48:58,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1600075279, now seen corresponding path program 47 times [2018-10-12 20:48:58,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:48:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:49:04,242 INFO L134 CoverageAnalysis]: Checked inductivity of 57236 backedges. 8610 proven. 43666 refuted. 0 times theorem prover too weak. 4960 trivial. 0 not checked. [2018-10-12 20:49:04,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:49:04,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-12 20:49:04,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-12 20:49:04,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-12 20:49:04,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1798, Unknown=0, NotChecked=0, Total=2070 [2018-10-12 20:49:04,245 INFO L87 Difference]: Start difference. First operand 2714 states and 2723 transitions. Second operand 46 states. [2018-10-12 20:49:12,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:49:12,488 INFO L93 Difference]: Finished difference Result 3462 states and 3473 transitions. [2018-10-12 20:49:12,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 246 states. [2018-10-12 20:49:12,488 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 2536 [2018-10-12 20:49:12,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:49:12,492 INFO L225 Difference]: With dead ends: 3462 [2018-10-12 20:49:12,492 INFO L226 Difference]: Without dead ends: 3462 [2018-10-12 20:49:12,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35596 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=12251, Invalid=70405, Unknown=0, NotChecked=0, Total=82656 [2018-10-12 20:49:12,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3462 states. [2018-10-12 20:49:12,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3462 to 3125. [2018-10-12 20:49:12,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2018-10-12 20:49:12,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 3135 transitions. [2018-10-12 20:49:12,514 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 3135 transitions. Word has length 2536 [2018-10-12 20:49:12,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:49:12,515 INFO L481 AbstractCegarLoop]: Abstraction has 3125 states and 3135 transitions. [2018-10-12 20:49:12,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-12 20:49:12,515 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 3135 transitions. [2018-10-12 20:49:12,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2906 [2018-10-12 20:49:12,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:49:12,559 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:49:12,559 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:49:12,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:49:12,559 INFO L82 PathProgramCache]: Analyzing trace with hash -398801351, now seen corresponding path program 48 times [2018-10-12 20:49:12,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:49:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:49:19,886 INFO L134 CoverageAnalysis]: Checked inductivity of 76933 backedges. 58825 proven. 10154 refuted. 0 times theorem prover too weak. 7954 trivial. 0 not checked. [2018-10-12 20:49:19,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:49:19,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-12 20:49:19,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-12 20:49:19,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-12 20:49:19,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1643, Unknown=0, NotChecked=0, Total=1892 [2018-10-12 20:49:19,889 INFO L87 Difference]: Start difference. First operand 3125 states and 3135 transitions. Second operand 44 states. [2018-10-12 20:49:22,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:49:22,705 INFO L93 Difference]: Finished difference Result 3004 states and 3012 transitions. [2018-10-12 20:49:22,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-12 20:49:22,706 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 2905 [2018-10-12 20:49:22,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:49:22,709 INFO L225 Difference]: With dead ends: 3004 [2018-10-12 20:49:22,709 INFO L226 Difference]: Without dead ends: 3004 [2018-10-12 20:49:22,710 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2463 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2059, Invalid=8861, Unknown=0, NotChecked=0, Total=10920 [2018-10-12 20:49:22,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2018-10-12 20:49:22,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 3004. [2018-10-12 20:49:22,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3004 states. [2018-10-12 20:49:22,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 3012 transitions. [2018-10-12 20:49:22,725 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 3012 transitions. Word has length 2905 [2018-10-12 20:49:22,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:49:22,726 INFO L481 AbstractCegarLoop]: Abstraction has 3004 states and 3012 transitions. [2018-10-12 20:49:22,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-12 20:49:22,726 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 3012 transitions. [2018-10-12 20:49:22,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2927 [2018-10-12 20:49:22,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:49:22,772 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 65, 65, 65, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:49:22,772 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:49:22,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:49:22,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1747583076, now seen corresponding path program 49 times [2018-10-12 20:49:22,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:49:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:49:27,574 INFO L134 CoverageAnalysis]: Checked inductivity of 78310 backedges. 37440 proven. 864 refuted. 0 times theorem prover too weak. 40006 trivial. 0 not checked. [2018-10-12 20:49:27,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:49:27,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-12 20:49:27,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-12 20:49:27,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-12 20:49:27,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1576, Unknown=0, NotChecked=0, Total=1806 [2018-10-12 20:49:27,576 INFO L87 Difference]: Start difference. First operand 3004 states and 3012 transitions. Second operand 43 states. [2018-10-12 20:49:32,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:49:32,826 INFO L93 Difference]: Finished difference Result 3260 states and 3265 transitions. [2018-10-12 20:49:32,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-12 20:49:32,827 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 2926 [2018-10-12 20:49:32,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:49:32,829 INFO L225 Difference]: With dead ends: 3260 [2018-10-12 20:49:32,829 INFO L226 Difference]: Without dead ends: 3104 [2018-10-12 20:49:32,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4566 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3078, Invalid=14214, Unknown=0, NotChecked=0, Total=17292 [2018-10-12 20:49:32,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3104 states. [2018-10-12 20:49:32,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3104 to 2983. [2018-10-12 20:49:32,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2983 states. [2018-10-12 20:49:32,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 2988 transitions. [2018-10-12 20:49:32,844 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 2988 transitions. Word has length 2926 [2018-10-12 20:49:32,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:49:32,845 INFO L481 AbstractCegarLoop]: Abstraction has 2983 states and 2988 transitions. [2018-10-12 20:49:32,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-12 20:49:32,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 2988 transitions. [2018-10-12 20:49:32,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2941 [2018-10-12 20:49:32,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:49:32,889 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:49:32,890 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:49:32,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:49:32,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1983375528, now seen corresponding path program 50 times [2018-10-12 20:49:32,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:49:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:49:39,991 INFO L134 CoverageAnalysis]: Checked inductivity of 79221 backedges. 21892 proven. 1020 refuted. 0 times theorem prover too weak. 56309 trivial. 0 not checked. [2018-10-12 20:49:39,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:49:39,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-12 20:49:39,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-12 20:49:39,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-12 20:49:39,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=2581, Unknown=0, NotChecked=0, Total=2862 [2018-10-12 20:49:39,993 INFO L87 Difference]: Start difference. First operand 2983 states and 2988 transitions. Second operand 54 states. [2018-10-12 20:49:48,407 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2018-10-12 20:49:48,923 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2018-10-12 20:49:49,490 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2018-10-12 20:49:49,650 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2018-10-12 20:49:50,070 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2018-10-12 20:49:50,234 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2018-10-12 20:49:50,412 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2018-10-12 20:49:50,720 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2018-10-12 20:49:50,895 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2018-10-12 20:49:51,356 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2018-10-12 20:49:53,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:49:53,339 INFO L93 Difference]: Finished difference Result 3211 states and 3218 transitions. [2018-10-12 20:49:53,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-12 20:49:53,339 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 2940 [2018-10-12 20:49:53,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:49:53,343 INFO L225 Difference]: With dead ends: 3211 [2018-10-12 20:49:53,343 INFO L226 Difference]: Without dead ends: 3211 [2018-10-12 20:49:53,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4674 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=3643, Invalid=15263, Unknown=0, NotChecked=0, Total=18906 [2018-10-12 20:49:53,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3211 states. [2018-10-12 20:49:53,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3211 to 2997. [2018-10-12 20:49:53,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2997 states. [2018-10-12 20:49:53,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2997 states to 2997 states and 3003 transitions. [2018-10-12 20:49:53,358 INFO L78 Accepts]: Start accepts. Automaton has 2997 states and 3003 transitions. Word has length 2940 [2018-10-12 20:49:53,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:49:53,359 INFO L481 AbstractCegarLoop]: Abstraction has 2997 states and 3003 transitions. [2018-10-12 20:49:53,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-12 20:49:53,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2997 states and 3003 transitions. [2018-10-12 20:49:53,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2955 [2018-10-12 20:49:53,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:49:53,402 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:49:53,402 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:49:53,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:49:53,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1034760604, now seen corresponding path program 51 times [2018-10-12 20:49:53,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:49:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:01,251 INFO L134 CoverageAnalysis]: Checked inductivity of 80146 backedges. 848 proven. 72247 refuted. 0 times theorem prover too weak. 7051 trivial. 0 not checked. [2018-10-12 20:50:01,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:01,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-12 20:50:01,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-12 20:50:01,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-12 20:50:01,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=2328, Unknown=0, NotChecked=0, Total=2652 [2018-10-12 20:50:01,253 INFO L87 Difference]: Start difference. First operand 2997 states and 3003 transitions. Second operand 52 states. [2018-10-12 20:50:12,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:12,865 INFO L93 Difference]: Finished difference Result 4016 states and 4027 transitions. [2018-10-12 20:50:12,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 289 states. [2018-10-12 20:50:12,866 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 2954 [2018-10-12 20:50:12,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:12,869 INFO L225 Difference]: With dead ends: 4016 [2018-10-12 20:50:12,869 INFO L226 Difference]: Without dead ends: 4016 [2018-10-12 20:50:12,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 335 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48918 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=15960, Invalid=97272, Unknown=0, NotChecked=0, Total=113232 [2018-10-12 20:50:12,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4016 states. [2018-10-12 20:50:12,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4016 to 3571. [2018-10-12 20:50:12,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3571 states. [2018-10-12 20:50:12,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3571 states to 3571 states and 3580 transitions. [2018-10-12 20:50:12,894 INFO L78 Accepts]: Start accepts. Automaton has 3571 states and 3580 transitions. Word has length 2954 [2018-10-12 20:50:12,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:12,895 INFO L481 AbstractCegarLoop]: Abstraction has 3571 states and 3580 transitions. [2018-10-12 20:50:12,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-12 20:50:12,895 INFO L276 IsEmpty]: Start isEmpty. Operand 3571 states and 3580 transitions. [2018-10-12 20:50:12,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3359 [2018-10-12 20:50:12,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:12,943 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:50:12,944 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:12,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:12,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1687851667, now seen corresponding path program 52 times [2018-10-12 20:50:12,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:22,410 INFO L134 CoverageAnalysis]: Checked inductivity of 105866 backedges. 82251 proven. 13510 refuted. 0 times theorem prover too weak. 10105 trivial. 0 not checked. [2018-10-12 20:50:22,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:22,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-12 20:50:22,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-12 20:50:22,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-12 20:50:22,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1961, Unknown=0, NotChecked=0, Total=2256 [2018-10-12 20:50:22,412 INFO L87 Difference]: Start difference. First operand 3571 states and 3580 transitions. Second operand 48 states. [2018-10-12 20:50:26,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:26,338 INFO L93 Difference]: Finished difference Result 3436 states and 3443 transitions. [2018-10-12 20:50:26,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-12 20:50:26,338 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 3358 [2018-10-12 20:50:26,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:26,343 INFO L225 Difference]: With dead ends: 3436 [2018-10-12 20:50:26,343 INFO L226 Difference]: Without dead ends: 3436 [2018-10-12 20:50:26,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2990 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2472, Invalid=10638, Unknown=0, NotChecked=0, Total=13110 [2018-10-12 20:50:26,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3436 states. [2018-10-12 20:50:26,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3436 to 3436. [2018-10-12 20:50:26,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3436 states. [2018-10-12 20:50:26,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3436 states to 3436 states and 3443 transitions. [2018-10-12 20:50:26,361 INFO L78 Accepts]: Start accepts. Automaton has 3436 states and 3443 transitions. Word has length 3358 [2018-10-12 20:50:26,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:26,362 INFO L481 AbstractCegarLoop]: Abstraction has 3436 states and 3443 transitions. [2018-10-12 20:50:26,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-12 20:50:26,362 INFO L276 IsEmpty]: Start isEmpty. Operand 3436 states and 3443 transitions. [2018-10-12 20:50:26,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3380 [2018-10-12 20:50:26,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:26,418 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:50:26,418 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:26,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:26,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1908406782, now seen corresponding path program 53 times [2018-10-12 20:50:26,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:33,484 INFO L134 CoverageAnalysis]: Checked inductivity of 107475 backedges. 48099 proven. 1032 refuted. 0 times theorem prover too weak. 58344 trivial. 0 not checked. [2018-10-12 20:50:33,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:33,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-12 20:50:33,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-12 20:50:33,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-12 20:50:33,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1888, Unknown=0, NotChecked=0, Total=2162 [2018-10-12 20:50:33,486 INFO L87 Difference]: Start difference. First operand 3436 states and 3443 transitions. Second operand 47 states. [2018-10-12 20:50:39,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:39,489 INFO L93 Difference]: Finished difference Result 3554 states and 3559 transitions. [2018-10-12 20:50:39,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-12 20:50:39,490 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 3379 [2018-10-12 20:50:39,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:39,494 INFO L225 Difference]: With dead ends: 3554 [2018-10-12 20:50:39,494 INFO L226 Difference]: Without dead ends: 3554 [2018-10-12 20:50:39,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5573 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3712, Invalid=17168, Unknown=0, NotChecked=0, Total=20880 [2018-10-12 20:50:39,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3554 states. [2018-10-12 20:50:39,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3554 to 3436. [2018-10-12 20:50:39,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3436 states. [2018-10-12 20:50:39,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3436 states to 3436 states and 3441 transitions. [2018-10-12 20:50:39,516 INFO L78 Accepts]: Start accepts. Automaton has 3436 states and 3441 transitions. Word has length 3379 [2018-10-12 20:50:39,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:39,518 INFO L481 AbstractCegarLoop]: Abstraction has 3436 states and 3441 transitions. [2018-10-12 20:50:39,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-12 20:50:39,518 INFO L276 IsEmpty]: Start isEmpty. Operand 3436 states and 3441 transitions. [2018-10-12 20:50:39,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3394 [2018-10-12 20:50:39,574 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:39,574 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:50:39,574 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:39,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:39,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1044219250, now seen corresponding path program 54 times [2018-10-12 20:50:39,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:46,007 INFO L134 CoverageAnalysis]: Checked inductivity of 108555 backedges. 26807 proven. 1297 refuted. 0 times theorem prover too weak. 80451 trivial. 0 not checked. [2018-10-12 20:50:46,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:46,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-12 20:50:46,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-12 20:50:46,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-12 20:50:46,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=2228, Unknown=0, NotChecked=0, Total=2550 [2018-10-12 20:50:46,009 INFO L87 Difference]: Start difference. First operand 3436 states and 3441 transitions. Second operand 51 states. [2018-10-12 20:50:57,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:57,502 INFO L93 Difference]: Finished difference Result 4282 states and 4291 transitions. [2018-10-12 20:50:57,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 332 states. [2018-10-12 20:50:57,502 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 3393 [2018-10-12 20:50:57,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:57,506 INFO L225 Difference]: With dead ends: 4282 [2018-10-12 20:50:57,506 INFO L226 Difference]: Without dead ends: 4282 [2018-10-12 20:50:57,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 376 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61714 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=16364, Invalid=126142, Unknown=0, NotChecked=0, Total=142506 [2018-10-12 20:50:57,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4282 states. [2018-10-12 20:50:57,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4282 to 3457. [2018-10-12 20:50:57,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3457 states. [2018-10-12 20:50:57,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3457 states to 3457 states and 3463 transitions. [2018-10-12 20:50:57,532 INFO L78 Accepts]: Start accepts. Automaton has 3457 states and 3463 transitions. Word has length 3393 [2018-10-12 20:50:57,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:57,534 INFO L481 AbstractCegarLoop]: Abstraction has 3457 states and 3463 transitions. [2018-10-12 20:50:57,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-12 20:50:57,534 INFO L276 IsEmpty]: Start isEmpty. Operand 3457 states and 3463 transitions. [2018-10-12 20:50:57,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3415 [2018-10-12 20:50:57,595 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:57,596 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:50:57,596 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:57,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:57,596 INFO L82 PathProgramCache]: Analyzing trace with hash 760308953, now seen corresponding path program 55 times [2018-10-12 20:50:57,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:58,828 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-12 20:50:59,071 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-12 20:50:59,334 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-10-12 20:51:07,224 INFO L134 CoverageAnalysis]: Checked inductivity of 110185 backedges. 28593 proven. 1201 refuted. 0 times theorem prover too weak. 80391 trivial. 0 not checked. [2018-10-12 20:51:07,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:51:07,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-12 20:51:07,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-12 20:51:07,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-12 20:51:07,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=2960, Unknown=0, NotChecked=0, Total=3306 [2018-10-12 20:51:07,225 INFO L87 Difference]: Start difference. First operand 3457 states and 3463 transitions. Second operand 58 states. [2018-10-12 20:51:15,795 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2018-10-12 20:51:15,976 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2018-10-12 20:51:22,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:51:22,252 INFO L93 Difference]: Finished difference Result 3881 states and 3890 transitions. [2018-10-12 20:51:22,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-12 20:51:22,253 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 3414 [2018-10-12 20:51:22,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:51:22,258 INFO L225 Difference]: With dead ends: 3881 [2018-10-12 20:51:22,258 INFO L226 Difference]: Without dead ends: 3881 [2018-10-12 20:51:22,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5690 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=4508, Invalid=18142, Unknown=0, NotChecked=0, Total=22650 [2018-10-12 20:51:22,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3881 states. [2018-10-12 20:51:22,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3881 to 3471. [2018-10-12 20:51:22,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3471 states. [2018-10-12 20:51:22,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3471 states to 3471 states and 3478 transitions. [2018-10-12 20:51:22,275 INFO L78 Accepts]: Start accepts. Automaton has 3471 states and 3478 transitions. Word has length 3414 [2018-10-12 20:51:22,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:51:22,276 INFO L481 AbstractCegarLoop]: Abstraction has 3471 states and 3478 transitions. [2018-10-12 20:51:22,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-12 20:51:22,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3471 states and 3478 transitions. [2018-10-12 20:51:22,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3429 [2018-10-12 20:51:22,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:51:22,332 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:51:22,332 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:51:22,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:51:22,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1887632371, now seen corresponding path program 56 times [2018-10-12 20:51:22,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:51:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:51:28,388 INFO L134 CoverageAnalysis]: Checked inductivity of 111279 backedges. 29286 proven. 1542 refuted. 0 times theorem prover too weak. 80451 trivial. 0 not checked. [2018-10-12 20:51:28,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:51:28,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-12 20:51:28,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-12 20:51:28,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-12 20:51:28,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=2596, Unknown=0, NotChecked=0, Total=2970 [2018-10-12 20:51:28,390 INFO L87 Difference]: Start difference. First operand 3471 states and 3478 transitions. Second operand 55 states. [2018-10-12 20:51:42,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:51:42,504 INFO L93 Difference]: Finished difference Result 4568 states and 4582 transitions. [2018-10-12 20:51:42,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 380 states. [2018-10-12 20:51:42,504 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 3428 [2018-10-12 20:51:42,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:51:42,509 INFO L225 Difference]: With dead ends: 4568 [2018-10-12 20:51:42,509 INFO L226 Difference]: Without dead ends: 4568 [2018-10-12 20:51:42,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 428 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80961 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=20805, Invalid=163665, Unknown=0, NotChecked=0, Total=184470 [2018-10-12 20:51:42,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4568 states. [2018-10-12 20:51:42,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4568 to 3655. [2018-10-12 20:51:42,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3655 states. [2018-10-12 20:51:42,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3655 states to 3655 states and 3664 transitions. [2018-10-12 20:51:42,540 INFO L78 Accepts]: Start accepts. Automaton has 3655 states and 3664 transitions. Word has length 3428 [2018-10-12 20:51:42,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:51:42,542 INFO L481 AbstractCegarLoop]: Abstraction has 3655 states and 3664 transitions. [2018-10-12 20:51:42,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-12 20:51:42,542 INFO L276 IsEmpty]: Start isEmpty. Operand 3655 states and 3664 transitions. [2018-10-12 20:51:42,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3450 [2018-10-12 20:51:42,608 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:51:42,609 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:51:42,609 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:51:42,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:51:42,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1631280610, now seen corresponding path program 57 times [2018-10-12 20:51:42,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:51:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:51:52,539 INFO L134 CoverageAnalysis]: Checked inductivity of 112930 backedges. 14432 proven. 89694 refuted. 0 times theorem prover too weak. 8804 trivial. 0 not checked. [2018-10-12 20:51:52,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:51:52,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-12 20:51:52,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-12 20:51:52,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-12 20:51:52,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=2490, Unknown=0, NotChecked=0, Total=2862 [2018-10-12 20:51:52,541 INFO L87 Difference]: Start difference. First operand 3655 states and 3664 transitions. Second operand 54 states. [2018-10-12 20:52:04,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:52:04,657 INFO L93 Difference]: Finished difference Result 4529 states and 4540 transitions. [2018-10-12 20:52:04,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 327 states. [2018-10-12 20:52:04,658 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 3449 [2018-10-12 20:52:04,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:52:04,663 INFO L225 Difference]: With dead ends: 4529 [2018-10-12 20:52:04,663 INFO L226 Difference]: Without dead ends: 4529 [2018-10-12 20:52:04,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 375 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63520 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=20231, Invalid=121521, Unknown=0, NotChecked=0, Total=141752 [2018-10-12 20:52:04,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4529 states. [2018-10-12 20:52:04,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4529 to 4136. [2018-10-12 20:52:04,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4136 states. [2018-10-12 20:52:04,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4136 states to 4136 states and 4146 transitions. [2018-10-12 20:52:04,687 INFO L78 Accepts]: Start accepts. Automaton has 4136 states and 4146 transitions. Word has length 3449 [2018-10-12 20:52:04,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:52:04,689 INFO L481 AbstractCegarLoop]: Abstraction has 4136 states and 4146 transitions. [2018-10-12 20:52:04,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-12 20:52:04,689 INFO L276 IsEmpty]: Start isEmpty. Operand 4136 states and 4146 transitions. [2018-10-12 20:52:04,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3889 [2018-10-12 20:52:04,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:52:04,763 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 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, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:52:04,763 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:52:04,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:52:04,763 INFO L82 PathProgramCache]: Analyzing trace with hash -763622736, now seen corresponding path program 58 times [2018-10-12 20:52:04,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:52:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:52:17,005 INFO L134 CoverageAnalysis]: Checked inductivity of 146291 backedges. 115599 proven. 17543 refuted. 0 times theorem prover too weak. 13149 trivial. 0 not checked. [2018-10-12 20:52:17,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:52:17,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-12 20:52:17,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-12 20:52:17,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-12 20:52:17,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=2307, Unknown=0, NotChecked=0, Total=2652 [2018-10-12 20:52:17,007 INFO L87 Difference]: Start difference. First operand 4136 states and 4146 transitions. Second operand 52 states. [2018-10-12 20:52:21,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:52:21,687 INFO L93 Difference]: Finished difference Result 3987 states and 3995 transitions. [2018-10-12 20:52:21,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-12 20:52:21,687 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 3888 [2018-10-12 20:52:21,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:52:21,692 INFO L225 Difference]: With dead ends: 3987 [2018-10-12 20:52:21,692 INFO L226 Difference]: Without dead ends: 3987 [2018-10-12 20:52:21,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3568 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2923, Invalid=12577, Unknown=0, NotChecked=0, Total=15500 [2018-10-12 20:52:21,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3987 states. [2018-10-12 20:52:21,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3987 to 3987. [2018-10-12 20:52:21,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3987 states. [2018-10-12 20:52:21,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3987 states to 3987 states and 3995 transitions. [2018-10-12 20:52:21,713 INFO L78 Accepts]: Start accepts. Automaton has 3987 states and 3995 transitions. Word has length 3888 [2018-10-12 20:52:21,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:52:21,714 INFO L481 AbstractCegarLoop]: Abstraction has 3987 states and 3995 transitions. [2018-10-12 20:52:21,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-12 20:52:21,714 INFO L276 IsEmpty]: Start isEmpty. Operand 3987 states and 3995 transitions. [2018-10-12 20:52:21,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3910 [2018-10-12 20:52:21,786 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:52:21,787 INFO L375 BasicCegarLoop]: trace histogram [91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 90, 90, 90, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 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, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:52:21,787 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:52:21,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:52:21,788 INFO L82 PathProgramCache]: Analyzing trace with hash -464177915, now seen corresponding path program 59 times [2018-10-12 20:52:21,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:52:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:52:29,437 INFO L134 CoverageAnalysis]: Checked inductivity of 148195 backedges. 63907 proven. 1214 refuted. 0 times theorem prover too weak. 83074 trivial. 0 not checked. [2018-10-12 20:52:29,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:52:29,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-12 20:52:29,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-12 20:52:29,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-12 20:52:29,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=2228, Unknown=0, NotChecked=0, Total=2550 [2018-10-12 20:52:29,439 INFO L87 Difference]: Start difference. First operand 3987 states and 3995 transitions. Second operand 51 states. [2018-10-12 20:52:35,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:52:35,655 INFO L93 Difference]: Finished difference Result 4271 states and 4276 transitions. [2018-10-12 20:52:35,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-12 20:52:35,656 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 3909 [2018-10-12 20:52:35,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:52:35,661 INFO L225 Difference]: With dead ends: 4271 [2018-10-12 20:52:35,661 INFO L226 Difference]: Without dead ends: 4087 [2018-10-12 20:52:35,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6680 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4406, Invalid=20400, Unknown=0, NotChecked=0, Total=24806 [2018-10-12 20:52:35,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4087 states. [2018-10-12 20:52:35,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4087 to 3966. [2018-10-12 20:52:35,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3966 states. [2018-10-12 20:52:35,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3966 states to 3966 states and 3971 transitions. [2018-10-12 20:52:35,681 INFO L78 Accepts]: Start accepts. Automaton has 3966 states and 3971 transitions. Word has length 3909 [2018-10-12 20:52:35,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:52:35,683 INFO L481 AbstractCegarLoop]: Abstraction has 3966 states and 3971 transitions. [2018-10-12 20:52:35,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-12 20:52:35,683 INFO L276 IsEmpty]: Start isEmpty. Operand 3966 states and 3971 transitions. [2018-10-12 20:52:35,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3924 [2018-10-12 20:52:35,763 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:52:35,763 INFO L375 BasicCegarLoop]: trace histogram [91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 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, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:52:35,763 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:52:35,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:52:35,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1762527407, now seen corresponding path program 60 times [2018-10-12 20:52:35,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:52:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:52:47,117 INFO L134 CoverageAnalysis]: Checked inductivity of 149458 backedges. 36535 proven. 1396 refuted. 0 times theorem prover too weak. 111527 trivial. 0 not checked. [2018-10-12 20:52:47,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:52:47,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-12 20:52:47,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-12 20:52:47,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-12 20:52:47,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=3441, Unknown=0, NotChecked=0, Total=3782 [2018-10-12 20:52:47,119 INFO L87 Difference]: Start difference. First operand 3966 states and 3971 transitions. Second operand 62 states. [2018-10-12 20:52:58,256 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 50 [2018-10-12 20:52:58,451 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 50