java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength_true-valid-memsafety.c_13.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 15:18:52,758 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 15:18:52,761 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 15:18:52,774 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 15:18:52,774 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 15:18:52,775 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 15:18:52,777 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 15:18:52,779 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 15:18:52,780 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 15:18:52,781 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 15:18:52,782 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 15:18:52,782 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 15:18:52,783 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 15:18:52,784 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 15:18:52,786 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 15:18:52,786 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 15:18:52,787 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 15:18:52,790 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 15:18:52,793 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 15:18:52,794 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 15:18:52,796 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 15:18:52,797 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 15:18:52,799 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 15:18:52,799 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 15:18:52,800 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 15:18:52,801 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 15:18:52,802 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 15:18:52,803 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 15:18:52,803 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 15:18:52,804 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 15:18:52,805 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 15:18:52,805 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 15:18:52,806 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 15:18:52,806 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 15:18:52,807 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 15:18:52,808 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 15:18:52,808 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-10 15:18:52,818 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 15:18:52,818 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 15:18:52,819 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 15:18:52,819 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 15:18:52,819 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 15:18:52,819 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 15:18:52,820 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 15:18:52,820 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 15:18:52,821 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 15:18:52,821 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 15:18:52,821 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 15:18:52,821 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 15:18:52,821 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 15:18:52,822 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 15:18:52,823 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 15:18:52,870 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 15:18:52,889 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 15:18:52,896 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 15:18:52,898 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 15:18:52,898 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 15:18:52,899 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength_true-valid-memsafety.c_13.bpl [2018-10-10 15:18:52,899 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength_true-valid-memsafety.c_13.bpl' [2018-10-10 15:18:52,966 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 15:18:52,968 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-10 15:18:52,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 15:18:52,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 15:18:52,969 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 15:18:52,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:18:52" (1/1) ... [2018-10-10 15:18:52,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:18:52" (1/1) ... [2018-10-10 15:18:53,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:18:52" (1/1) ... [2018-10-10 15:18:53,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:18:52" (1/1) ... [2018-10-10 15:18:53,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:18:52" (1/1) ... [2018-10-10 15:18:53,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:18:52" (1/1) ... [2018-10-10 15:18:53,031 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:18:52" (1/1) ... [2018-10-10 15:18:53,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 15:18:53,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 15:18:53,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 15:18:53,042 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 15:18:53,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:18:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-10 15:18:53,110 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 15:18:53,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 15:18:53,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 15:18:53,822 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 15:18:53,823 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:18:53 BoogieIcfgContainer [2018-10-10 15:18:53,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 15:18:53,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 15:18:53,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 15:18:53,828 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 15:18:53,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:18:52" (1/2) ... [2018-10-10 15:18:53,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29607a61 and model type ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 03:18:53, skipping insertion in model container [2018-10-10 15:18:53,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:18:53" (2/2) ... [2018-10-10 15:18:53,832 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_true-valid-memsafety.c_13.bpl [2018-10-10 15:18:53,842 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 15:18:53,852 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 15:18:53,869 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 15:18:53,898 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 15:18:53,899 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 15:18:53,899 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 15:18:53,899 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 15:18:53,899 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 15:18:53,900 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 15:18:53,900 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 15:18:53,900 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 15:18:53,900 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 15:18:53,920 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-10-10 15:18:53,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-10 15:18:53,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:53,930 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:53,932 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:53,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:53,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1339383475, now seen corresponding path program 1 times [2018-10-10 15:18:53,989 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:54,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:54,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:18:54,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 15:18:54,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 15:18:54,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 15:18:54,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 15:18:54,130 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2018-10-10 15:18:54,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:54,288 INFO L93 Difference]: Finished difference Result 128 states and 131 transitions. [2018-10-10 15:18:54,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 15:18:54,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-10 15:18:54,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:54,304 INFO L225 Difference]: With dead ends: 128 [2018-10-10 15:18:54,305 INFO L226 Difference]: Without dead ends: 128 [2018-10-10 15:18:54,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 15:18:54,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-10 15:18:54,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 75. [2018-10-10 15:18:54,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-10 15:18:54,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-10-10 15:18:54,354 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 24 [2018-10-10 15:18:54,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:54,354 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-10-10 15:18:54,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 15:18:54,355 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-10-10 15:18:54,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-10 15:18:54,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:54,357 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:54,357 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:54,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:54,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1869929568, now seen corresponding path program 1 times [2018-10-10 15:18:54,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:54,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:54,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:54,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-10 15:18:54,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 15:18:54,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 15:18:54,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-10 15:18:54,543 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 5 states. [2018-10-10 15:18:54,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:54,862 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2018-10-10 15:18:54,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 15:18:54,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-10-10 15:18:54,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:54,870 INFO L225 Difference]: With dead ends: 168 [2018-10-10 15:18:54,872 INFO L226 Difference]: Without dead ends: 168 [2018-10-10 15:18:54,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-10 15:18:54,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-10-10 15:18:54,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 115. [2018-10-10 15:18:54,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-10 15:18:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 118 transitions. [2018-10-10 15:18:54,886 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 118 transitions. Word has length 50 [2018-10-10 15:18:54,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:54,887 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 118 transitions. [2018-10-10 15:18:54,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 15:18:54,887 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 118 transitions. [2018-10-10 15:18:54,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-10 15:18:54,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:54,890 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:54,891 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:54,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:54,891 INFO L82 PathProgramCache]: Analyzing trace with hash 908039603, now seen corresponding path program 2 times [2018-10-10 15:18:54,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:55,114 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:55,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:55,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-10 15:18:55,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 15:18:55,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 15:18:55,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-10 15:18:55,116 INFO L87 Difference]: Start difference. First operand 115 states and 118 transitions. Second operand 7 states. [2018-10-10 15:18:55,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:55,515 INFO L93 Difference]: Finished difference Result 208 states and 213 transitions. [2018-10-10 15:18:55,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 15:18:55,516 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-10-10 15:18:55,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:55,520 INFO L225 Difference]: With dead ends: 208 [2018-10-10 15:18:55,521 INFO L226 Difference]: Without dead ends: 208 [2018-10-10 15:18:55,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-10-10 15:18:55,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-10-10 15:18:55,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 155. [2018-10-10 15:18:55,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-10 15:18:55,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 159 transitions. [2018-10-10 15:18:55,552 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 159 transitions. Word has length 76 [2018-10-10 15:18:55,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:55,552 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 159 transitions. [2018-10-10 15:18:55,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 15:18:55,555 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 159 transitions. [2018-10-10 15:18:55,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-10 15:18:55,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:55,557 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:55,559 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:55,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:55,560 INFO L82 PathProgramCache]: Analyzing trace with hash -961708730, now seen corresponding path program 3 times [2018-10-10 15:18:55,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:56,153 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:56,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:56,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-10 15:18:56,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 15:18:56,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 15:18:56,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-10 15:18:56,155 INFO L87 Difference]: Start difference. First operand 155 states and 159 transitions. Second operand 9 states. [2018-10-10 15:18:56,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:56,534 INFO L93 Difference]: Finished difference Result 248 states and 254 transitions. [2018-10-10 15:18:56,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 15:18:56,535 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2018-10-10 15:18:56,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:56,538 INFO L225 Difference]: With dead ends: 248 [2018-10-10 15:18:56,538 INFO L226 Difference]: Without dead ends: 248 [2018-10-10 15:18:56,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:18:56,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-10 15:18:56,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 195. [2018-10-10 15:18:56,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-10 15:18:56,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 200 transitions. [2018-10-10 15:18:56,552 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 200 transitions. Word has length 102 [2018-10-10 15:18:56,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:56,553 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 200 transitions. [2018-10-10 15:18:56,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 15:18:56,554 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 200 transitions. [2018-10-10 15:18:56,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-10 15:18:56,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:56,557 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-10-10 15:18:56,557 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:56,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:56,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1599782119, now seen corresponding path program 4 times [2018-10-10 15:18:56,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:56,834 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:56,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:56,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-10 15:18:56,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 15:18:56,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 15:18:56,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-10 15:18:56,836 INFO L87 Difference]: Start difference. First operand 195 states and 200 transitions. Second operand 11 states. [2018-10-10 15:18:57,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:57,287 INFO L93 Difference]: Finished difference Result 288 states and 295 transitions. [2018-10-10 15:18:57,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 15:18:57,288 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 128 [2018-10-10 15:18:57,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:57,290 INFO L225 Difference]: With dead ends: 288 [2018-10-10 15:18:57,290 INFO L226 Difference]: Without dead ends: 288 [2018-10-10 15:18:57,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-10 15:18:57,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-10-10 15:18:57,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 235. [2018-10-10 15:18:57,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-10 15:18:57,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 241 transitions. [2018-10-10 15:18:57,304 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 241 transitions. Word has length 128 [2018-10-10 15:18:57,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:57,305 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 241 transitions. [2018-10-10 15:18:57,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 15:18:57,305 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 241 transitions. [2018-10-10 15:18:57,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-10 15:18:57,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:57,309 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, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:57,309 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:57,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:57,309 INFO L82 PathProgramCache]: Analyzing trace with hash 59873068, now seen corresponding path program 5 times [2018-10-10 15:18:57,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:57,718 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:57,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:57,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-10 15:18:57,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 15:18:57,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 15:18:57,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-10 15:18:57,721 INFO L87 Difference]: Start difference. First operand 235 states and 241 transitions. Second operand 13 states. [2018-10-10 15:18:58,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:58,040 INFO L93 Difference]: Finished difference Result 328 states and 336 transitions. [2018-10-10 15:18:58,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 15:18:58,042 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 154 [2018-10-10 15:18:58,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:58,045 INFO L225 Difference]: With dead ends: 328 [2018-10-10 15:18:58,045 INFO L226 Difference]: Without dead ends: 328 [2018-10-10 15:18:58,046 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-10-10 15:18:58,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-10 15:18:58,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 275. [2018-10-10 15:18:58,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-10 15:18:58,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 282 transitions. [2018-10-10 15:18:58,059 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 282 transitions. Word has length 154 [2018-10-10 15:18:58,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:58,060 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 282 transitions. [2018-10-10 15:18:58,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 15:18:58,060 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 282 transitions. [2018-10-10 15:18:58,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-10 15:18:58,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:58,064 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, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:58,065 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:58,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:58,065 INFO L82 PathProgramCache]: Analyzing trace with hash 838936959, now seen corresponding path program 6 times [2018-10-10 15:18:58,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:58,509 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:58,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:58,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 15:18:58,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 15:18:58,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 15:18:58,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:18:58,511 INFO L87 Difference]: Start difference. First operand 275 states and 282 transitions. Second operand 15 states. [2018-10-10 15:18:58,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:58,969 INFO L93 Difference]: Finished difference Result 368 states and 377 transitions. [2018-10-10 15:18:58,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 15:18:58,970 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 180 [2018-10-10 15:18:58,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:58,973 INFO L225 Difference]: With dead ends: 368 [2018-10-10 15:18:58,973 INFO L226 Difference]: Without dead ends: 368 [2018-10-10 15:18:58,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-10-10 15:18:58,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-10-10 15:18:58,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 315. [2018-10-10 15:18:58,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-10 15:18:58,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 323 transitions. [2018-10-10 15:18:58,983 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 323 transitions. Word has length 180 [2018-10-10 15:18:58,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:58,984 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 323 transitions. [2018-10-10 15:18:58,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 15:18:58,984 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 323 transitions. [2018-10-10 15:18:58,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-10 15:18:58,988 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:58,988 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-10-10 15:18:58,989 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:58,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:58,989 INFO L82 PathProgramCache]: Analyzing trace with hash -192501230, now seen corresponding path program 7 times [2018-10-10 15:18:58,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:00,188 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 0 proven. 553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:00,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:00,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-10 15:19:00,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 15:19:00,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 15:19:00,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-10 15:19:00,192 INFO L87 Difference]: Start difference. First operand 315 states and 323 transitions. Second operand 17 states. [2018-10-10 15:19:00,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:00,874 INFO L93 Difference]: Finished difference Result 408 states and 418 transitions. [2018-10-10 15:19:00,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 15:19:00,875 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 206 [2018-10-10 15:19:00,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:00,878 INFO L225 Difference]: With dead ends: 408 [2018-10-10 15:19:00,878 INFO L226 Difference]: Without dead ends: 408 [2018-10-10 15:19:00,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-10-10 15:19:00,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-10-10 15:19:00,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 355. [2018-10-10 15:19:00,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-10-10 15:19:00,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 364 transitions. [2018-10-10 15:19:00,886 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 364 transitions. Word has length 206 [2018-10-10 15:19:00,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:00,887 INFO L481 AbstractCegarLoop]: Abstraction has 355 states and 364 transitions. [2018-10-10 15:19:00,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 15:19:00,887 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 364 transitions. [2018-10-10 15:19:00,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-10 15:19:00,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:00,891 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-10-10 15:19:00,891 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:00,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:00,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1555613925, now seen corresponding path program 8 times [2018-10-10 15:19:00,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:01,959 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:01,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:01,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 15:19:01,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 15:19:01,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 15:19:01,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-10 15:19:01,961 INFO L87 Difference]: Start difference. First operand 355 states and 364 transitions. Second operand 19 states. [2018-10-10 15:19:02,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:02,419 INFO L93 Difference]: Finished difference Result 448 states and 459 transitions. [2018-10-10 15:19:02,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 15:19:02,420 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 232 [2018-10-10 15:19:02,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:02,423 INFO L225 Difference]: With dead ends: 448 [2018-10-10 15:19:02,423 INFO L226 Difference]: Without dead ends: 448 [2018-10-10 15:19:02,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 15:19:02,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-10-10 15:19:02,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 395. [2018-10-10 15:19:02,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-10 15:19:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 405 transitions. [2018-10-10 15:19:02,431 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 405 transitions. Word has length 232 [2018-10-10 15:19:02,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:02,432 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 405 transitions. [2018-10-10 15:19:02,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 15:19:02,432 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 405 transitions. [2018-10-10 15:19:02,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-10 15:19:02,434 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:02,434 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, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:02,435 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:02,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:02,435 INFO L82 PathProgramCache]: Analyzing trace with hash -936233480, now seen corresponding path program 9 times [2018-10-10 15:19:02,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:02,773 INFO L134 CoverageAnalysis]: Checked inductivity of 945 backedges. 0 proven. 945 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:02,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:02,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 15:19:02,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 15:19:02,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 15:19:02,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-10-10 15:19:02,775 INFO L87 Difference]: Start difference. First operand 395 states and 405 transitions. Second operand 21 states. [2018-10-10 15:19:03,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:03,384 INFO L93 Difference]: Finished difference Result 488 states and 500 transitions. [2018-10-10 15:19:03,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 15:19:03,385 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 258 [2018-10-10 15:19:03,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:03,389 INFO L225 Difference]: With dead ends: 488 [2018-10-10 15:19:03,389 INFO L226 Difference]: Without dead ends: 488 [2018-10-10 15:19:03,390 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=498, Invalid=984, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 15:19:03,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-10-10 15:19:03,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 435. [2018-10-10 15:19:03,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-10-10 15:19:03,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 446 transitions. [2018-10-10 15:19:03,398 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 446 transitions. Word has length 258 [2018-10-10 15:19:03,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:03,398 INFO L481 AbstractCegarLoop]: Abstraction has 435 states and 446 transitions. [2018-10-10 15:19:03,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 15:19:03,399 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 446 transitions. [2018-10-10 15:19:03,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-10 15:19:03,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:03,401 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, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:03,401 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:03,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:03,401 INFO L82 PathProgramCache]: Analyzing trace with hash 596746571, now seen corresponding path program 10 times [2018-10-10 15:19:03,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:04,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1180 backedges. 0 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:04,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:04,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 15:19:04,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 15:19:04,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 15:19:04,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-10-10 15:19:04,476 INFO L87 Difference]: Start difference. First operand 435 states and 446 transitions. Second operand 23 states. [2018-10-10 15:19:05,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:05,744 INFO L93 Difference]: Finished difference Result 528 states and 541 transitions. [2018-10-10 15:19:05,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-10 15:19:05,744 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 284 [2018-10-10 15:19:05,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:05,749 INFO L225 Difference]: With dead ends: 528 [2018-10-10 15:19:05,749 INFO L226 Difference]: Without dead ends: 528 [2018-10-10 15:19:05,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=603, Invalid=1203, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 15:19:05,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-10-10 15:19:05,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 475. [2018-10-10 15:19:05,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2018-10-10 15:19:05,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 487 transitions. [2018-10-10 15:19:05,758 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 487 transitions. Word has length 284 [2018-10-10 15:19:05,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:05,759 INFO L481 AbstractCegarLoop]: Abstraction has 475 states and 487 transitions. [2018-10-10 15:19:05,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 15:19:05,759 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 487 transitions. [2018-10-10 15:19:05,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-10-10 15:19:05,761 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:05,761 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, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:05,762 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:05,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:05,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1836694238, now seen corresponding path program 11 times [2018-10-10 15:19:05,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:06,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1441 backedges. 0 proven. 1441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:06,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:06,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 15:19:06,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 15:19:06,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 15:19:06,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-10 15:19:06,253 INFO L87 Difference]: Start difference. First operand 475 states and 487 transitions. Second operand 25 states. [2018-10-10 15:19:06,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:06,912 INFO L93 Difference]: Finished difference Result 568 states and 582 transitions. [2018-10-10 15:19:06,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-10 15:19:06,913 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 310 [2018-10-10 15:19:06,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:06,917 INFO L225 Difference]: With dead ends: 568 [2018-10-10 15:19:06,917 INFO L226 Difference]: Without dead ends: 568 [2018-10-10 15:19:06,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 15:19:06,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-10-10 15:19:06,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 515. [2018-10-10 15:19:06,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-10 15:19:06,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 528 transitions. [2018-10-10 15:19:06,928 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 528 transitions. Word has length 310 [2018-10-10 15:19:06,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:06,928 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 528 transitions. [2018-10-10 15:19:06,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 15:19:06,929 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 528 transitions. [2018-10-10 15:19:06,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-10-10 15:19:06,931 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:06,931 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-10-10 15:19:06,931 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:06,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:06,932 INFO L82 PathProgramCache]: Analyzing trace with hash 2039558833, now seen corresponding path program 12 times [2018-10-10 15:19:06,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:07,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1728 backedges. 0 proven. 1728 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:07,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:07,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 15:19:07,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 15:19:07,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 15:19:07,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-10-10 15:19:07,882 INFO L87 Difference]: Start difference. First operand 515 states and 528 transitions. Second operand 27 states. [2018-10-10 15:19:08,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:08,720 INFO L93 Difference]: Finished difference Result 608 states and 623 transitions. [2018-10-10 15:19:08,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 15:19:08,721 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 336 [2018-10-10 15:19:08,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:08,725 INFO L225 Difference]: With dead ends: 608 [2018-10-10 15:19:08,725 INFO L226 Difference]: Without dead ends: 608 [2018-10-10 15:19:08,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 15:19:08,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-10-10 15:19:08,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 555. [2018-10-10 15:19:08,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-10-10 15:19:08,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 569 transitions. [2018-10-10 15:19:08,737 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 569 transitions. Word has length 336 [2018-10-10 15:19:08,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:08,738 INFO L481 AbstractCegarLoop]: Abstraction has 555 states and 569 transitions. [2018-10-10 15:19:08,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 15:19:08,738 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 569 transitions. [2018-10-10 15:19:08,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-10-10 15:19:08,740 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:08,741 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-10-10 15:19:08,741 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:08,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:08,742 INFO L82 PathProgramCache]: Analyzing trace with hash -209536828, now seen corresponding path program 13 times [2018-10-10 15:19:08,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:09,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2041 backedges. 0 proven. 2041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:09,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:09,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-10 15:19:09,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-10 15:19:09,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-10 15:19:09,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-10-10 15:19:09,568 INFO L87 Difference]: Start difference. First operand 555 states and 569 transitions. Second operand 29 states. [2018-10-10 15:19:10,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:10,663 INFO L93 Difference]: Finished difference Result 648 states and 664 transitions. [2018-10-10 15:19:10,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-10 15:19:10,663 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 362 [2018-10-10 15:19:10,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:10,667 INFO L225 Difference]: With dead ends: 648 [2018-10-10 15:19:10,667 INFO L226 Difference]: Without dead ends: 648 [2018-10-10 15:19:10,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 15:19:10,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2018-10-10 15:19:10,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 595. [2018-10-10 15:19:10,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2018-10-10 15:19:10,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 610 transitions. [2018-10-10 15:19:10,678 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 610 transitions. Word has length 362 [2018-10-10 15:19:10,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:10,679 INFO L481 AbstractCegarLoop]: Abstraction has 595 states and 610 transitions. [2018-10-10 15:19:10,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-10 15:19:10,679 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 610 transitions. [2018-10-10 15:19:10,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-10-10 15:19:10,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:10,682 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, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:10,682 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:10,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:10,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1577255657, now seen corresponding path program 14 times [2018-10-10 15:19:10,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:11,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:11,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:11,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 15:19:11,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 15:19:11,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 15:19:11,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-10-10 15:19:11,876 INFO L87 Difference]: Start difference. First operand 595 states and 610 transitions. Second operand 31 states. [2018-10-10 15:19:12,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:12,732 INFO L93 Difference]: Finished difference Result 688 states and 705 transitions. [2018-10-10 15:19:12,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 15:19:12,732 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 388 [2018-10-10 15:19:12,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:12,737 INFO L225 Difference]: With dead ends: 688 [2018-10-10 15:19:12,738 INFO L226 Difference]: Without dead ends: 688 [2018-10-10 15:19:12,739 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 15:19:12,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2018-10-10 15:19:12,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 635. [2018-10-10 15:19:12,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2018-10-10 15:19:12,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 651 transitions. [2018-10-10 15:19:12,751 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 651 transitions. Word has length 388 [2018-10-10 15:19:12,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:12,752 INFO L481 AbstractCegarLoop]: Abstraction has 635 states and 651 transitions. [2018-10-10 15:19:12,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 15:19:12,753 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 651 transitions. [2018-10-10 15:19:12,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-10-10 15:19:12,755 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:12,756 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, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:12,756 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:12,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:12,757 INFO L82 PathProgramCache]: Analyzing trace with hash -374165590, now seen corresponding path program 15 times [2018-10-10 15:19:12,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:14,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2745 backedges. 0 proven. 2745 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:14,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:14,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-10 15:19:14,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-10 15:19:14,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-10 15:19:14,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 15:19:14,022 INFO L87 Difference]: Start difference. First operand 635 states and 651 transitions. Second operand 33 states. [2018-10-10 15:19:14,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:14,768 INFO L93 Difference]: Finished difference Result 728 states and 746 transitions. [2018-10-10 15:19:14,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-10 15:19:14,769 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 414 [2018-10-10 15:19:14,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:14,774 INFO L225 Difference]: With dead ends: 728 [2018-10-10 15:19:14,774 INFO L226 Difference]: Without dead ends: 728 [2018-10-10 15:19:14,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 15:19:14,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-10-10 15:19:14,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 675. [2018-10-10 15:19:14,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2018-10-10 15:19:14,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 692 transitions. [2018-10-10 15:19:14,785 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 692 transitions. Word has length 414 [2018-10-10 15:19:14,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:14,786 INFO L481 AbstractCegarLoop]: Abstraction has 675 states and 692 transitions. [2018-10-10 15:19:14,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-10 15:19:14,786 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 692 transitions. [2018-10-10 15:19:14,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-10-10 15:19:14,789 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:14,790 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:14,790 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:14,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:14,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1873117059, now seen corresponding path program 16 times [2018-10-10 15:19:14,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:15,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:15,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:15,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-10 15:19:15,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 15:19:15,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 15:19:15,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 15:19:15,973 INFO L87 Difference]: Start difference. First operand 675 states and 692 transitions. Second operand 35 states. [2018-10-10 15:19:16,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:16,945 INFO L93 Difference]: Finished difference Result 768 states and 787 transitions. [2018-10-10 15:19:16,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-10 15:19:16,945 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 440 [2018-10-10 15:19:16,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:16,950 INFO L225 Difference]: With dead ends: 768 [2018-10-10 15:19:16,950 INFO L226 Difference]: Without dead ends: 768 [2018-10-10 15:19:16,952 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 15:19:16,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2018-10-10 15:19:16,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 715. [2018-10-10 15:19:16,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-10-10 15:19:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 733 transitions. [2018-10-10 15:19:16,961 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 733 transitions. Word has length 440 [2018-10-10 15:19:16,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:16,962 INFO L481 AbstractCegarLoop]: Abstraction has 715 states and 733 transitions. [2018-10-10 15:19:16,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 15:19:16,962 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 733 transitions. [2018-10-10 15:19:16,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-10-10 15:19:16,966 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:16,966 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:16,966 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:16,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:16,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1079042160, now seen corresponding path program 17 times [2018-10-10 15:19:16,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:17,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3553 backedges. 0 proven. 3553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:17,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:17,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-10 15:19:17,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 15:19:17,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 15:19:17,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 15:19:17,818 INFO L87 Difference]: Start difference. First operand 715 states and 733 transitions. Second operand 37 states. [2018-10-10 15:19:18,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:18,865 INFO L93 Difference]: Finished difference Result 808 states and 828 transitions. [2018-10-10 15:19:18,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-10 15:19:18,866 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 466 [2018-10-10 15:19:18,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:18,870 INFO L225 Difference]: With dead ends: 808 [2018-10-10 15:19:18,870 INFO L226 Difference]: Without dead ends: 808 [2018-10-10 15:19:18,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2018-10-10 15:19:18,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2018-10-10 15:19:18,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 755. [2018-10-10 15:19:18,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2018-10-10 15:19:18,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 774 transitions. [2018-10-10 15:19:18,882 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 774 transitions. Word has length 466 [2018-10-10 15:19:18,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:18,882 INFO L481 AbstractCegarLoop]: Abstraction has 755 states and 774 transitions. [2018-10-10 15:19:18,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 15:19:18,883 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 774 transitions. [2018-10-10 15:19:18,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2018-10-10 15:19:18,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:18,886 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:18,887 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:18,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:18,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1215249635, now seen corresponding path program 18 times [2018-10-10 15:19:18,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:19,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3996 backedges. 0 proven. 3996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:19,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:19,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-10 15:19:19,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 15:19:19,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 15:19:19,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 15:19:19,779 INFO L87 Difference]: Start difference. First operand 755 states and 774 transitions. Second operand 39 states. [2018-10-10 15:19:21,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:21,036 INFO L93 Difference]: Finished difference Result 848 states and 869 transitions. [2018-10-10 15:19:21,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-10 15:19:21,037 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 492 [2018-10-10 15:19:21,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:21,041 INFO L225 Difference]: With dead ends: 848 [2018-10-10 15:19:21,041 INFO L226 Difference]: Without dead ends: 848 [2018-10-10 15:19:21,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-10-10 15:19:21,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2018-10-10 15:19:21,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 795. [2018-10-10 15:19:21,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2018-10-10 15:19:21,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 815 transitions. [2018-10-10 15:19:21,053 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 815 transitions. Word has length 492 [2018-10-10 15:19:21,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:21,053 INFO L481 AbstractCegarLoop]: Abstraction has 795 states and 815 transitions. [2018-10-10 15:19:21,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 15:19:21,054 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 815 transitions. [2018-10-10 15:19:21,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2018-10-10 15:19:21,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:21,058 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:21,058 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:21,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:21,059 INFO L82 PathProgramCache]: Analyzing trace with hash 626886774, now seen corresponding path program 19 times [2018-10-10 15:19:21,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:22,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:22,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:22,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-10 15:19:22,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-10 15:19:22,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-10 15:19:22,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 15:19:22,085 INFO L87 Difference]: Start difference. First operand 795 states and 815 transitions. Second operand 41 states. [2018-10-10 15:19:23,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:23,316 INFO L93 Difference]: Finished difference Result 888 states and 910 transitions. [2018-10-10 15:19:23,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-10 15:19:23,317 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 518 [2018-10-10 15:19:23,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:23,320 INFO L225 Difference]: With dead ends: 888 [2018-10-10 15:19:23,320 INFO L226 Difference]: Without dead ends: 888 [2018-10-10 15:19:23,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2018-10-10 15:19:23,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2018-10-10 15:19:23,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 835. [2018-10-10 15:19:23,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2018-10-10 15:19:23,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 856 transitions. [2018-10-10 15:19:23,332 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 856 transitions. Word has length 518 [2018-10-10 15:19:23,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:23,332 INFO L481 AbstractCegarLoop]: Abstraction has 835 states and 856 transitions. [2018-10-10 15:19:23,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-10 15:19:23,333 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 856 transitions. [2018-10-10 15:19:23,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2018-10-10 15:19:23,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:23,337 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, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:23,337 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:23,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:23,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1044427337, now seen corresponding path program 20 times [2018-10-10 15:19:23,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:24,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4960 backedges. 0 proven. 4960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:24,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:24,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-10 15:19:24,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 15:19:24,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 15:19:24,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 15:19:24,602 INFO L87 Difference]: Start difference. First operand 835 states and 856 transitions. Second operand 43 states. [2018-10-10 15:19:26,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:26,233 INFO L93 Difference]: Finished difference Result 928 states and 951 transitions. [2018-10-10 15:19:26,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-10 15:19:26,233 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 544 [2018-10-10 15:19:26,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:26,239 INFO L225 Difference]: With dead ends: 928 [2018-10-10 15:19:26,239 INFO L226 Difference]: Without dead ends: 928 [2018-10-10 15:19:26,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2018-10-10 15:19:26,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2018-10-10 15:19:26,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 875. [2018-10-10 15:19:26,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2018-10-10 15:19:26,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 897 transitions. [2018-10-10 15:19:26,251 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 897 transitions. Word has length 544 [2018-10-10 15:19:26,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:26,251 INFO L481 AbstractCegarLoop]: Abstraction has 875 states and 897 transitions. [2018-10-10 15:19:26,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 15:19:26,252 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 897 transitions. [2018-10-10 15:19:26,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2018-10-10 15:19:26,256 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:26,256 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, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:26,257 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:26,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:26,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1793288796, now seen corresponding path program 21 times [2018-10-10 15:19:26,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:27,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5481 backedges. 0 proven. 5481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:27,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:27,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-10 15:19:27,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-10 15:19:27,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-10 15:19:27,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 15:19:27,475 INFO L87 Difference]: Start difference. First operand 875 states and 897 transitions. Second operand 45 states. [2018-10-10 15:19:29,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:29,392 INFO L93 Difference]: Finished difference Result 968 states and 992 transitions. [2018-10-10 15:19:29,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-10 15:19:29,400 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 570 [2018-10-10 15:19:29,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:29,404 INFO L225 Difference]: With dead ends: 968 [2018-10-10 15:19:29,404 INFO L226 Difference]: Without dead ends: 968 [2018-10-10 15:19:29,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2018-10-10 15:19:29,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2018-10-10 15:19:29,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 915. [2018-10-10 15:19:29,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2018-10-10 15:19:29,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 938 transitions. [2018-10-10 15:19:29,416 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 938 transitions. Word has length 570 [2018-10-10 15:19:29,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:29,416 INFO L481 AbstractCegarLoop]: Abstraction has 915 states and 938 transitions. [2018-10-10 15:19:29,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-10 15:19:29,416 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 938 transitions. [2018-10-10 15:19:29,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2018-10-10 15:19:29,421 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:29,421 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, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:29,421 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:29,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:29,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1240178513, now seen corresponding path program 22 times [2018-10-10 15:19:29,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:31,715 INFO L134 CoverageAnalysis]: Checked inductivity of 6028 backedges. 0 proven. 6028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:31,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:31,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-10 15:19:31,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-10 15:19:31,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-10 15:19:31,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 15:19:31,716 INFO L87 Difference]: Start difference. First operand 915 states and 938 transitions. Second operand 47 states. [2018-10-10 15:19:33,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:33,107 INFO L93 Difference]: Finished difference Result 1008 states and 1033 transitions. [2018-10-10 15:19:33,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-10 15:19:33,107 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 596 [2018-10-10 15:19:33,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:33,112 INFO L225 Difference]: With dead ends: 1008 [2018-10-10 15:19:33,112 INFO L226 Difference]: Without dead ends: 1008 [2018-10-10 15:19:33,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2643, Invalid=5547, Unknown=0, NotChecked=0, Total=8190 [2018-10-10 15:19:33,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2018-10-10 15:19:33,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 955. [2018-10-10 15:19:33,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2018-10-10 15:19:33,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 979 transitions. [2018-10-10 15:19:33,123 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 979 transitions. Word has length 596 [2018-10-10 15:19:33,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:33,123 INFO L481 AbstractCegarLoop]: Abstraction has 955 states and 979 transitions. [2018-10-10 15:19:33,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-10 15:19:33,124 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 979 transitions. [2018-10-10 15:19:33,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2018-10-10 15:19:33,128 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:33,128 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:33,129 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:33,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:33,129 INFO L82 PathProgramCache]: Analyzing trace with hash -525974206, now seen corresponding path program 23 times [2018-10-10 15:19:33,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:34,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6601 backedges. 0 proven. 6601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:34,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:34,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-10 15:19:34,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-10 15:19:34,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-10 15:19:34,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 15:19:34,665 INFO L87 Difference]: Start difference. First operand 955 states and 979 transitions. Second operand 49 states. [2018-10-10 15:19:36,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:36,635 INFO L93 Difference]: Finished difference Result 1048 states and 1074 transitions. [2018-10-10 15:19:36,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-10 15:19:36,636 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 622 [2018-10-10 15:19:36,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:36,641 INFO L225 Difference]: With dead ends: 1048 [2018-10-10 15:19:36,641 INFO L226 Difference]: Without dead ends: 1048 [2018-10-10 15:19:36,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2018-10-10 15:19:36,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2018-10-10 15:19:36,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 995. [2018-10-10 15:19:36,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2018-10-10 15:19:36,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1020 transitions. [2018-10-10 15:19:36,652 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1020 transitions. Word has length 622 [2018-10-10 15:19:36,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:36,653 INFO L481 AbstractCegarLoop]: Abstraction has 995 states and 1020 transitions. [2018-10-10 15:19:36,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-10 15:19:36,653 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1020 transitions. [2018-10-10 15:19:36,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2018-10-10 15:19:36,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:36,658 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:36,659 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:36,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:36,659 INFO L82 PathProgramCache]: Analyzing trace with hash 611305493, now seen corresponding path program 24 times [2018-10-10 15:19:36,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:38,080 INFO L134 CoverageAnalysis]: Checked inductivity of 7200 backedges. 0 proven. 7200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:38,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:38,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-10 15:19:38,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-10 15:19:38,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-10 15:19:38,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 15:19:38,083 INFO L87 Difference]: Start difference. First operand 995 states and 1020 transitions. Second operand 51 states. [2018-10-10 15:19:39,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:39,613 INFO L93 Difference]: Finished difference Result 1088 states and 1115 transitions. [2018-10-10 15:19:39,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-10 15:19:39,613 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 648 [2018-10-10 15:19:39,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:39,618 INFO L225 Difference]: With dead ends: 1088 [2018-10-10 15:19:39,618 INFO L226 Difference]: Without dead ends: 1088 [2018-10-10 15:19:39,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3123, Invalid=6579, Unknown=0, NotChecked=0, Total=9702 [2018-10-10 15:19:39,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2018-10-10 15:19:39,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1035. [2018-10-10 15:19:39,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2018-10-10 15:19:39,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1061 transitions. [2018-10-10 15:19:39,631 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1061 transitions. Word has length 648 [2018-10-10 15:19:39,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:39,632 INFO L481 AbstractCegarLoop]: Abstraction has 1035 states and 1061 transitions. [2018-10-10 15:19:39,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-10 15:19:39,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1061 transitions. [2018-10-10 15:19:39,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2018-10-10 15:19:39,637 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:39,638 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:39,638 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:39,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:39,638 INFO L82 PathProgramCache]: Analyzing trace with hash 927701288, now seen corresponding path program 25 times [2018-10-10 15:19:39,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:41,010 INFO L134 CoverageAnalysis]: Checked inductivity of 7825 backedges. 0 proven. 7825 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:41,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:41,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-10 15:19:41,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-10 15:19:41,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-10 15:19:41,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-10-10 15:19:41,012 INFO L87 Difference]: Start difference. First operand 1035 states and 1061 transitions. Second operand 53 states. [2018-10-10 15:19:42,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:42,949 INFO L93 Difference]: Finished difference Result 1128 states and 1156 transitions. [2018-10-10 15:19:42,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-10 15:19:42,950 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 674 [2018-10-10 15:19:42,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:42,955 INFO L225 Difference]: With dead ends: 1128 [2018-10-10 15:19:42,955 INFO L226 Difference]: Without dead ends: 1128 [2018-10-10 15:19:42,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3378, Invalid=7128, Unknown=0, NotChecked=0, Total=10506 [2018-10-10 15:19:42,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2018-10-10 15:19:42,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1075. [2018-10-10 15:19:42,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2018-10-10 15:19:42,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1102 transitions. [2018-10-10 15:19:42,967 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1102 transitions. Word has length 674 [2018-10-10 15:19:42,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:42,968 INFO L481 AbstractCegarLoop]: Abstraction has 1075 states and 1102 transitions. [2018-10-10 15:19:42,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-10 15:19:42,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1102 transitions. [2018-10-10 15:19:42,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2018-10-10 15:19:42,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:42,974 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:42,974 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:42,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:42,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1911003013, now seen corresponding path program 26 times [2018-10-10 15:19:42,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:44,573 INFO L134 CoverageAnalysis]: Checked inductivity of 8476 backedges. 0 proven. 8476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:44,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:44,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-10 15:19:44,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-10 15:19:44,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-10 15:19:44,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 15:19:44,576 INFO L87 Difference]: Start difference. First operand 1075 states and 1102 transitions. Second operand 55 states. [2018-10-10 15:19:46,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:46,725 INFO L93 Difference]: Finished difference Result 1168 states and 1197 transitions. [2018-10-10 15:19:46,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-10 15:19:46,726 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 700 [2018-10-10 15:19:46,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:46,731 INFO L225 Difference]: With dead ends: 1168 [2018-10-10 15:19:46,731 INFO L226 Difference]: Without dead ends: 1168 [2018-10-10 15:19:46,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3643, Invalid=7699, Unknown=0, NotChecked=0, Total=11342 [2018-10-10 15:19:46,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2018-10-10 15:19:46,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1115. [2018-10-10 15:19:46,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2018-10-10 15:19:46,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1143 transitions. [2018-10-10 15:19:46,741 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1143 transitions. Word has length 700 [2018-10-10 15:19:46,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:46,742 INFO L481 AbstractCegarLoop]: Abstraction has 1115 states and 1143 transitions. [2018-10-10 15:19:46,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-10 15:19:46,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1143 transitions. [2018-10-10 15:19:46,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2018-10-10 15:19:46,748 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:46,748 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, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:46,748 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:46,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:46,749 INFO L82 PathProgramCache]: Analyzing trace with hash -541530610, now seen corresponding path program 27 times [2018-10-10 15:19:46,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:48,746 INFO L134 CoverageAnalysis]: Checked inductivity of 9153 backedges. 0 proven. 9153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:48,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:48,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-10 15:19:48,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-10 15:19:48,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-10 15:19:48,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-10-10 15:19:48,748 INFO L87 Difference]: Start difference. First operand 1115 states and 1143 transitions. Second operand 57 states. [2018-10-10 15:19:50,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:50,854 INFO L93 Difference]: Finished difference Result 1208 states and 1238 transitions. [2018-10-10 15:19:50,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-10 15:19:50,855 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 726 [2018-10-10 15:19:50,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:50,861 INFO L225 Difference]: With dead ends: 1208 [2018-10-10 15:19:50,861 INFO L226 Difference]: Without dead ends: 1208 [2018-10-10 15:19:50,862 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3918, Invalid=8292, Unknown=0, NotChecked=0, Total=12210 [2018-10-10 15:19:50,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2018-10-10 15:19:50,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1155. [2018-10-10 15:19:50,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155 states. [2018-10-10 15:19:50,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1184 transitions. [2018-10-10 15:19:50,871 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1184 transitions. Word has length 726 [2018-10-10 15:19:50,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:50,871 INFO L481 AbstractCegarLoop]: Abstraction has 1155 states and 1184 transitions. [2018-10-10 15:19:50,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-10 15:19:50,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1184 transitions. [2018-10-10 15:19:50,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2018-10-10 15:19:50,878 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:50,878 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, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:50,879 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:50,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:50,879 INFO L82 PathProgramCache]: Analyzing trace with hash -401358367, now seen corresponding path program 28 times [2018-10-10 15:19:50,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 9856 backedges. 0 proven. 9856 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:52,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:52,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-10 15:19:52,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-10 15:19:52,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-10 15:19:52,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 15:19:52,582 INFO L87 Difference]: Start difference. First operand 1155 states and 1184 transitions. Second operand 59 states. [2018-10-10 15:19:54,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:54,637 INFO L93 Difference]: Finished difference Result 1248 states and 1279 transitions. [2018-10-10 15:19:54,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-10 15:19:54,637 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 752 [2018-10-10 15:19:54,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:54,643 INFO L225 Difference]: With dead ends: 1248 [2018-10-10 15:19:54,643 INFO L226 Difference]: Without dead ends: 1248 [2018-10-10 15:19:54,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4203, Invalid=8907, Unknown=0, NotChecked=0, Total=13110 [2018-10-10 15:19:54,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2018-10-10 15:19:54,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1195. [2018-10-10 15:19:54,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1195 states. [2018-10-10 15:19:54,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1225 transitions. [2018-10-10 15:19:54,654 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1225 transitions. Word has length 752 [2018-10-10 15:19:54,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:54,655 INFO L481 AbstractCegarLoop]: Abstraction has 1195 states and 1225 transitions. [2018-10-10 15:19:54,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-10 15:19:54,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1225 transitions. [2018-10-10 15:19:54,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2018-10-10 15:19:54,661 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:54,661 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:54,661 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:54,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:54,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1796451316, now seen corresponding path program 29 times [2018-10-10 15:19:54,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:56,339 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:56,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:56,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-10 15:19:56,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-10 15:19:56,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-10 15:19:56,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-10-10 15:19:56,342 INFO L87 Difference]: Start difference. First operand 1195 states and 1225 transitions. Second operand 61 states. [2018-10-10 15:19:58,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:58,767 INFO L93 Difference]: Finished difference Result 1288 states and 1320 transitions. [2018-10-10 15:19:58,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-10 15:19:58,768 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 778 [2018-10-10 15:19:58,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:58,773 INFO L225 Difference]: With dead ends: 1288 [2018-10-10 15:19:58,774 INFO L226 Difference]: Without dead ends: 1288 [2018-10-10 15:19:58,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4498, Invalid=9544, Unknown=0, NotChecked=0, Total=14042 [2018-10-10 15:19:58,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2018-10-10 15:19:58,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1235. [2018-10-10 15:19:58,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2018-10-10 15:19:58,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1266 transitions. [2018-10-10 15:19:58,784 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1266 transitions. Word has length 778 [2018-10-10 15:19:58,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:58,785 INFO L481 AbstractCegarLoop]: Abstraction has 1235 states and 1266 transitions. [2018-10-10 15:19:58,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-10 15:19:58,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1266 transitions. [2018-10-10 15:19:58,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 805 [2018-10-10 15:19:58,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:58,791 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:58,791 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:58,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:58,792 INFO L82 PathProgramCache]: Analyzing trace with hash 2007454791, now seen corresponding path program 30 times [2018-10-10 15:19:58,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:01,026 INFO L134 CoverageAnalysis]: Checked inductivity of 11340 backedges. 0 proven. 11340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:20:01,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:01,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-10 15:20:01,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-10 15:20:01,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-10 15:20:01,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 15:20:01,028 INFO L87 Difference]: Start difference. First operand 1235 states and 1266 transitions. Second operand 63 states. [2018-10-10 15:20:03,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:03,802 INFO L93 Difference]: Finished difference Result 1328 states and 1361 transitions. [2018-10-10 15:20:03,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-10 15:20:03,803 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 804 [2018-10-10 15:20:03,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:03,808 INFO L225 Difference]: With dead ends: 1328 [2018-10-10 15:20:03,808 INFO L226 Difference]: Without dead ends: 1328 [2018-10-10 15:20:03,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4803, Invalid=10203, Unknown=0, NotChecked=0, Total=15006 [2018-10-10 15:20:03,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2018-10-10 15:20:03,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1275. [2018-10-10 15:20:03,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2018-10-10 15:20:03,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1307 transitions. [2018-10-10 15:20:03,820 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1307 transitions. Word has length 804 [2018-10-10 15:20:03,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:03,821 INFO L481 AbstractCegarLoop]: Abstraction has 1275 states and 1307 transitions. [2018-10-10 15:20:03,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-10 15:20:03,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1307 transitions. [2018-10-10 15:20:03,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 831 [2018-10-10 15:20:03,826 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:03,826 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:03,827 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:03,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:03,827 INFO L82 PathProgramCache]: Analyzing trace with hash -356422950, now seen corresponding path program 31 times [2018-10-10 15:20:03,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:06,076 INFO L134 CoverageAnalysis]: Checked inductivity of 12121 backedges. 0 proven. 12121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:20:06,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:06,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-10 15:20:06,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-10 15:20:06,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-10 15:20:06,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-10-10 15:20:06,078 INFO L87 Difference]: Start difference. First operand 1275 states and 1307 transitions. Second operand 65 states. [2018-10-10 15:20:08,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:08,972 INFO L93 Difference]: Finished difference Result 1368 states and 1402 transitions. [2018-10-10 15:20:08,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-10 15:20:08,972 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 830 [2018-10-10 15:20:08,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:08,978 INFO L225 Difference]: With dead ends: 1368 [2018-10-10 15:20:08,978 INFO L226 Difference]: Without dead ends: 1368 [2018-10-10 15:20:08,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2018-10-10 15:20:08,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2018-10-10 15:20:08,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1315. [2018-10-10 15:20:08,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1315 states. [2018-10-10 15:20:08,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1348 transitions. [2018-10-10 15:20:08,990 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1348 transitions. Word has length 830 [2018-10-10 15:20:08,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:08,990 INFO L481 AbstractCegarLoop]: Abstraction has 1315 states and 1348 transitions. [2018-10-10 15:20:08,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-10 15:20:08,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1348 transitions. [2018-10-10 15:20:08,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 857 [2018-10-10 15:20:08,995 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:08,995 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:08,996 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:08,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:08,996 INFO L82 PathProgramCache]: Analyzing trace with hash 844668845, now seen corresponding path program 32 times [2018-10-10 15:20:08,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 12928 backedges. 0 proven. 12928 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:20:11,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:11,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-10 15:20:11,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-10 15:20:11,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-10 15:20:11,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 15:20:11,243 INFO L87 Difference]: Start difference. First operand 1315 states and 1348 transitions. Second operand 67 states. [2018-10-10 15:20:14,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:14,196 INFO L93 Difference]: Finished difference Result 1408 states and 1443 transitions. [2018-10-10 15:20:14,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-10 15:20:14,197 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 856 [2018-10-10 15:20:14,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:14,204 INFO L225 Difference]: With dead ends: 1408 [2018-10-10 15:20:14,204 INFO L226 Difference]: Without dead ends: 1408 [2018-10-10 15:20:14,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5443, Invalid=11587, Unknown=0, NotChecked=0, Total=17030 [2018-10-10 15:20:14,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2018-10-10 15:20:14,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1355. [2018-10-10 15:20:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1355 states. [2018-10-10 15:20:14,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1389 transitions. [2018-10-10 15:20:14,217 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1389 transitions. Word has length 856 [2018-10-10 15:20:14,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:14,218 INFO L481 AbstractCegarLoop]: Abstraction has 1355 states and 1389 transitions. [2018-10-10 15:20:14,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-10 15:20:14,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1389 transitions. [2018-10-10 15:20:14,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 883 [2018-10-10 15:20:14,224 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:14,224 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:14,224 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:14,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:14,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1348969152, now seen corresponding path program 33 times [2018-10-10 15:20:14,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:16,637 INFO L134 CoverageAnalysis]: Checked inductivity of 13761 backedges. 0 proven. 13761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:20:16,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:16,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-10 15:20:16,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-10 15:20:16,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-10 15:20:16,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-10-10 15:20:16,639 INFO L87 Difference]: Start difference. First operand 1355 states and 1389 transitions. Second operand 69 states. [2018-10-10 15:20:19,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:19,664 INFO L93 Difference]: Finished difference Result 1448 states and 1484 transitions. [2018-10-10 15:20:19,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-10 15:20:19,665 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 882 [2018-10-10 15:20:19,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:19,671 INFO L225 Difference]: With dead ends: 1448 [2018-10-10 15:20:19,671 INFO L226 Difference]: Without dead ends: 1448 [2018-10-10 15:20:19,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3201 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5778, Invalid=12312, Unknown=0, NotChecked=0, Total=18090 [2018-10-10 15:20:19,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2018-10-10 15:20:19,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1395. [2018-10-10 15:20:19,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1395 states. [2018-10-10 15:20:19,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1430 transitions. [2018-10-10 15:20:19,682 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 1430 transitions. Word has length 882 [2018-10-10 15:20:19,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:19,683 INFO L481 AbstractCegarLoop]: Abstraction has 1395 states and 1430 transitions. [2018-10-10 15:20:19,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-10 15:20:19,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1430 transitions. [2018-10-10 15:20:19,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 909 [2018-10-10 15:20:19,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:19,690 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:19,691 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:19,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:19,691 INFO L82 PathProgramCache]: Analyzing trace with hash 502080531, now seen corresponding path program 34 times [2018-10-10 15:20:19,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:21,748 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 14620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:20:21,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:21,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-10 15:20:21,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-10 15:20:21,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-10 15:20:21,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-10-10 15:20:21,751 INFO L87 Difference]: Start difference. First operand 1395 states and 1430 transitions. Second operand 71 states. [2018-10-10 15:20:25,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:25,157 INFO L93 Difference]: Finished difference Result 1488 states and 1525 transitions. [2018-10-10 15:20:25,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-10 15:20:25,157 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 908 [2018-10-10 15:20:25,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:25,164 INFO L225 Difference]: With dead ends: 1488 [2018-10-10 15:20:25,164 INFO L226 Difference]: Without dead ends: 1488 [2018-10-10 15:20:25,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=6123, Invalid=13059, Unknown=0, NotChecked=0, Total=19182 [2018-10-10 15:20:25,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2018-10-10 15:20:25,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1435. [2018-10-10 15:20:25,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1435 states. [2018-10-10 15:20:25,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 1471 transitions. [2018-10-10 15:20:25,175 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 1471 transitions. Word has length 908 [2018-10-10 15:20:25,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:25,175 INFO L481 AbstractCegarLoop]: Abstraction has 1435 states and 1471 transitions. [2018-10-10 15:20:25,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-10 15:20:25,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1471 transitions. [2018-10-10 15:20:25,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 935 [2018-10-10 15:20:25,181 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:25,182 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, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:25,182 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:25,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:25,182 INFO L82 PathProgramCache]: Analyzing trace with hash -840182874, now seen corresponding path program 35 times [2018-10-10 15:20:25,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:27,464 INFO L134 CoverageAnalysis]: Checked inductivity of 15505 backedges. 0 proven. 15505 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:20:27,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:27,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-10 15:20:27,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-10 15:20:27,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-10 15:20:27,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-10-10 15:20:27,466 INFO L87 Difference]: Start difference. First operand 1435 states and 1471 transitions. Second operand 73 states. [2018-10-10 15:20:30,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:30,655 INFO L93 Difference]: Finished difference Result 1528 states and 1566 transitions. [2018-10-10 15:20:30,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-10 15:20:30,655 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 934 [2018-10-10 15:20:30,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:30,663 INFO L225 Difference]: With dead ends: 1528 [2018-10-10 15:20:30,663 INFO L226 Difference]: Without dead ends: 1528 [2018-10-10 15:20:30,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6478, Invalid=13828, Unknown=0, NotChecked=0, Total=20306 [2018-10-10 15:20:30,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2018-10-10 15:20:30,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1475. [2018-10-10 15:20:30,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1475 states. [2018-10-10 15:20:30,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 1512 transitions. [2018-10-10 15:20:30,677 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 1512 transitions. Word has length 934 [2018-10-10 15:20:30,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:30,678 INFO L481 AbstractCegarLoop]: Abstraction has 1475 states and 1512 transitions. [2018-10-10 15:20:30,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-10 15:20:30,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1512 transitions. [2018-10-10 15:20:30,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 961 [2018-10-10 15:20:30,684 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:30,685 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, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:30,685 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:30,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:30,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1335205511, now seen corresponding path program 36 times [2018-10-10 15:20:30,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:33,278 INFO L134 CoverageAnalysis]: Checked inductivity of 16416 backedges. 0 proven. 16416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:20:33,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:33,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-10 15:20:33,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-10 15:20:33,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-10 15:20:33,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-10-10 15:20:33,281 INFO L87 Difference]: Start difference. First operand 1475 states and 1512 transitions. Second operand 75 states. [2018-10-10 15:20:36,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:36,665 INFO L93 Difference]: Finished difference Result 1568 states and 1607 transitions. [2018-10-10 15:20:36,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-10 15:20:36,665 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 960 [2018-10-10 15:20:36,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:36,673 INFO L225 Difference]: With dead ends: 1568 [2018-10-10 15:20:36,673 INFO L226 Difference]: Without dead ends: 1568 [2018-10-10 15:20:36,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6843, Invalid=14619, Unknown=0, NotChecked=0, Total=21462 [2018-10-10 15:20:36,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2018-10-10 15:20:36,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1515. [2018-10-10 15:20:36,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1515 states. [2018-10-10 15:20:36,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 1553 transitions. [2018-10-10 15:20:36,688 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 1553 transitions. Word has length 960 [2018-10-10 15:20:36,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:36,689 INFO L481 AbstractCegarLoop]: Abstraction has 1515 states and 1553 transitions. [2018-10-10 15:20:36,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-10 15:20:36,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1553 transitions. [2018-10-10 15:20:36,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 987 [2018-10-10 15:20:36,697 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:36,697 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, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:36,698 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:36,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:36,698 INFO L82 PathProgramCache]: Analyzing trace with hash 896761228, now seen corresponding path program 37 times [2018-10-10 15:20:36,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:39,576 INFO L134 CoverageAnalysis]: Checked inductivity of 17353 backedges. 0 proven. 17353 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:20:39,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:39,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-10 15:20:39,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-10 15:20:39,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-10 15:20:39,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-10-10 15:20:39,578 INFO L87 Difference]: Start difference. First operand 1515 states and 1553 transitions. Second operand 77 states. [2018-10-10 15:20:43,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:43,361 INFO L93 Difference]: Finished difference Result 1608 states and 1648 transitions. [2018-10-10 15:20:43,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-10 15:20:43,362 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 986 [2018-10-10 15:20:43,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:43,367 INFO L225 Difference]: With dead ends: 1608 [2018-10-10 15:20:43,367 INFO L226 Difference]: Without dead ends: 1608 [2018-10-10 15:20:43,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4033 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7218, Invalid=15432, Unknown=0, NotChecked=0, Total=22650 [2018-10-10 15:20:43,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2018-10-10 15:20:43,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1555. [2018-10-10 15:20:43,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-10-10 15:20:43,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1594 transitions. [2018-10-10 15:20:43,381 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1594 transitions. Word has length 986 [2018-10-10 15:20:43,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:43,381 INFO L481 AbstractCegarLoop]: Abstraction has 1555 states and 1594 transitions. [2018-10-10 15:20:43,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-10 15:20:43,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1594 transitions. [2018-10-10 15:20:43,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1013 [2018-10-10 15:20:43,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:43,389 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:43,389 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:43,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:43,389 INFO L82 PathProgramCache]: Analyzing trace with hash 806737887, now seen corresponding path program 38 times [2018-10-10 15:20:43,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:45,963 INFO L134 CoverageAnalysis]: Checked inductivity of 18316 backedges. 0 proven. 18316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:20:45,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:45,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-10 15:20:45,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-10 15:20:45,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-10 15:20:45,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2018-10-10 15:20:45,965 INFO L87 Difference]: Start difference. First operand 1555 states and 1594 transitions. Second operand 79 states. [2018-10-10 15:20:50,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:50,008 INFO L93 Difference]: Finished difference Result 1648 states and 1689 transitions. [2018-10-10 15:20:50,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-10 15:20:50,008 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 1012 [2018-10-10 15:20:50,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:50,013 INFO L225 Difference]: With dead ends: 1648 [2018-10-10 15:20:50,013 INFO L226 Difference]: Without dead ends: 1648 [2018-10-10 15:20:50,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7603, Invalid=16267, Unknown=0, NotChecked=0, Total=23870 [2018-10-10 15:20:50,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2018-10-10 15:20:50,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1595. [2018-10-10 15:20:50,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2018-10-10 15:20:50,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 1635 transitions. [2018-10-10 15:20:50,026 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 1635 transitions. Word has length 1012 [2018-10-10 15:20:50,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:50,027 INFO L481 AbstractCegarLoop]: Abstraction has 1595 states and 1635 transitions. [2018-10-10 15:20:50,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-10 15:20:50,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 1635 transitions. [2018-10-10 15:20:50,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1039 [2018-10-10 15:20:50,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:50,034 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:50,034 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:50,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:50,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1499734130, now seen corresponding path program 39 times [2018-10-10 15:20:50,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:52,927 INFO L134 CoverageAnalysis]: Checked inductivity of 19305 backedges. 0 proven. 19305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:20:52,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:52,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-10 15:20:52,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-10 15:20:52,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-10 15:20:52,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-10-10 15:20:52,928 INFO L87 Difference]: Start difference. First operand 1595 states and 1635 transitions. Second operand 81 states. [2018-10-10 15:20:57,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:57,030 INFO L93 Difference]: Finished difference Result 1688 states and 1730 transitions. [2018-10-10 15:20:57,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-10 15:20:57,031 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 1038 [2018-10-10 15:20:57,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:57,034 INFO L225 Difference]: With dead ends: 1688 [2018-10-10 15:20:57,034 INFO L226 Difference]: Without dead ends: 1688 [2018-10-10 15:20:57,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7998, Invalid=17124, Unknown=0, NotChecked=0, Total=25122 [2018-10-10 15:20:57,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states. [2018-10-10 15:20:57,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1635. [2018-10-10 15:20:57,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1635 states. [2018-10-10 15:20:57,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 1676 transitions. [2018-10-10 15:20:57,047 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 1676 transitions. Word has length 1038 [2018-10-10 15:20:57,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:57,048 INFO L481 AbstractCegarLoop]: Abstraction has 1635 states and 1676 transitions. [2018-10-10 15:20:57,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-10 15:20:57,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 1676 transitions. [2018-10-10 15:20:57,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1065 [2018-10-10 15:20:57,056 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:57,056 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:57,057 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:57,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:57,057 INFO L82 PathProgramCache]: Analyzing trace with hash 326436677, now seen corresponding path program 40 times [2018-10-10 15:20:57,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 20320 backedges. 0 proven. 20320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:21:00,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:00,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-10 15:21:00,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-10 15:21:00,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-10 15:21:00,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-10-10 15:21:00,365 INFO L87 Difference]: Start difference. First operand 1635 states and 1676 transitions. Second operand 83 states. [2018-10-10 15:21:04,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:04,841 INFO L93 Difference]: Finished difference Result 1728 states and 1771 transitions. [2018-10-10 15:21:04,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-10 15:21:04,842 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 1064 [2018-10-10 15:21:04,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:04,846 INFO L225 Difference]: With dead ends: 1728 [2018-10-10 15:21:04,846 INFO L226 Difference]: Without dead ends: 1728 [2018-10-10 15:21:04,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8403, Invalid=18003, Unknown=0, NotChecked=0, Total=26406 [2018-10-10 15:21:04,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2018-10-10 15:21:04,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1675. [2018-10-10 15:21:04,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1675 states. [2018-10-10 15:21:04,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 1717 transitions. [2018-10-10 15:21:04,857 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 1717 transitions. Word has length 1064 [2018-10-10 15:21:04,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:04,857 INFO L481 AbstractCegarLoop]: Abstraction has 1675 states and 1717 transitions. [2018-10-10 15:21:04,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-10 15:21:04,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 1717 transitions. [2018-10-10 15:21:04,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1091 [2018-10-10 15:21:04,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:04,866 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:21:04,866 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:04,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:04,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1818442840, now seen corresponding path program 41 times [2018-10-10 15:21:04,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:08,259 INFO L134 CoverageAnalysis]: Checked inductivity of 21361 backedges. 0 proven. 21361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:21:08,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:08,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-10 15:21:08,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-10 15:21:08,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-10 15:21:08,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-10-10 15:21:08,261 INFO L87 Difference]: Start difference. First operand 1675 states and 1717 transitions. Second operand 85 states. [2018-10-10 15:21:12,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:12,446 INFO L93 Difference]: Finished difference Result 1768 states and 1812 transitions. [2018-10-10 15:21:12,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-10 15:21:12,446 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 1090 [2018-10-10 15:21:12,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:12,450 INFO L225 Difference]: With dead ends: 1768 [2018-10-10 15:21:12,451 INFO L226 Difference]: Without dead ends: 1768 [2018-10-10 15:21:12,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4961 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8818, Invalid=18904, Unknown=0, NotChecked=0, Total=27722 [2018-10-10 15:21:12,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2018-10-10 15:21:12,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1715. [2018-10-10 15:21:12,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2018-10-10 15:21:12,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 1758 transitions. [2018-10-10 15:21:12,467 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 1758 transitions. Word has length 1090 [2018-10-10 15:21:12,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:12,468 INFO L481 AbstractCegarLoop]: Abstraction has 1715 states and 1758 transitions. [2018-10-10 15:21:12,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-10 15:21:12,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 1758 transitions. [2018-10-10 15:21:12,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1117 [2018-10-10 15:21:12,478 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:12,479 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:21:12,479 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:12,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:12,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1632464811, now seen corresponding path program 42 times [2018-10-10 15:21:12,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:15,917 INFO L134 CoverageAnalysis]: Checked inductivity of 22428 backedges. 0 proven. 22428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:21:15,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:15,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-10 15:21:15,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-10 15:21:15,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-10 15:21:15,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-10-10 15:21:15,919 INFO L87 Difference]: Start difference. First operand 1715 states and 1758 transitions. Second operand 87 states. [2018-10-10 15:21:20,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:20,657 INFO L93 Difference]: Finished difference Result 1808 states and 1853 transitions. [2018-10-10 15:21:20,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-10 15:21:20,657 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 1116 [2018-10-10 15:21:20,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:20,662 INFO L225 Difference]: With dead ends: 1808 [2018-10-10 15:21:20,662 INFO L226 Difference]: Without dead ends: 1808 [2018-10-10 15:21:20,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5208 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9243, Invalid=19827, Unknown=0, NotChecked=0, Total=29070 [2018-10-10 15:21:20,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2018-10-10 15:21:20,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1755. [2018-10-10 15:21:20,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1755 states. [2018-10-10 15:21:20,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 1799 transitions. [2018-10-10 15:21:20,677 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 1799 transitions. Word has length 1116 [2018-10-10 15:21:20,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:20,678 INFO L481 AbstractCegarLoop]: Abstraction has 1755 states and 1799 transitions. [2018-10-10 15:21:20,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-10 15:21:20,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 1799 transitions. [2018-10-10 15:21:20,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1143 [2018-10-10 15:21:20,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:20,690 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:21:20,690 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:20,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:20,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1633046846, now seen corresponding path program 43 times [2018-10-10 15:21:20,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:23,675 INFO L134 CoverageAnalysis]: Checked inductivity of 23521 backedges. 0 proven. 23521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:21:23,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:23,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-10 15:21:23,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-10 15:21:23,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-10 15:21:23,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2018-10-10 15:21:23,677 INFO L87 Difference]: Start difference. First operand 1755 states and 1799 transitions. Second operand 89 states. [2018-10-10 15:21:28,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:28,290 INFO L93 Difference]: Finished difference Result 1848 states and 1894 transitions. [2018-10-10 15:21:28,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-10 15:21:28,290 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 1142 [2018-10-10 15:21:28,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:28,296 INFO L225 Difference]: With dead ends: 1848 [2018-10-10 15:21:28,296 INFO L226 Difference]: Without dead ends: 1848 [2018-10-10 15:21:28,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5461 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=9678, Invalid=20772, Unknown=0, NotChecked=0, Total=30450 [2018-10-10 15:21:28,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2018-10-10 15:21:28,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1795. [2018-10-10 15:21:28,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1795 states. [2018-10-10 15:21:28,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 1840 transitions. [2018-10-10 15:21:28,315 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 1840 transitions. Word has length 1142 [2018-10-10 15:21:28,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:28,316 INFO L481 AbstractCegarLoop]: Abstraction has 1795 states and 1840 transitions. [2018-10-10 15:21:28,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-10 15:21:28,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 1840 transitions. [2018-10-10 15:21:28,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1169 [2018-10-10 15:21:28,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:28,330 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, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:21:28,330 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:28,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:28,330 INFO L82 PathProgramCache]: Analyzing trace with hash 279220497, now seen corresponding path program 44 times [2018-10-10 15:21:28,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:31,772 INFO L134 CoverageAnalysis]: Checked inductivity of 24640 backedges. 0 proven. 24640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:21:31,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:31,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-10 15:21:31,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-10 15:21:31,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-10 15:21:31,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2018-10-10 15:21:31,774 INFO L87 Difference]: Start difference. First operand 1795 states and 1840 transitions. Second operand 91 states. [2018-10-10 15:21:36,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:36,923 INFO L93 Difference]: Finished difference Result 1888 states and 1935 transitions. [2018-10-10 15:21:36,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-10 15:21:36,924 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 1168 [2018-10-10 15:21:36,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:36,928 INFO L225 Difference]: With dead ends: 1888 [2018-10-10 15:21:36,929 INFO L226 Difference]: Without dead ends: 1888 [2018-10-10 15:21:36,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=10123, Invalid=21739, Unknown=0, NotChecked=0, Total=31862 [2018-10-10 15:21:36,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2018-10-10 15:21:36,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1835. [2018-10-10 15:21:36,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1835 states. [2018-10-10 15:21:36,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 1881 transitions. [2018-10-10 15:21:36,946 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 1881 transitions. Word has length 1168 [2018-10-10 15:21:36,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:36,947 INFO L481 AbstractCegarLoop]: Abstraction has 1835 states and 1881 transitions. [2018-10-10 15:21:36,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-10 15:21:36,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 1881 transitions. [2018-10-10 15:21:36,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1195 [2018-10-10 15:21:36,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:36,961 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, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:21:36,961 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:36,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:36,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1264770852, now seen corresponding path program 45 times [2018-10-10 15:21:36,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:40,824 INFO L134 CoverageAnalysis]: Checked inductivity of 25785 backedges. 0 proven. 25785 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:21:40,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:40,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-10 15:21:40,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-10 15:21:40,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-10 15:21:40,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2018-10-10 15:21:40,826 INFO L87 Difference]: Start difference. First operand 1835 states and 1881 transitions. Second operand 93 states. [2018-10-10 15:21:46,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:46,322 INFO L93 Difference]: Finished difference Result 1928 states and 1976 transitions. [2018-10-10 15:21:46,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-10 15:21:46,323 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 1194 [2018-10-10 15:21:46,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:46,327 INFO L225 Difference]: With dead ends: 1928 [2018-10-10 15:21:46,327 INFO L226 Difference]: Without dead ends: 1928 [2018-10-10 15:21:46,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10578, Invalid=22728, Unknown=0, NotChecked=0, Total=33306 [2018-10-10 15:21:46,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2018-10-10 15:21:46,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1875. [2018-10-10 15:21:46,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2018-10-10 15:21:46,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 1922 transitions. [2018-10-10 15:21:46,345 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 1922 transitions. Word has length 1194 [2018-10-10 15:21:46,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:46,346 INFO L481 AbstractCegarLoop]: Abstraction has 1875 states and 1922 transitions. [2018-10-10 15:21:46,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-10 15:21:46,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 1922 transitions. [2018-10-10 15:21:46,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1221 [2018-10-10 15:21:46,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:46,361 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:21:46,361 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:46,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:46,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1757408119, now seen corresponding path program 46 times [2018-10-10 15:21:46,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:50,318 INFO L134 CoverageAnalysis]: Checked inductivity of 26956 backedges. 0 proven. 26956 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:21:50,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:50,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-10 15:21:50,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-10 15:21:50,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-10 15:21:50,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-10-10 15:21:50,320 INFO L87 Difference]: Start difference. First operand 1875 states and 1922 transitions. Second operand 95 states. [2018-10-10 15:21:56,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:56,404 INFO L93 Difference]: Finished difference Result 1968 states and 2017 transitions. [2018-10-10 15:21:56,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-10 15:21:56,405 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 1220 [2018-10-10 15:21:56,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:56,408 INFO L225 Difference]: With dead ends: 1968 [2018-10-10 15:21:56,409 INFO L226 Difference]: Without dead ends: 1968 [2018-10-10 15:21:56,411 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6256 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11043, Invalid=23739, Unknown=0, NotChecked=0, Total=34782 [2018-10-10 15:21:56,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2018-10-10 15:21:56,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1915. [2018-10-10 15:21:56,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1915 states. [2018-10-10 15:21:56,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 1963 transitions. [2018-10-10 15:21:56,427 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 1963 transitions. Word has length 1220 [2018-10-10 15:21:56,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:56,428 INFO L481 AbstractCegarLoop]: Abstraction has 1915 states and 1963 transitions. [2018-10-10 15:21:56,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-10 15:21:56,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 1963 transitions. [2018-10-10 15:21:56,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1247 [2018-10-10 15:21:56,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:56,441 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:21:56,441 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:56,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:56,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1108449782, now seen corresponding path program 47 times [2018-10-10 15:21:56,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:22:00,539 INFO L134 CoverageAnalysis]: Checked inductivity of 28153 backedges. 0 proven. 28153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:22:00,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:22:00,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-10 15:22:00,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-10 15:22:00,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-10 15:22:00,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-10-10 15:22:00,541 INFO L87 Difference]: Start difference. First operand 1915 states and 1963 transitions. Second operand 97 states. [2018-10-10 15:22:06,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:22:06,301 INFO L93 Difference]: Finished difference Result 2008 states and 2058 transitions. [2018-10-10 15:22:06,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-10 15:22:06,302 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 1246 [2018-10-10 15:22:06,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:22:06,306 INFO L225 Difference]: With dead ends: 2008 [2018-10-10 15:22:06,306 INFO L226 Difference]: Without dead ends: 2008 [2018-10-10 15:22:06,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6533 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=11518, Invalid=24772, Unknown=0, NotChecked=0, Total=36290 [2018-10-10 15:22:06,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2018-10-10 15:22:06,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1955. [2018-10-10 15:22:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1955 states. [2018-10-10 15:22:06,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1955 states and 2004 transitions. [2018-10-10 15:22:06,321 INFO L78 Accepts]: Start accepts. Automaton has 1955 states and 2004 transitions. Word has length 1246 [2018-10-10 15:22:06,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:22:06,322 INFO L481 AbstractCegarLoop]: Abstraction has 1955 states and 2004 transitions. [2018-10-10 15:22:06,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-10 15:22:06,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 2004 transitions. [2018-10-10 15:22:06,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1273 [2018-10-10 15:22:06,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:22:06,334 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:22:06,334 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:22:06,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:22:06,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1629814493, now seen corresponding path program 48 times [2018-10-10 15:22:06,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:22:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:22:10,221 INFO L134 CoverageAnalysis]: Checked inductivity of 29376 backedges. 0 proven. 29376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:22:10,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:22:10,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-10 15:22:10,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-10 15:22:10,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-10 15:22:10,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-10-10 15:22:10,223 INFO L87 Difference]: Start difference. First operand 1955 states and 2004 transitions. Second operand 99 states. [2018-10-10 15:22:16,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:22:16,396 INFO L93 Difference]: Finished difference Result 2048 states and 2099 transitions. [2018-10-10 15:22:16,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-10 15:22:16,397 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 1272 [2018-10-10 15:22:16,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:22:16,400 INFO L225 Difference]: With dead ends: 2048 [2018-10-10 15:22:16,400 INFO L226 Difference]: Without dead ends: 2048 [2018-10-10 15:22:16,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6816 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=12003, Invalid=25827, Unknown=0, NotChecked=0, Total=37830 [2018-10-10 15:22:16,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2018-10-10 15:22:16,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 1995. [2018-10-10 15:22:16,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1995 states. [2018-10-10 15:22:16,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2045 transitions. [2018-10-10 15:22:16,415 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 2045 transitions. Word has length 1272 [2018-10-10 15:22:16,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:22:16,416 INFO L481 AbstractCegarLoop]: Abstraction has 1995 states and 2045 transitions. [2018-10-10 15:22:16,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-10 15:22:16,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2045 transitions. [2018-10-10 15:22:16,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1299 [2018-10-10 15:22:16,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:22:16,426 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:22:16,427 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:22:16,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:22:16,427 INFO L82 PathProgramCache]: Analyzing trace with hash 748578288, now seen corresponding path program 49 times [2018-10-10 15:22:16,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:22:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:22:20,508 INFO L134 CoverageAnalysis]: Checked inductivity of 30625 backedges. 0 proven. 30625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:22:20,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:22:20,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-10 15:22:20,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-10 15:22:20,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-10 15:22:20,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2018-10-10 15:22:20,511 INFO L87 Difference]: Start difference. First operand 1995 states and 2045 transitions. Second operand 101 states. [2018-10-10 15:22:26,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:22:26,504 INFO L93 Difference]: Finished difference Result 2088 states and 2140 transitions. [2018-10-10 15:22:26,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-10 15:22:26,504 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 1298 [2018-10-10 15:22:26,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:22:26,507 INFO L225 Difference]: With dead ends: 2088 [2018-10-10 15:22:26,507 INFO L226 Difference]: Without dead ends: 2088 [2018-10-10 15:22:26,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=12498, Invalid=26904, Unknown=0, NotChecked=0, Total=39402 [2018-10-10 15:22:26,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2018-10-10 15:22:26,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 2035. [2018-10-10 15:22:26,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2018-10-10 15:22:26,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 2086 transitions. [2018-10-10 15:22:26,526 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 2086 transitions. Word has length 1298 [2018-10-10 15:22:26,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:22:26,526 INFO L481 AbstractCegarLoop]: Abstraction has 2035 states and 2086 transitions. [2018-10-10 15:22:26,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-10 15:22:26,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 2086 transitions. [2018-10-10 15:22:26,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1325 [2018-10-10 15:22:26,537 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:22:26,537 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:22:26,538 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:22:26,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:22:26,538 INFO L82 PathProgramCache]: Analyzing trace with hash 26823491, now seen corresponding path program 50 times [2018-10-10 15:22:26,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:22:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:22:30,828 INFO L134 CoverageAnalysis]: Checked inductivity of 31900 backedges. 0 proven. 31900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:22:30,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:22:30,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-10 15:22:30,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-10 15:22:30,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-10 15:22:30,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2018-10-10 15:22:30,832 INFO L87 Difference]: Start difference. First operand 2035 states and 2086 transitions. Second operand 103 states. [2018-10-10 15:22:37,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:22:37,735 INFO L93 Difference]: Finished difference Result 2128 states and 2181 transitions. [2018-10-10 15:22:37,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-10 15:22:37,735 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 1324 [2018-10-10 15:22:37,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:22:37,738 INFO L225 Difference]: With dead ends: 2128 [2018-10-10 15:22:37,739 INFO L226 Difference]: Without dead ends: 2128 [2018-10-10 15:22:37,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7400 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=13003, Invalid=28003, Unknown=0, NotChecked=0, Total=41006 [2018-10-10 15:22:37,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2128 states. [2018-10-10 15:22:37,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2128 to 2075. [2018-10-10 15:22:37,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2075 states. [2018-10-10 15:22:37,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 2127 transitions. [2018-10-10 15:22:37,752 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 2127 transitions. Word has length 1324 [2018-10-10 15:22:37,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:22:37,753 INFO L481 AbstractCegarLoop]: Abstraction has 2075 states and 2127 transitions. [2018-10-10 15:22:37,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-10 15:22:37,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 2127 transitions. [2018-10-10 15:22:37,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1351 [2018-10-10 15:22:37,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:22:37,765 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:22:37,765 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:22:37,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:22:37,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1264082646, now seen corresponding path program 51 times [2018-10-10 15:22:37,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:22:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:22:42,496 INFO L134 CoverageAnalysis]: Checked inductivity of 33201 backedges. 0 proven. 33201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:22:42,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:22:42,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-10 15:22:42,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-10 15:22:42,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-10 15:22:42,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2018-10-10 15:22:42,498 INFO L87 Difference]: Start difference. First operand 2075 states and 2127 transitions. Second operand 105 states. [2018-10-10 15:22:49,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:22:49,200 INFO L93 Difference]: Finished difference Result 2168 states and 2222 transitions. [2018-10-10 15:22:49,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-10 15:22:49,201 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 1350 [2018-10-10 15:22:49,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:22:49,204 INFO L225 Difference]: With dead ends: 2168 [2018-10-10 15:22:49,204 INFO L226 Difference]: Without dead ends: 2168 [2018-10-10 15:22:49,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7701 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=13518, Invalid=29124, Unknown=0, NotChecked=0, Total=42642 [2018-10-10 15:22:49,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2018-10-10 15:22:49,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2115. [2018-10-10 15:22:49,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2115 states. [2018-10-10 15:22:49,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 2168 transitions. [2018-10-10 15:22:49,220 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 2168 transitions. Word has length 1350 [2018-10-10 15:22:49,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:22:49,220 INFO L481 AbstractCegarLoop]: Abstraction has 2115 states and 2168 transitions. [2018-10-10 15:22:49,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-10 15:22:49,220 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2168 transitions. [2018-10-10 15:22:49,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1377 [2018-10-10 15:22:49,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:22:49,236 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:22:49,237 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:22:49,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:22:49,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1037938519, now seen corresponding path program 52 times [2018-10-10 15:22:49,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:22:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:22:54,134 INFO L134 CoverageAnalysis]: Checked inductivity of 34528 backedges. 0 proven. 34528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:22:54,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:22:54,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-10 15:22:54,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-10 15:22:54,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-10 15:22:54,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-10-10 15:22:54,137 INFO L87 Difference]: Start difference. First operand 2115 states and 2168 transitions. Second operand 107 states. [2018-10-10 15:23:01,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:01,374 INFO L93 Difference]: Finished difference Result 2208 states and 2263 transitions. [2018-10-10 15:23:01,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-10-10 15:23:01,375 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 1376 [2018-10-10 15:23:01,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:01,377 INFO L225 Difference]: With dead ends: 2208 [2018-10-10 15:23:01,377 INFO L226 Difference]: Without dead ends: 2208 [2018-10-10 15:23:01,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8008 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=14043, Invalid=30267, Unknown=0, NotChecked=0, Total=44310 [2018-10-10 15:23:01,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2018-10-10 15:23:01,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 2155. [2018-10-10 15:23:01,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2155 states. [2018-10-10 15:23:01,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 2209 transitions. [2018-10-10 15:23:01,389 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 2209 transitions. Word has length 1376 [2018-10-10 15:23:01,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:01,390 INFO L481 AbstractCegarLoop]: Abstraction has 2155 states and 2209 transitions. [2018-10-10 15:23:01,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-10 15:23:01,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 2209 transitions. [2018-10-10 15:23:01,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1403 [2018-10-10 15:23:01,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:01,402 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:01,402 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:01,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:01,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1849807036, now seen corresponding path program 53 times [2018-10-10 15:23:01,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:06,141 INFO L134 CoverageAnalysis]: Checked inductivity of 35881 backedges. 0 proven. 35881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:23:06,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:06,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-10 15:23:06,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-10 15:23:06,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-10 15:23:06,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2018-10-10 15:23:06,143 INFO L87 Difference]: Start difference. First operand 2155 states and 2209 transitions. Second operand 109 states. [2018-10-10 15:23:13,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:13,650 INFO L93 Difference]: Finished difference Result 2248 states and 2304 transitions. [2018-10-10 15:23:13,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-10-10 15:23:13,650 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 1402 [2018-10-10 15:23:13,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:13,653 INFO L225 Difference]: With dead ends: 2248 [2018-10-10 15:23:13,654 INFO L226 Difference]: Without dead ends: 2248 [2018-10-10 15:23:13,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8321 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=14578, Invalid=31432, Unknown=0, NotChecked=0, Total=46010 [2018-10-10 15:23:13,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2248 states. [2018-10-10 15:23:13,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2248 to 2195. [2018-10-10 15:23:13,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2195 states. [2018-10-10 15:23:13,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 2195 states and 2250 transitions. [2018-10-10 15:23:13,668 INFO L78 Accepts]: Start accepts. Automaton has 2195 states and 2250 transitions. Word has length 1402 [2018-10-10 15:23:13,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:13,668 INFO L481 AbstractCegarLoop]: Abstraction has 2195 states and 2250 transitions. [2018-10-10 15:23:13,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-10 15:23:13,668 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 2250 transitions. [2018-10-10 15:23:13,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1429 [2018-10-10 15:23:13,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:13,683 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, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:13,683 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:13,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:13,684 INFO L82 PathProgramCache]: Analyzing trace with hash -351957233, now seen corresponding path program 54 times [2018-10-10 15:23:13,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:18,976 INFO L134 CoverageAnalysis]: Checked inductivity of 37260 backedges. 0 proven. 37260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:23:18,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:18,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-10 15:23:18,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-10 15:23:18,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-10 15:23:18,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-10-10 15:23:18,978 INFO L87 Difference]: Start difference. First operand 2195 states and 2250 transitions. Second operand 111 states. [2018-10-10 15:23:27,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:27,149 INFO L93 Difference]: Finished difference Result 2288 states and 2345 transitions. [2018-10-10 15:23:27,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-10 15:23:27,150 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 1428 [2018-10-10 15:23:27,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:27,153 INFO L225 Difference]: With dead ends: 2288 [2018-10-10 15:23:27,153 INFO L226 Difference]: Without dead ends: 2288 [2018-10-10 15:23:27,155 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8640 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=15123, Invalid=32619, Unknown=0, NotChecked=0, Total=47742 [2018-10-10 15:23:27,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2288 states. [2018-10-10 15:23:27,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2288 to 2235. [2018-10-10 15:23:27,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2235 states. [2018-10-10 15:23:27,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 2291 transitions. [2018-10-10 15:23:27,167 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 2291 transitions. Word has length 1428 [2018-10-10 15:23:27,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:27,168 INFO L481 AbstractCegarLoop]: Abstraction has 2235 states and 2291 transitions. [2018-10-10 15:23:27,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-10 15:23:27,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 2291 transitions. [2018-10-10 15:23:27,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1455 [2018-10-10 15:23:27,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:27,181 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, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:27,181 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:27,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:27,182 INFO L82 PathProgramCache]: Analyzing trace with hash -373277790, now seen corresponding path program 55 times [2018-10-10 15:23:27,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:32,006 INFO L134 CoverageAnalysis]: Checked inductivity of 38665 backedges. 0 proven. 38665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:23:32,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:32,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-10 15:23:32,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-10 15:23:32,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-10 15:23:32,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2018-10-10 15:23:32,008 INFO L87 Difference]: Start difference. First operand 2235 states and 2291 transitions. Second operand 113 states. [2018-10-10 15:23:40,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:40,194 INFO L93 Difference]: Finished difference Result 2328 states and 2386 transitions. [2018-10-10 15:23:40,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-10-10 15:23:40,194 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 1454 [2018-10-10 15:23:40,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:40,198 INFO L225 Difference]: With dead ends: 2328 [2018-10-10 15:23:40,198 INFO L226 Difference]: Without dead ends: 2328 [2018-10-10 15:23:40,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8965 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=15678, Invalid=33828, Unknown=0, NotChecked=0, Total=49506 [2018-10-10 15:23:40,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2328 states. [2018-10-10 15:23:40,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2328 to 2275. [2018-10-10 15:23:40,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2275 states. [2018-10-10 15:23:40,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 2275 states and 2332 transitions. [2018-10-10 15:23:40,214 INFO L78 Accepts]: Start accepts. Automaton has 2275 states and 2332 transitions. Word has length 1454 [2018-10-10 15:23:40,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:40,215 INFO L481 AbstractCegarLoop]: Abstraction has 2275 states and 2332 transitions. [2018-10-10 15:23:40,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-10 15:23:40,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2275 states and 2332 transitions. [2018-10-10 15:23:40,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1481 [2018-10-10 15:23:40,228 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:40,228 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, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:40,229 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:40,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:40,229 INFO L82 PathProgramCache]: Analyzing trace with hash -188184971, now seen corresponding path program 56 times [2018-10-10 15:23:40,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:45,691 INFO L134 CoverageAnalysis]: Checked inductivity of 40096 backedges. 0 proven. 40096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:23:45,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:45,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-10 15:23:45,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-10 15:23:45,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-10 15:23:45,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2018-10-10 15:23:45,694 INFO L87 Difference]: Start difference. First operand 2275 states and 2332 transitions. Second operand 115 states. [2018-10-10 15:23:53,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:53,799 INFO L93 Difference]: Finished difference Result 2368 states and 2427 transitions. [2018-10-10 15:23:53,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-10-10 15:23:53,800 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 1480 [2018-10-10 15:23:53,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:53,802 INFO L225 Difference]: With dead ends: 2368 [2018-10-10 15:23:53,802 INFO L226 Difference]: Without dead ends: 2368 [2018-10-10 15:23:53,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9296 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=16243, Invalid=35059, Unknown=0, NotChecked=0, Total=51302 [2018-10-10 15:23:53,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2018-10-10 15:23:53,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2315. [2018-10-10 15:23:53,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2315 states. [2018-10-10 15:23:53,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 2373 transitions. [2018-10-10 15:23:53,817 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 2373 transitions. Word has length 1480 [2018-10-10 15:23:53,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:53,818 INFO L481 AbstractCegarLoop]: Abstraction has 2315 states and 2373 transitions. [2018-10-10 15:23:53,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-10 15:23:53,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 2373 transitions. [2018-10-10 15:23:53,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1507 [2018-10-10 15:23:53,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:53,832 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:53,833 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:53,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:53,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1920540552, now seen corresponding path program 57 times [2018-10-10 15:23:53,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:59,553 INFO L134 CoverageAnalysis]: Checked inductivity of 41553 backedges. 0 proven. 41553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:23:59,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:59,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-10 15:23:59,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-10 15:23:59,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-10 15:23:59,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2018-10-10 15:23:59,556 INFO L87 Difference]: Start difference. First operand 2315 states and 2373 transitions. Second operand 117 states. [2018-10-10 15:24:08,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:24:08,192 INFO L93 Difference]: Finished difference Result 2408 states and 2468 transitions. [2018-10-10 15:24:08,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-10-10 15:24:08,193 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 1506 [2018-10-10 15:24:08,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:24:08,196 INFO L225 Difference]: With dead ends: 2408 [2018-10-10 15:24:08,196 INFO L226 Difference]: Without dead ends: 2408 [2018-10-10 15:24:08,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9633 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=16818, Invalid=36312, Unknown=0, NotChecked=0, Total=53130 [2018-10-10 15:24:08,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2018-10-10 15:24:08,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 2355. [2018-10-10 15:24:08,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2355 states. [2018-10-10 15:24:08,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 2355 states and 2414 transitions. [2018-10-10 15:24:08,211 INFO L78 Accepts]: Start accepts. Automaton has 2355 states and 2414 transitions. Word has length 1506 [2018-10-10 15:24:08,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:24:08,212 INFO L481 AbstractCegarLoop]: Abstraction has 2355 states and 2414 transitions. [2018-10-10 15:24:08,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-10 15:24:08,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 2414 transitions. [2018-10-10 15:24:08,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1533 [2018-10-10 15:24:08,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:24:08,226 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:24:08,226 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:24:08,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:24:08,227 INFO L82 PathProgramCache]: Analyzing trace with hash -399460645, now seen corresponding path program 58 times [2018-10-10 15:24:08,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:24:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:24:14,054 INFO L134 CoverageAnalysis]: Checked inductivity of 43036 backedges. 0 proven. 43036 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:24:14,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:24:14,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-10 15:24:14,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-10 15:24:14,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-10 15:24:14,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-10-10 15:24:14,057 INFO L87 Difference]: Start difference. First operand 2355 states and 2414 transitions. Second operand 119 states. [2018-10-10 15:24:23,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:24:23,062 INFO L93 Difference]: Finished difference Result 2448 states and 2509 transitions. [2018-10-10 15:24:23,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-10-10 15:24:23,062 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 1532 [2018-10-10 15:24:23,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:24:23,066 INFO L225 Difference]: With dead ends: 2448 [2018-10-10 15:24:23,066 INFO L226 Difference]: Without dead ends: 2448 [2018-10-10 15:24:23,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9976 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=17403, Invalid=37587, Unknown=0, NotChecked=0, Total=54990 [2018-10-10 15:24:23,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2018-10-10 15:24:23,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 2395. [2018-10-10 15:24:23,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2395 states. [2018-10-10 15:24:23,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 2455 transitions. [2018-10-10 15:24:23,083 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 2455 transitions. Word has length 1532 [2018-10-10 15:24:23,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:24:23,084 INFO L481 AbstractCegarLoop]: Abstraction has 2395 states and 2455 transitions. [2018-10-10 15:24:23,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-10 15:24:23,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 2455 transitions. [2018-10-10 15:24:23,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1559 [2018-10-10 15:24:23,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:24:23,099 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:24:23,099 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:24:23,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:24:23,100 INFO L82 PathProgramCache]: Analyzing trace with hash 2102525038, now seen corresponding path program 59 times [2018-10-10 15:24:23,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:24:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:24:28,765 INFO L134 CoverageAnalysis]: Checked inductivity of 44545 backedges. 0 proven. 44545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:24:28,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:24:28,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-10 15:24:28,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-10 15:24:28,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-10 15:24:28,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3720, Invalid=10800, Unknown=0, NotChecked=0, Total=14520 [2018-10-10 15:24:28,768 INFO L87 Difference]: Start difference. First operand 2395 states and 2455 transitions. Second operand 121 states. [2018-10-10 15:24:37,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:24:37,648 INFO L93 Difference]: Finished difference Result 2488 states and 2550 transitions. [2018-10-10 15:24:37,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-10-10 15:24:37,649 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 1558 [2018-10-10 15:24:37,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:24:37,652 INFO L225 Difference]: With dead ends: 2488 [2018-10-10 15:24:37,652 INFO L226 Difference]: Without dead ends: 2488 [2018-10-10 15:24:37,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10325 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=17998, Invalid=38884, Unknown=0, NotChecked=0, Total=56882 [2018-10-10 15:24:37,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2488 states. [2018-10-10 15:24:37,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2488 to 2435. [2018-10-10 15:24:37,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2435 states. [2018-10-10 15:24:37,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 2496 transitions. [2018-10-10 15:24:37,669 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 2496 transitions. Word has length 1558 [2018-10-10 15:24:37,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:24:37,669 INFO L481 AbstractCegarLoop]: Abstraction has 2435 states and 2496 transitions. [2018-10-10 15:24:37,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-10 15:24:37,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 2496 transitions. [2018-10-10 15:24:37,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1585 [2018-10-10 15:24:37,687 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:24:37,687 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:24:37,688 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:24:37,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:24:37,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1102864319, now seen corresponding path program 60 times [2018-10-10 15:24:37,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:24:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:24:43,789 INFO L134 CoverageAnalysis]: Checked inductivity of 46080 backedges. 0 proven. 46080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:24:43,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:24:43,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-10 15:24:43,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-10 15:24:43,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-10 15:24:43,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2018-10-10 15:24:43,793 INFO L87 Difference]: Start difference. First operand 2435 states and 2496 transitions. Second operand 123 states. [2018-10-10 15:24:52,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:24:52,989 INFO L93 Difference]: Finished difference Result 2528 states and 2591 transitions. [2018-10-10 15:24:52,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-10-10 15:24:52,989 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 1584 [2018-10-10 15:24:52,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:24:52,993 INFO L225 Difference]: With dead ends: 2528 [2018-10-10 15:24:52,993 INFO L226 Difference]: Without dead ends: 2528 [2018-10-10 15:24:52,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10680 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=18603, Invalid=40203, Unknown=0, NotChecked=0, Total=58806 [2018-10-10 15:24:53,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2018-10-10 15:24:53,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2475. [2018-10-10 15:24:53,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2018-10-10 15:24:53,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 2537 transitions. [2018-10-10 15:24:53,014 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 2537 transitions. Word has length 1584 [2018-10-10 15:24:53,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:24:53,015 INFO L481 AbstractCegarLoop]: Abstraction has 2475 states and 2537 transitions. [2018-10-10 15:24:53,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-10 15:24:53,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 2537 transitions. [2018-10-10 15:24:53,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1611 [2018-10-10 15:24:53,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:24:53,032 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:24:53,032 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:24:53,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:24:53,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1620028844, now seen corresponding path program 61 times [2018-10-10 15:24:53,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:24:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:24:59,278 INFO L134 CoverageAnalysis]: Checked inductivity of 47641 backedges. 0 proven. 47641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:24:59,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:24:59,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-10 15:24:59,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-10 15:24:59,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-10 15:24:59,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3968, Invalid=11532, Unknown=0, NotChecked=0, Total=15500 [2018-10-10 15:24:59,281 INFO L87 Difference]: Start difference. First operand 2475 states and 2537 transitions. Second operand 125 states. [2018-10-10 15:25:08,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:08,797 INFO L93 Difference]: Finished difference Result 2568 states and 2632 transitions. [2018-10-10 15:25:08,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-10-10 15:25:08,797 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 1610 [2018-10-10 15:25:08,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:08,800 INFO L225 Difference]: With dead ends: 2568 [2018-10-10 15:25:08,800 INFO L226 Difference]: Without dead ends: 2568 [2018-10-10 15:25:08,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11041 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=19218, Invalid=41544, Unknown=0, NotChecked=0, Total=60762 [2018-10-10 15:25:08,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2018-10-10 15:25:08,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2515. [2018-10-10 15:25:08,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2515 states. [2018-10-10 15:25:08,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2515 states to 2515 states and 2578 transitions. [2018-10-10 15:25:08,816 INFO L78 Accepts]: Start accepts. Automaton has 2515 states and 2578 transitions. Word has length 1610 [2018-10-10 15:25:08,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:08,816 INFO L481 AbstractCegarLoop]: Abstraction has 2515 states and 2578 transitions. [2018-10-10 15:25:08,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-10 15:25:08,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2515 states and 2578 transitions. [2018-10-10 15:25:08,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1637 [2018-10-10 15:25:08,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:08,832 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:08,832 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:08,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:08,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1069104473, now seen corresponding path program 62 times [2018-10-10 15:25:08,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:15,078 INFO L134 CoverageAnalysis]: Checked inductivity of 49228 backedges. 0 proven. 49228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:25:15,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:15,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-10 15:25:15,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-10 15:25:15,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-10 15:25:15,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2018-10-10 15:25:15,081 INFO L87 Difference]: Start difference. First operand 2515 states and 2578 transitions. Second operand 127 states. [2018-10-10 15:25:26,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:26,085 INFO L93 Difference]: Finished difference Result 2608 states and 2673 transitions. [2018-10-10 15:25:26,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-10-10 15:25:26,085 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 1636 [2018-10-10 15:25:26,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:26,089 INFO L225 Difference]: With dead ends: 2608 [2018-10-10 15:25:26,089 INFO L226 Difference]: Without dead ends: 2608 [2018-10-10 15:25:26,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11408 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=19843, Invalid=42907, Unknown=0, NotChecked=0, Total=62750 [2018-10-10 15:25:26,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2608 states. [2018-10-10 15:25:26,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2608 to 2555. [2018-10-10 15:25:26,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2555 states. [2018-10-10 15:25:26,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 2619 transitions. [2018-10-10 15:25:26,102 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 2619 transitions. Word has length 1636 [2018-10-10 15:25:26,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:26,103 INFO L481 AbstractCegarLoop]: Abstraction has 2555 states and 2619 transitions. [2018-10-10 15:25:26,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-10 15:25:26,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 2619 transitions. [2018-10-10 15:25:26,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1663 [2018-10-10 15:25:26,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:26,117 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:26,117 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:26,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:26,118 INFO L82 PathProgramCache]: Analyzing trace with hash -298213062, now seen corresponding path program 63 times [2018-10-10 15:25:26,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:32,776 INFO L134 CoverageAnalysis]: Checked inductivity of 50841 backedges. 0 proven. 50841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:25:32,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:32,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-10 15:25:32,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-10 15:25:32,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-10 15:25:32,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4224, Invalid=12288, Unknown=0, NotChecked=0, Total=16512 [2018-10-10 15:25:32,779 INFO L87 Difference]: Start difference. First operand 2555 states and 2619 transitions. Second operand 129 states. [2018-10-10 15:25:43,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:43,552 INFO L93 Difference]: Finished difference Result 2648 states and 2714 transitions. [2018-10-10 15:25:43,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-10-10 15:25:43,552 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 1662 [2018-10-10 15:25:43,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:43,556 INFO L225 Difference]: With dead ends: 2648 [2018-10-10 15:25:43,556 INFO L226 Difference]: Without dead ends: 2648 [2018-10-10 15:25:43,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11781 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=20478, Invalid=44292, Unknown=0, NotChecked=0, Total=64770 [2018-10-10 15:25:43,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2018-10-10 15:25:43,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 2595. [2018-10-10 15:25:43,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2595 states. [2018-10-10 15:25:43,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 2660 transitions. [2018-10-10 15:25:43,573 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 2660 transitions. Word has length 1662 [2018-10-10 15:25:43,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:43,574 INFO L481 AbstractCegarLoop]: Abstraction has 2595 states and 2660 transitions. [2018-10-10 15:25:43,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-10 15:25:43,574 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 2660 transitions. [2018-10-10 15:25:43,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1689 [2018-10-10 15:25:43,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:43,597 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:43,598 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:43,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:43,598 INFO L82 PathProgramCache]: Analyzing trace with hash -406872563, now seen corresponding path program 64 times [2018-10-10 15:25:43,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:50,534 INFO L134 CoverageAnalysis]: Checked inductivity of 52480 backedges. 0 proven. 52480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:25:50,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:50,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-10 15:25:50,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-10 15:25:50,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-10 15:25:50,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-10-10 15:25:50,537 INFO L87 Difference]: Start difference. First operand 2595 states and 2660 transitions. Second operand 131 states. [2018-10-10 15:26:01,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:26:01,872 INFO L93 Difference]: Finished difference Result 2688 states and 2755 transitions. [2018-10-10 15:26:01,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-10-10 15:26:01,872 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 1688 [2018-10-10 15:26:01,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:26:01,876 INFO L225 Difference]: With dead ends: 2688 [2018-10-10 15:26:01,877 INFO L226 Difference]: Without dead ends: 2688 [2018-10-10 15:26:01,881 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12160 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=21123, Invalid=45699, Unknown=0, NotChecked=0, Total=66822 [2018-10-10 15:26:01,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2688 states. [2018-10-10 15:26:01,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2688 to 2635. [2018-10-10 15:26:01,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2635 states. [2018-10-10 15:26:01,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 2701 transitions. [2018-10-10 15:26:01,896 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 2701 transitions. Word has length 1688 [2018-10-10 15:26:01,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:26:01,897 INFO L481 AbstractCegarLoop]: Abstraction has 2635 states and 2701 transitions. [2018-10-10 15:26:01,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-10 15:26:01,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 2701 transitions. [2018-10-10 15:26:01,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1715 [2018-10-10 15:26:01,914 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:26:01,915 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, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:26:01,915 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:26:01,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:26:01,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1599301920, now seen corresponding path program 65 times [2018-10-10 15:26:01,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:26:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:26:09,108 INFO L134 CoverageAnalysis]: Checked inductivity of 54145 backedges. 0 proven. 54145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:26:09,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:26:09,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-10 15:26:09,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-10 15:26:09,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-10 15:26:09,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4488, Invalid=13068, Unknown=0, NotChecked=0, Total=17556 [2018-10-10 15:26:09,111 INFO L87 Difference]: Start difference. First operand 2635 states and 2701 transitions. Second operand 133 states. [2018-10-10 15:26:20,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:26:20,773 INFO L93 Difference]: Finished difference Result 2728 states and 2796 transitions. [2018-10-10 15:26:20,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-10-10 15:26:20,774 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 1714 [2018-10-10 15:26:20,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:26:20,778 INFO L225 Difference]: With dead ends: 2728 [2018-10-10 15:26:20,778 INFO L226 Difference]: Without dead ends: 2728 [2018-10-10 15:26:20,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12545 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=21778, Invalid=47128, Unknown=0, NotChecked=0, Total=68906 [2018-10-10 15:26:20,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2728 states. [2018-10-10 15:26:20,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2728 to 2675. [2018-10-10 15:26:20,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2675 states. [2018-10-10 15:26:20,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 2742 transitions. [2018-10-10 15:26:20,796 INFO L78 Accepts]: Start accepts. Automaton has 2675 states and 2742 transitions. Word has length 1714 [2018-10-10 15:26:20,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:26:20,797 INFO L481 AbstractCegarLoop]: Abstraction has 2675 states and 2742 transitions. [2018-10-10 15:26:20,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-10 15:26:20,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2675 states and 2742 transitions. [2018-10-10 15:26:20,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1741 [2018-10-10 15:26:20,813 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:26:20,814 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, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:26:20,814 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:26:20,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:26:20,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1047769715, now seen corresponding path program 66 times [2018-10-10 15:26:20,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:26:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:26:28,025 INFO L134 CoverageAnalysis]: Checked inductivity of 55836 backedges. 0 proven. 55836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:26:28,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:26:28,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-10 15:26:28,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-10 15:26:28,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-10 15:26:28,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4623, Invalid=13467, Unknown=0, NotChecked=0, Total=18090 [2018-10-10 15:26:28,028 INFO L87 Difference]: Start difference. First operand 2675 states and 2742 transitions. Second operand 135 states. [2018-10-10 15:26:40,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:26:40,403 INFO L93 Difference]: Finished difference Result 2768 states and 2837 transitions. [2018-10-10 15:26:40,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-10-10 15:26:40,404 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 1740 [2018-10-10 15:26:40,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:26:40,407 INFO L225 Difference]: With dead ends: 2768 [2018-10-10 15:26:40,407 INFO L226 Difference]: Without dead ends: 2768 [2018-10-10 15:26:40,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12936 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=22443, Invalid=48579, Unknown=0, NotChecked=0, Total=71022 [2018-10-10 15:26:40,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2768 states. [2018-10-10 15:26:40,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2768 to 2715. [2018-10-10 15:26:40,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2715 states. [2018-10-10 15:26:40,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2715 states to 2715 states and 2783 transitions. [2018-10-10 15:26:40,426 INFO L78 Accepts]: Start accepts. Automaton has 2715 states and 2783 transitions. Word has length 1740 [2018-10-10 15:26:40,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:26:40,427 INFO L481 AbstractCegarLoop]: Abstraction has 2715 states and 2783 transitions. [2018-10-10 15:26:40,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-10 15:26:40,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2715 states and 2783 transitions. [2018-10-10 15:26:40,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1767 [2018-10-10 15:26:40,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:26:40,450 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:26:40,450 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:26:40,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:26:40,450 INFO L82 PathProgramCache]: Analyzing trace with hash 681781766, now seen corresponding path program 67 times [2018-10-10 15:26:40,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:26:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:26:47,591 INFO L134 CoverageAnalysis]: Checked inductivity of 57553 backedges. 0 proven. 57553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:26:47,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:26:47,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-10 15:26:47,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-10 15:26:47,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-10 15:26:47,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4760, Invalid=13872, Unknown=0, NotChecked=0, Total=18632 [2018-10-10 15:26:47,595 INFO L87 Difference]: Start difference. First operand 2715 states and 2783 transitions. Second operand 137 states. [2018-10-10 15:27:00,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:27:00,495 INFO L93 Difference]: Finished difference Result 2808 states and 2878 transitions. [2018-10-10 15:27:00,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-10-10 15:27:00,496 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 1766 [2018-10-10 15:27:00,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:27:00,499 INFO L225 Difference]: With dead ends: 2808 [2018-10-10 15:27:00,499 INFO L226 Difference]: Without dead ends: 2808 [2018-10-10 15:27:00,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13333 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=23118, Invalid=50052, Unknown=0, NotChecked=0, Total=73170 [2018-10-10 15:27:00,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2018-10-10 15:27:00,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 2755. [2018-10-10 15:27:00,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2755 states. [2018-10-10 15:27:00,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2755 states to 2755 states and 2824 transitions. [2018-10-10 15:27:00,516 INFO L78 Accepts]: Start accepts. Automaton has 2755 states and 2824 transitions. Word has length 1766 [2018-10-10 15:27:00,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:27:00,516 INFO L481 AbstractCegarLoop]: Abstraction has 2755 states and 2824 transitions. [2018-10-10 15:27:00,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-10 15:27:00,517 INFO L276 IsEmpty]: Start isEmpty. Operand 2755 states and 2824 transitions. [2018-10-10 15:27:00,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1793 [2018-10-10 15:27:00,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:27:00,536 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:27:00,536 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:27:00,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:27:00,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1047035865, now seen corresponding path program 68 times [2018-10-10 15:27:00,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:27:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:27:08,201 INFO L134 CoverageAnalysis]: Checked inductivity of 59296 backedges. 0 proven. 59296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:27:08,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:27:08,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-10 15:27:08,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-10 15:27:08,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-10 15:27:08,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4899, Invalid=14283, Unknown=0, NotChecked=0, Total=19182 [2018-10-10 15:27:08,205 INFO L87 Difference]: Start difference. First operand 2755 states and 2824 transitions. Second operand 139 states. [2018-10-10 15:27:20,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:27:20,276 INFO L93 Difference]: Finished difference Result 2848 states and 2919 transitions. [2018-10-10 15:27:20,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-10-10 15:27:20,276 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 1792 [2018-10-10 15:27:20,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:27:20,280 INFO L225 Difference]: With dead ends: 2848 [2018-10-10 15:27:20,280 INFO L226 Difference]: Without dead ends: 2848 [2018-10-10 15:27:20,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13736 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=23803, Invalid=51547, Unknown=0, NotChecked=0, Total=75350 [2018-10-10 15:27:20,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2018-10-10 15:27:20,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 2795. [2018-10-10 15:27:20,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2795 states. [2018-10-10 15:27:20,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2795 states to 2795 states and 2865 transitions. [2018-10-10 15:27:20,297 INFO L78 Accepts]: Start accepts. Automaton has 2795 states and 2865 transitions. Word has length 1792 [2018-10-10 15:27:20,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:27:20,298 INFO L481 AbstractCegarLoop]: Abstraction has 2795 states and 2865 transitions. [2018-10-10 15:27:20,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-10 15:27:20,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2795 states and 2865 transitions. [2018-10-10 15:27:20,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1819 [2018-10-10 15:27:20,313 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:27:20,313 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:27:20,313 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:27:20,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:27:20,314 INFO L82 PathProgramCache]: Analyzing trace with hash 542008300, now seen corresponding path program 69 times [2018-10-10 15:27:20,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:27:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat