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/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 16:33:02,890 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 16:33:02,892 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 16:33:02,910 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 16:33:02,911 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 16:33:02,915 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 16:33:02,916 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 16:33:02,918 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 16:33:02,921 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 16:33:02,922 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 16:33:02,924 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 16:33:02,925 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 16:33:02,926 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 16:33:02,930 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 16:33:02,931 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 16:33:02,932 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 16:33:02,933 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 16:33:02,935 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 16:33:02,937 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 16:33:02,938 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 16:33:02,940 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 16:33:02,941 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 16:33:02,943 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 16:33:02,943 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 16:33:02,944 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 16:33:02,945 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 16:33:02,946 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 16:33:02,946 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 16:33:02,947 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 16:33:02,948 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 16:33:02,948 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 16:33:02,949 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 16:33:02,949 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 16:33:02,950 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 16:33:02,951 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 16:33:02,951 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 16:33:02,952 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-14 16:33:02,963 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 16:33:02,963 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 16:33:02,964 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 16:33:02,964 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 16:33:02,964 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 16:33:02,965 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 16:33:02,965 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 16:33:02,966 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 16:33:02,966 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 16:33:02,966 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 16:33:02,966 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 16:33:02,966 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 16:33:02,967 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 16:33:02,967 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 16:33:02,968 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 16:33:03,014 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 16:33:03,027 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 16:33:03,031 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 16:33:03,033 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 16:33:03,034 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 16:33:03,035 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl [2018-10-14 16:33:03,035 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl' [2018-10-14 16:33:03,125 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 16:33:03,127 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-14 16:33:03,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 16:33:03,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 16:33:03,128 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 16:33:03,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:33:03" (1/1) ... [2018-10-14 16:33:03,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:33:03" (1/1) ... [2018-10-14 16:33:03,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:33:03" (1/1) ... [2018-10-14 16:33:03,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:33:03" (1/1) ... [2018-10-14 16:33:03,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:33:03" (1/1) ... [2018-10-14 16:33:03,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:33:03" (1/1) ... [2018-10-14 16:33:03,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:33:03" (1/1) ... [2018-10-14 16:33:03,199 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 16:33:03,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 16:33:03,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 16:33:03,201 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 16:33:03,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:33:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-14 16:33:03,269 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-14 16:33:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 16:33:03,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 16:33:03,801 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 16:33:03,802 INFO L202 PluginConnector]: Adding new model ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:33:03 BoogieIcfgContainer [2018-10-14 16:33:03,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 16:33:03,803 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 16:33:03,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 16:33:03,807 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 16:33:03,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:33:03" (1/2) ... [2018-10-14 16:33:03,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@762fedf3 and model type ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:33:03, skipping insertion in model container [2018-10-14 16:33:03,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:33:03" (2/2) ... [2018-10-14 16:33:03,811 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl [2018-10-14 16:33:03,821 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 16:33:03,830 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-14 16:33:03,847 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-14 16:33:03,879 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 16:33:03,880 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 16:33:03,880 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 16:33:03,880 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 16:33:03,880 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 16:33:03,880 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 16:33:03,881 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 16:33:03,881 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 16:33:03,881 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 16:33:03,900 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-10-14 16:33:03,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-14 16:33:03,911 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:03,912 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] [2018-10-14 16:33:03,913 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:03,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:03,920 INFO L82 PathProgramCache]: Analyzing trace with hash 842605047, now seen corresponding path program 1 times [2018-10-14 16:33:03,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:04,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:33:04,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 16:33:04,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-14 16:33:04,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-14 16:33:04,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-14 16:33:04,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-14 16:33:04,331 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 7 states. [2018-10-14 16:33:05,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:05,000 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2018-10-14 16:33:05,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-14 16:33:05,002 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-10-14 16:33:05,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:05,021 INFO L225 Difference]: With dead ends: 160 [2018-10-14 16:33:05,022 INFO L226 Difference]: Without dead ends: 160 [2018-10-14 16:33:05,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-10-14 16:33:05,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-14 16:33:05,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 80. [2018-10-14 16:33:05,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-14 16:33:05,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-10-14 16:33:05,081 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 39 [2018-10-14 16:33:05,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:05,082 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-10-14 16:33:05,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-14 16:33:05,083 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-10-14 16:33:05,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-14 16:33:05,084 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:05,085 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:33:05,086 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:05,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:05,086 INFO L82 PathProgramCache]: Analyzing trace with hash -19162818, now seen corresponding path program 1 times [2018-10-14 16:33:05,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:05,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:33:05,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:05,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-14 16:33:05,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-14 16:33:05,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-14 16:33:05,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-14 16:33:05,295 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 8 states. [2018-10-14 16:33:05,589 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-14 16:33:05,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:05,907 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2018-10-14 16:33:05,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-14 16:33:05,910 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-10-14 16:33:05,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:05,912 INFO L225 Difference]: With dead ends: 114 [2018-10-14 16:33:05,913 INFO L226 Difference]: Without dead ends: 114 [2018-10-14 16:33:05,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-10-14 16:33:05,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-14 16:33:05,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 95. [2018-10-14 16:33:05,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-14 16:33:05,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2018-10-14 16:33:05,937 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 54 [2018-10-14 16:33:05,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:05,937 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2018-10-14 16:33:05,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-14 16:33:05,938 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-10-14 16:33:05,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-14 16:33:05,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:05,947 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:33:05,947 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:05,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:05,949 INFO L82 PathProgramCache]: Analyzing trace with hash 899570805, now seen corresponding path program 1 times [2018-10-14 16:33:05,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:06,303 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-14 16:33:06,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:06,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-14 16:33:06,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-14 16:33:06,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-14 16:33:06,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-14 16:33:06,306 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand 5 states. [2018-10-14 16:33:06,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:06,533 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2018-10-14 16:33:06,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-14 16:33:06,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-10-14 16:33:06,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:06,539 INFO L225 Difference]: With dead ends: 160 [2018-10-14 16:33:06,539 INFO L226 Difference]: Without dead ends: 160 [2018-10-14 16:33:06,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-14 16:33:06,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-14 16:33:06,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 110. [2018-10-14 16:33:06,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-14 16:33:06,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2018-10-14 16:33:06,562 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 94 [2018-10-14 16:33:06,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:06,563 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2018-10-14 16:33:06,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-14 16:33:06,564 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2018-10-14 16:33:06,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-14 16:33:06,567 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:06,567 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:33:06,567 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:06,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:06,569 INFO L82 PathProgramCache]: Analyzing trace with hash 921064192, now seen corresponding path program 2 times [2018-10-14 16:33:06,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:07,013 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 5 proven. 58 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-14 16:33:07,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:07,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-14 16:33:07,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 16:33:07,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 16:33:07,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-14 16:33:07,016 INFO L87 Difference]: Start difference. First operand 110 states and 113 transitions. Second operand 12 states. [2018-10-14 16:33:07,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:07,797 INFO L93 Difference]: Finished difference Result 203 states and 208 transitions. [2018-10-14 16:33:07,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-14 16:33:07,798 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 109 [2018-10-14 16:33:07,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:07,801 INFO L225 Difference]: With dead ends: 203 [2018-10-14 16:33:07,802 INFO L226 Difference]: Without dead ends: 203 [2018-10-14 16:33:07,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=274, Invalid=916, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 16:33:07,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-14 16:33:07,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 165. [2018-10-14 16:33:07,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-14 16:33:07,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 170 transitions. [2018-10-14 16:33:07,816 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 170 transitions. Word has length 109 [2018-10-14 16:33:07,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:07,817 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 170 transitions. [2018-10-14 16:33:07,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 16:33:07,817 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 170 transitions. [2018-10-14 16:33:07,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-14 16:33:07,819 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:07,820 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:33:07,820 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:07,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:07,821 INFO L82 PathProgramCache]: Analyzing trace with hash 2132717150, now seen corresponding path program 3 times [2018-10-14 16:33:07,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:08,024 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 71 proven. 11 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-14 16:33:08,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:08,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-14 16:33:08,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-14 16:33:08,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-14 16:33:08,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-14 16:33:08,026 INFO L87 Difference]: Start difference. First operand 165 states and 170 transitions. Second operand 8 states. [2018-10-14 16:33:08,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:08,293 INFO L93 Difference]: Finished difference Result 184 states and 188 transitions. [2018-10-14 16:33:08,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-14 16:33:08,294 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 134 [2018-10-14 16:33:08,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:08,296 INFO L225 Difference]: With dead ends: 184 [2018-10-14 16:33:08,296 INFO L226 Difference]: Without dead ends: 184 [2018-10-14 16:33:08,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-14 16:33:08,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-14 16:33:08,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 165. [2018-10-14 16:33:08,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-14 16:33:08,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 169 transitions. [2018-10-14 16:33:08,308 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 169 transitions. Word has length 134 [2018-10-14 16:33:08,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:08,308 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 169 transitions. [2018-10-14 16:33:08,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-14 16:33:08,308 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2018-10-14 16:33:08,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-14 16:33:08,311 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:08,312 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:33:08,312 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:08,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:08,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1313866263, now seen corresponding path program 4 times [2018-10-14 16:33:08,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:09,234 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 103 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-14 16:33:09,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:09,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 16:33:09,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 16:33:09,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 16:33:09,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:33:09,236 INFO L87 Difference]: Start difference. First operand 165 states and 169 transitions. Second operand 10 states. [2018-10-14 16:33:09,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:09,638 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2018-10-14 16:33:09,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-14 16:33:09,640 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 149 [2018-10-14 16:33:09,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:09,643 INFO L225 Difference]: With dead ends: 184 [2018-10-14 16:33:09,643 INFO L226 Difference]: Without dead ends: 184 [2018-10-14 16:33:09,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-10-14 16:33:09,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-14 16:33:09,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 165. [2018-10-14 16:33:09,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-14 16:33:09,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 168 transitions. [2018-10-14 16:33:09,653 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 168 transitions. Word has length 149 [2018-10-14 16:33:09,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:09,654 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 168 transitions. [2018-10-14 16:33:09,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 16:33:09,654 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 168 transitions. [2018-10-14 16:33:09,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-14 16:33:09,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:09,657 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:33:09,658 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:09,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:09,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1755989758, now seen corresponding path program 5 times [2018-10-14 16:33:09,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:10,217 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 2 proven. 195 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-14 16:33:10,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:10,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-14 16:33:10,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-14 16:33:10,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-14 16:33:10,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-10-14 16:33:10,219 INFO L87 Difference]: Start difference. First operand 165 states and 168 transitions. Second operand 15 states. [2018-10-14 16:33:11,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:11,667 INFO L93 Difference]: Finished difference Result 290 states and 296 transitions. [2018-10-14 16:33:11,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-14 16:33:11,668 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 164 [2018-10-14 16:33:11,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:11,673 INFO L225 Difference]: With dead ends: 290 [2018-10-14 16:33:11,673 INFO L226 Difference]: Without dead ends: 290 [2018-10-14 16:33:11,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=469, Invalid=1787, Unknown=0, NotChecked=0, Total=2256 [2018-10-14 16:33:11,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-14 16:33:11,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 204. [2018-10-14 16:33:11,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-14 16:33:11,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 208 transitions. [2018-10-14 16:33:11,686 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 208 transitions. Word has length 164 [2018-10-14 16:33:11,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:11,687 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 208 transitions. [2018-10-14 16:33:11,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-14 16:33:11,687 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 208 transitions. [2018-10-14 16:33:11,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-14 16:33:11,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:11,690 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:33:11,690 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:11,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:11,691 INFO L82 PathProgramCache]: Analyzing trace with hash -566062048, now seen corresponding path program 6 times [2018-10-14 16:33:11,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:12,009 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 177 proven. 4 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-10-14 16:33:12,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:12,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 16:33:12,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 16:33:12,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 16:33:12,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:33:12,011 INFO L87 Difference]: Start difference. First operand 204 states and 208 transitions. Second operand 10 states. [2018-10-14 16:33:12,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:12,274 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2018-10-14 16:33:12,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-14 16:33:12,275 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 189 [2018-10-14 16:33:12,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:12,276 INFO L225 Difference]: With dead ends: 225 [2018-10-14 16:33:12,276 INFO L226 Difference]: Without dead ends: 218 [2018-10-14 16:33:12,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-10-14 16:33:12,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-14 16:33:12,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 205. [2018-10-14 16:33:12,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-14 16:33:12,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 208 transitions. [2018-10-14 16:33:12,282 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 208 transitions. Word has length 189 [2018-10-14 16:33:12,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:12,282 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 208 transitions. [2018-10-14 16:33:12,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 16:33:12,283 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 208 transitions. [2018-10-14 16:33:12,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-14 16:33:12,286 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:12,286 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:33:12,286 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:12,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:12,287 INFO L82 PathProgramCache]: Analyzing trace with hash 875535335, now seen corresponding path program 7 times [2018-10-14 16:33:12,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:12,605 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 197 proven. 126 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-10-14 16:33:12,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:12,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-14 16:33:12,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 16:33:12,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 16:33:12,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-14 16:33:12,607 INFO L87 Difference]: Start difference. First operand 205 states and 208 transitions. Second operand 12 states. [2018-10-14 16:33:12,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:12,976 INFO L93 Difference]: Finished difference Result 245 states and 247 transitions. [2018-10-14 16:33:12,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-14 16:33:12,976 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 204 [2018-10-14 16:33:12,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:12,978 INFO L225 Difference]: With dead ends: 245 [2018-10-14 16:33:12,978 INFO L226 Difference]: Without dead ends: 245 [2018-10-14 16:33:12,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-10-14 16:33:12,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-14 16:33:12,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 220. [2018-10-14 16:33:12,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-14 16:33:12,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2018-10-14 16:33:12,985 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 204 [2018-10-14 16:33:12,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:12,985 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2018-10-14 16:33:12,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 16:33:12,985 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2018-10-14 16:33:12,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-14 16:33:12,988 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:12,988 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:33:12,988 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:12,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:12,989 INFO L82 PathProgramCache]: Analyzing trace with hash -65589952, now seen corresponding path program 8 times [2018-10-14 16:33:12,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:13,201 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 229 proven. 189 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-10-14 16:33:13,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:13,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-14 16:33:13,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-14 16:33:13,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-14 16:33:13,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-14 16:33:13,202 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 14 states. [2018-10-14 16:33:13,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:13,700 INFO L93 Difference]: Finished difference Result 249 states and 251 transitions. [2018-10-14 16:33:13,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-14 16:33:13,701 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 219 [2018-10-14 16:33:13,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:13,704 INFO L225 Difference]: With dead ends: 249 [2018-10-14 16:33:13,704 INFO L226 Difference]: Without dead ends: 249 [2018-10-14 16:33:13,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2018-10-14 16:33:13,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-14 16:33:13,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-10-14 16:33:13,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-14 16:33:13,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 251 transitions. [2018-10-14 16:33:13,710 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 251 transitions. Word has length 219 [2018-10-14 16:33:13,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:13,711 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 251 transitions. [2018-10-14 16:33:13,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-14 16:33:13,711 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 251 transitions. [2018-10-14 16:33:13,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-14 16:33:13,712 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:13,712 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:33:13,713 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:13,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:13,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1817076025, now seen corresponding path program 9 times [2018-10-14 16:33:13,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:14,015 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 201 proven. 19 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-10-14 16:33:14,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:14,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-14 16:33:14,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-14 16:33:14,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-14 16:33:14,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-14 16:33:14,017 INFO L87 Difference]: Start difference. First operand 249 states and 251 transitions. Second operand 7 states. [2018-10-14 16:33:14,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:14,206 INFO L93 Difference]: Finished difference Result 275 states and 277 transitions. [2018-10-14 16:33:14,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-14 16:33:14,206 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 234 [2018-10-14 16:33:14,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:14,209 INFO L225 Difference]: With dead ends: 275 [2018-10-14 16:33:14,209 INFO L226 Difference]: Without dead ends: 275 [2018-10-14 16:33:14,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-14 16:33:14,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-14 16:33:14,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 250. [2018-10-14 16:33:14,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-14 16:33:14,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 252 transitions. [2018-10-14 16:33:14,215 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 252 transitions. Word has length 234 [2018-10-14 16:33:14,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:14,216 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 252 transitions. [2018-10-14 16:33:14,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-14 16:33:14,216 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 252 transitions. [2018-10-14 16:33:14,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-14 16:33:14,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:14,217 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:33:14,218 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:14,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:14,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1818223214, now seen corresponding path program 10 times [2018-10-14 16:33:14,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:15,141 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 607 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-10-14 16:33:15,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:15,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-14 16:33:15,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-14 16:33:15,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-14 16:33:15,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-10-14 16:33:15,142 INFO L87 Difference]: Start difference. First operand 250 states and 252 transitions. Second operand 15 states. [2018-10-14 16:33:16,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:16,311 INFO L93 Difference]: Finished difference Result 340 states and 343 transitions. [2018-10-14 16:33:16,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-14 16:33:16,311 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 249 [2018-10-14 16:33:16,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:16,314 INFO L225 Difference]: With dead ends: 340 [2018-10-14 16:33:16,314 INFO L226 Difference]: Without dead ends: 340 [2018-10-14 16:33:16,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=686, Invalid=2284, Unknown=0, NotChecked=0, Total=2970 [2018-10-14 16:33:16,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-14 16:33:16,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 320. [2018-10-14 16:33:16,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-10-14 16:33:16,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 323 transitions. [2018-10-14 16:33:16,322 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 323 transitions. Word has length 249 [2018-10-14 16:33:16,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:16,323 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 323 transitions. [2018-10-14 16:33:16,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-14 16:33:16,323 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 323 transitions. [2018-10-14 16:33:16,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-14 16:33:16,325 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:16,325 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:33:16,326 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:16,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:16,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1828338245, now seen corresponding path program 11 times [2018-10-14 16:33:16,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:16,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1252 backedges. 646 proven. 489 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-14 16:33:16,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:16,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-14 16:33:16,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-14 16:33:16,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-14 16:33:16,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-10-14 16:33:16,683 INFO L87 Difference]: Start difference. First operand 320 states and 323 transitions. Second operand 18 states. [2018-10-14 16:33:17,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:17,524 INFO L93 Difference]: Finished difference Result 349 states and 352 transitions. [2018-10-14 16:33:17,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-14 16:33:17,525 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 319 [2018-10-14 16:33:17,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:17,527 INFO L225 Difference]: With dead ends: 349 [2018-10-14 16:33:17,527 INFO L226 Difference]: Without dead ends: 349 [2018-10-14 16:33:17,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=310, Invalid=1250, Unknown=0, NotChecked=0, Total=1560 [2018-10-14 16:33:17,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-10-14 16:33:17,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2018-10-14 16:33:17,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-14 16:33:17,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 352 transitions. [2018-10-14 16:33:17,535 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 352 transitions. Word has length 319 [2018-10-14 16:33:17,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:17,536 INFO L481 AbstractCegarLoop]: Abstraction has 349 states and 352 transitions. [2018-10-14 16:33:17,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-14 16:33:17,536 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 352 transitions. [2018-10-14 16:33:17,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-10-14 16:33:17,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:17,538 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:33:17,538 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:17,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:17,539 INFO L82 PathProgramCache]: Analyzing trace with hash 2108574974, now seen corresponding path program 12 times [2018-10-14 16:33:17,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:17,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1438 backedges. 29 proven. 1230 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-10-14 16:33:17,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:17,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-14 16:33:17,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-14 16:33:17,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-14 16:33:17,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-10-14 16:33:17,998 INFO L87 Difference]: Start difference. First operand 349 states and 352 transitions. Second operand 17 states. [2018-10-14 16:33:19,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:19,092 INFO L93 Difference]: Finished difference Result 453 states and 457 transitions. [2018-10-14 16:33:19,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-14 16:33:19,093 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 334 [2018-10-14 16:33:19,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:19,097 INFO L225 Difference]: With dead ends: 453 [2018-10-14 16:33:19,097 INFO L226 Difference]: Without dead ends: 453 [2018-10-14 16:33:19,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1016, Invalid=3016, Unknown=0, NotChecked=0, Total=4032 [2018-10-14 16:33:19,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-10-14 16:33:19,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 434. [2018-10-14 16:33:19,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-14 16:33:19,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 438 transitions. [2018-10-14 16:33:19,105 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 438 transitions. Word has length 334 [2018-10-14 16:33:19,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:19,106 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 438 transitions. [2018-10-14 16:33:19,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-14 16:33:19,106 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 438 transitions. [2018-10-14 16:33:19,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-10-14 16:33:19,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:19,109 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:33:19,109 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:19,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:19,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1231789166, now seen corresponding path program 13 times [2018-10-14 16:33:19,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:21,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2459 backedges. 0 proven. 2188 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2018-10-14 16:33:21,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:21,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-14 16:33:21,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-14 16:33:21,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-14 16:33:21,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-10-14 16:33:21,471 INFO L87 Difference]: Start difference. First operand 434 states and 438 transitions. Second operand 19 states. [2018-10-14 16:33:23,735 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-14 16:33:23,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:23,958 INFO L93 Difference]: Finished difference Result 538 states and 543 transitions. [2018-10-14 16:33:23,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-14 16:33:23,958 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 419 [2018-10-14 16:33:23,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:23,964 INFO L225 Difference]: With dead ends: 538 [2018-10-14 16:33:23,964 INFO L226 Difference]: Without dead ends: 538 [2018-10-14 16:33:23,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2141 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1354, Invalid=4808, Unknown=0, NotChecked=0, Total=6162 [2018-10-14 16:33:23,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-10-14 16:33:23,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 519. [2018-10-14 16:33:23,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-10-14 16:33:23,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 524 transitions. [2018-10-14 16:33:23,977 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 524 transitions. Word has length 419 [2018-10-14 16:33:23,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:23,977 INFO L481 AbstractCegarLoop]: Abstraction has 519 states and 524 transitions. [2018-10-14 16:33:23,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-14 16:33:23,978 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 524 transitions. [2018-10-14 16:33:23,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2018-10-14 16:33:23,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:23,981 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:33:23,982 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:23,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:23,982 INFO L82 PathProgramCache]: Analyzing trace with hash -940911874, now seen corresponding path program 14 times [2018-10-14 16:33:23,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:25,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3753 backedges. 870 proven. 51 refuted. 0 times theorem prover too weak. 2832 trivial. 0 not checked. [2018-10-14 16:33:25,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:25,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-14 16:33:25,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-14 16:33:25,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-14 16:33:25,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-14 16:33:25,342 INFO L87 Difference]: Start difference. First operand 519 states and 524 transitions. Second operand 9 states. [2018-10-14 16:33:26,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:26,889 INFO L93 Difference]: Finished difference Result 618 states and 624 transitions. [2018-10-14 16:33:26,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-14 16:33:26,890 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 504 [2018-10-14 16:33:26,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:26,894 INFO L225 Difference]: With dead ends: 618 [2018-10-14 16:33:26,894 INFO L226 Difference]: Without dead ends: 618 [2018-10-14 16:33:26,895 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-10-14 16:33:26,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-10-14 16:33:26,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 520. [2018-10-14 16:33:26,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-14 16:33:26,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 525 transitions. [2018-10-14 16:33:26,903 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 525 transitions. Word has length 504 [2018-10-14 16:33:26,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:26,904 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 525 transitions. [2018-10-14 16:33:26,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-14 16:33:26,904 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 525 transitions. [2018-10-14 16:33:26,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-10-14 16:33:26,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:26,908 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:33:26,908 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:26,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:26,909 INFO L82 PathProgramCache]: Analyzing trace with hash 913234263, now seen corresponding path program 15 times [2018-10-14 16:33:26,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:28,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4076 backedges. 0 proven. 3680 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-10-14 16:33:28,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:28,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-14 16:33:28,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-14 16:33:28,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-14 16:33:28,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2018-10-14 16:33:28,879 INFO L87 Difference]: Start difference. First operand 520 states and 525 transitions. Second operand 21 states. [2018-10-14 16:33:30,326 WARN L179 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-10-14 16:33:31,357 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-14 16:33:31,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:31,841 INFO L93 Difference]: Finished difference Result 625 states and 631 transitions. [2018-10-14 16:33:31,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-14 16:33:31,841 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 519 [2018-10-14 16:33:31,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:31,845 INFO L225 Difference]: With dead ends: 625 [2018-10-14 16:33:31,845 INFO L226 Difference]: Without dead ends: 625 [2018-10-14 16:33:31,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2937 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1769, Invalid=6421, Unknown=0, NotChecked=0, Total=8190 [2018-10-14 16:33:31,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-10-14 16:33:31,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 605. [2018-10-14 16:33:31,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-10-14 16:33:31,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 611 transitions. [2018-10-14 16:33:31,856 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 611 transitions. Word has length 519 [2018-10-14 16:33:31,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:31,857 INFO L481 AbstractCegarLoop]: Abstraction has 605 states and 611 transitions. [2018-10-14 16:33:31,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-14 16:33:31,857 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 611 transitions. [2018-10-14 16:33:31,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2018-10-14 16:33:31,861 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:31,861 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:33:31,862 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:31,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:31,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1581938713, now seen corresponding path program 16 times [2018-10-14 16:33:31,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:32,923 INFO L134 CoverageAnalysis]: Checked inductivity of 5704 backedges. 3595 proven. 1663 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2018-10-14 16:33:32,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:32,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-14 16:33:32,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-14 16:33:32,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-14 16:33:32,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2018-10-14 16:33:32,925 INFO L87 Difference]: Start difference. First operand 605 states and 611 transitions. Second operand 26 states. [2018-10-14 16:33:34,396 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-14 16:33:34,824 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-14 16:33:35,162 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-14 16:33:35,637 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-14 16:33:35,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:35,802 INFO L93 Difference]: Finished difference Result 662 states and 668 transitions. [2018-10-14 16:33:35,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-14 16:33:35,802 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 604 [2018-10-14 16:33:35,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:35,806 INFO L225 Difference]: With dead ends: 662 [2018-10-14 16:33:35,806 INFO L226 Difference]: Without dead ends: 662 [2018-10-14 16:33:35,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=554, Invalid=2308, Unknown=0, NotChecked=0, Total=2862 [2018-10-14 16:33:35,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2018-10-14 16:33:35,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 634. [2018-10-14 16:33:35,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-10-14 16:33:35,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 640 transitions. [2018-10-14 16:33:35,817 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 640 transitions. Word has length 604 [2018-10-14 16:33:35,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:35,818 INFO L481 AbstractCegarLoop]: Abstraction has 634 states and 640 transitions. [2018-10-14 16:33:35,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-14 16:33:35,818 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 640 transitions. [2018-10-14 16:33:35,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2018-10-14 16:33:35,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:35,823 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:33:35,823 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:35,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:35,823 INFO L82 PathProgramCache]: Analyzing trace with hash 921423296, now seen corresponding path program 17 times [2018-10-14 16:33:35,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:38,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6103 backedges. 75 proven. 5506 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2018-10-14 16:33:38,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:38,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-14 16:33:38,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-14 16:33:38,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-14 16:33:38,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2018-10-14 16:33:38,325 INFO L87 Difference]: Start difference. First operand 634 states and 640 transitions. Second operand 25 states. [2018-10-14 16:33:41,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:41,238 INFO L93 Difference]: Finished difference Result 753 states and 760 transitions. [2018-10-14 16:33:41,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-14 16:33:41,238 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 619 [2018-10-14 16:33:41,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:41,242 INFO L225 Difference]: With dead ends: 753 [2018-10-14 16:33:41,242 INFO L226 Difference]: Without dead ends: 753 [2018-10-14 16:33:41,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5669 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3182, Invalid=11338, Unknown=0, NotChecked=0, Total=14520 [2018-10-14 16:33:41,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2018-10-14 16:33:41,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 734. [2018-10-14 16:33:41,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-10-14 16:33:41,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 741 transitions. [2018-10-14 16:33:41,255 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 741 transitions. Word has length 619 [2018-10-14 16:33:41,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:41,256 INFO L481 AbstractCegarLoop]: Abstraction has 734 states and 741 transitions. [2018-10-14 16:33:41,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-14 16:33:41,256 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 741 transitions. [2018-10-14 16:33:41,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 720 [2018-10-14 16:33:41,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:41,261 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:33:41,262 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:41,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:41,262 INFO L82 PathProgramCache]: Analyzing trace with hash 318814633, now seen corresponding path program 18 times [2018-10-14 16:33:41,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:42,909 INFO L134 CoverageAnalysis]: Checked inductivity of 8540 backedges. 0 proven. 7834 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2018-10-14 16:33:42,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:42,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-14 16:33:42,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-14 16:33:42,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-14 16:33:42,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2018-10-14 16:33:42,911 INFO L87 Difference]: Start difference. First operand 734 states and 741 transitions. Second operand 25 states. [2018-10-14 16:33:44,401 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-14 16:33:46,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:46,305 INFO L93 Difference]: Finished difference Result 853 states and 861 transitions. [2018-10-14 16:33:46,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-14 16:33:46,305 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 719 [2018-10-14 16:33:46,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:46,310 INFO L225 Difference]: With dead ends: 853 [2018-10-14 16:33:46,310 INFO L226 Difference]: Without dead ends: 853 [2018-10-14 16:33:46,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4904 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2761, Invalid=10349, Unknown=0, NotChecked=0, Total=13110 [2018-10-14 16:33:46,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2018-10-14 16:33:46,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 834. [2018-10-14 16:33:46,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2018-10-14 16:33:46,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 842 transitions. [2018-10-14 16:33:46,325 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 842 transitions. Word has length 719 [2018-10-14 16:33:46,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:46,326 INFO L481 AbstractCegarLoop]: Abstraction has 834 states and 842 transitions. [2018-10-14 16:33:46,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-14 16:33:46,326 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 842 transitions. [2018-10-14 16:33:46,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2018-10-14 16:33:46,332 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:46,333 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:33:46,333 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:46,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:46,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1051450642, now seen corresponding path program 19 times [2018-10-14 16:33:46,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:47,381 INFO L134 CoverageAnalysis]: Checked inductivity of 11387 backedges. 6071 proven. 973 refuted. 0 times theorem prover too weak. 4343 trivial. 0 not checked. [2018-10-14 16:33:47,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:47,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-14 16:33:47,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-14 16:33:47,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-14 16:33:47,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-10-14 16:33:47,382 INFO L87 Difference]: Start difference. First operand 834 states and 842 transitions. Second operand 22 states. [2018-10-14 16:33:48,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:48,477 INFO L93 Difference]: Finished difference Result 864 states and 872 transitions. [2018-10-14 16:33:48,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-14 16:33:48,478 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 819 [2018-10-14 16:33:48,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:48,484 INFO L225 Difference]: With dead ends: 864 [2018-10-14 16:33:48,484 INFO L226 Difference]: Without dead ends: 864 [2018-10-14 16:33:48,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=477, Invalid=1973, Unknown=0, NotChecked=0, Total=2450 [2018-10-14 16:33:48,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2018-10-14 16:33:48,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2018-10-14 16:33:48,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2018-10-14 16:33:48,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 872 transitions. [2018-10-14 16:33:48,495 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 872 transitions. Word has length 819 [2018-10-14 16:33:48,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:48,495 INFO L481 AbstractCegarLoop]: Abstraction has 864 states and 872 transitions. [2018-10-14 16:33:48,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-14 16:33:48,496 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 872 transitions. [2018-10-14 16:33:48,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2018-10-14 16:33:48,503 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:48,503 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:33:48,504 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:48,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:48,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1836060772, now seen corresponding path program 20 times [2018-10-14 16:33:48,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:49,586 INFO L134 CoverageAnalysis]: Checked inductivity of 12534 backedges. 8635 proven. 2682 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2018-10-14 16:33:49,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:49,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-14 16:33:49,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-14 16:33:49,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-14 16:33:49,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2018-10-14 16:33:49,588 INFO L87 Difference]: Start difference. First operand 864 states and 872 transitions. Second operand 30 states. [2018-10-14 16:33:51,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:51,479 INFO L93 Difference]: Finished difference Result 952 states and 960 transitions. [2018-10-14 16:33:51,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-14 16:33:51,482 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 849 [2018-10-14 16:33:51,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:51,486 INFO L225 Difference]: With dead ends: 952 [2018-10-14 16:33:51,486 INFO L226 Difference]: Without dead ends: 952 [2018-10-14 16:33:51,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=750, Invalid=3156, Unknown=0, NotChecked=0, Total=3906 [2018-10-14 16:33:51,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2018-10-14 16:33:51,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 909. [2018-10-14 16:33:51,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2018-10-14 16:33:51,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 918 transitions. [2018-10-14 16:33:51,497 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 918 transitions. Word has length 849 [2018-10-14 16:33:51,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:51,497 INFO L481 AbstractCegarLoop]: Abstraction has 909 states and 918 transitions. [2018-10-14 16:33:51,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-14 16:33:51,498 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 918 transitions. [2018-10-14 16:33:51,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 880 [2018-10-14 16:33:51,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:51,505 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:33:51,506 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:51,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:51,506 INFO L82 PathProgramCache]: Analyzing trace with hash 829120722, now seen corresponding path program 21 times [2018-10-14 16:33:51,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:53,356 INFO L134 CoverageAnalysis]: Checked inductivity of 13741 backedges. 9246 proven. 3140 refuted. 0 times theorem prover too weak. 1355 trivial. 0 not checked. [2018-10-14 16:33:53,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:53,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-14 16:33:53,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-14 16:33:53,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-14 16:33:53,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2018-10-14 16:33:53,357 INFO L87 Difference]: Start difference. First operand 909 states and 918 transitions. Second operand 32 states. [2018-10-14 16:33:54,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:54,513 INFO L93 Difference]: Finished difference Result 999 states and 1007 transitions. [2018-10-14 16:33:54,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-14 16:33:54,513 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 879 [2018-10-14 16:33:54,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:54,518 INFO L225 Difference]: With dead ends: 999 [2018-10-14 16:33:54,518 INFO L226 Difference]: Without dead ends: 999 [2018-10-14 16:33:54,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=876, Invalid=3680, Unknown=0, NotChecked=0, Total=4556 [2018-10-14 16:33:54,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2018-10-14 16:33:54,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 954. [2018-10-14 16:33:54,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 954 states. [2018-10-14 16:33:54,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 964 transitions. [2018-10-14 16:33:54,530 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 964 transitions. Word has length 879 [2018-10-14 16:33:54,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:54,531 INFO L481 AbstractCegarLoop]: Abstraction has 954 states and 964 transitions. [2018-10-14 16:33:54,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-14 16:33:54,531 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 964 transitions. [2018-10-14 16:33:54,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 910 [2018-10-14 16:33:54,539 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:54,540 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:33:54,540 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:54,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:54,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1289131420, now seen corresponding path program 22 times [2018-10-14 16:33:54,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:56,941 INFO L134 CoverageAnalysis]: Checked inductivity of 15008 backedges. 9887 proven. 3613 refuted. 0 times theorem prover too weak. 1508 trivial. 0 not checked. [2018-10-14 16:33:56,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:56,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-14 16:33:56,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-14 16:33:56,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-14 16:33:56,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2018-10-14 16:33:56,943 INFO L87 Difference]: Start difference. First operand 954 states and 964 transitions. Second operand 34 states. [2018-10-14 16:33:59,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:59,291 INFO L93 Difference]: Finished difference Result 1005 states and 1013 transitions. [2018-10-14 16:33:59,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-14 16:33:59,292 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 909 [2018-10-14 16:33:59,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:59,297 INFO L225 Difference]: With dead ends: 1005 [2018-10-14 16:33:59,297 INFO L226 Difference]: Without dead ends: 1005 [2018-10-14 16:33:59,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1206, Invalid=5114, Unknown=0, NotChecked=0, Total=6320 [2018-10-14 16:33:59,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2018-10-14 16:33:59,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 999. [2018-10-14 16:33:59,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 999 states. [2018-10-14 16:33:59,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1010 transitions. [2018-10-14 16:33:59,308 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1010 transitions. Word has length 909 [2018-10-14 16:33:59,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:59,309 INFO L481 AbstractCegarLoop]: Abstraction has 999 states and 1010 transitions. [2018-10-14 16:33:59,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-14 16:33:59,309 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1010 transitions. [2018-10-14 16:33:59,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 940 [2018-10-14 16:33:59,317 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:59,317 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:33:59,318 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:59,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:59,318 INFO L82 PathProgramCache]: Analyzing trace with hash -80888238, now seen corresponding path program 23 times [2018-10-14 16:33:59,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:34:00,512 INFO L134 CoverageAnalysis]: Checked inductivity of 16335 backedges. 0 proven. 14806 refuted. 0 times theorem prover too weak. 1529 trivial. 0 not checked. [2018-10-14 16:34:00,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:34:00,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-14 16:34:00,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-14 16:34:00,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-14 16:34:00,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2018-10-14 16:34:00,514 INFO L87 Difference]: Start difference. First operand 999 states and 1010 transitions. Second operand 27 states. [2018-10-14 16:34:03,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:34:03,727 INFO L93 Difference]: Finished difference Result 1163 states and 1175 transitions. [2018-10-14 16:34:03,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-14 16:34:03,728 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 939 [2018-10-14 16:34:03,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:34:03,734 INFO L225 Difference]: With dead ends: 1163 [2018-10-14 16:34:03,734 INFO L226 Difference]: Without dead ends: 1163 [2018-10-14 16:34:03,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6075 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3338, Invalid=12664, Unknown=0, NotChecked=0, Total=16002 [2018-10-14 16:34:03,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2018-10-14 16:34:03,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1144. [2018-10-14 16:34:03,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1144 states. [2018-10-14 16:34:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1156 transitions. [2018-10-14 16:34:03,748 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1156 transitions. Word has length 939 [2018-10-14 16:34:03,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:34:03,749 INFO L481 AbstractCegarLoop]: Abstraction has 1144 states and 1156 transitions. [2018-10-14 16:34:03,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-14 16:34:03,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1156 transitions. [2018-10-14 16:34:03,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1085 [2018-10-14 16:34:03,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:34:03,760 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:34:03,761 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:34:03,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:34:03,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1791416820, now seen corresponding path program 24 times [2018-10-14 16:34:03,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:34:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:34:05,037 INFO L134 CoverageAnalysis]: Checked inductivity of 22531 backedges. 0 proven. 20574 refuted. 0 times theorem prover too weak. 1957 trivial. 0 not checked. [2018-10-14 16:34:05,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:34:05,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-14 16:34:05,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-14 16:34:05,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-14 16:34:05,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2018-10-14 16:34:05,039 INFO L87 Difference]: Start difference. First operand 1144 states and 1156 transitions. Second operand 29 states. [2018-10-14 16:34:08,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:34:08,841 INFO L93 Difference]: Finished difference Result 1308 states and 1321 transitions. [2018-10-14 16:34:08,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-14 16:34:08,845 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 1084 [2018-10-14 16:34:08,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:34:08,849 INFO L225 Difference]: With dead ends: 1308 [2018-10-14 16:34:08,849 INFO L226 Difference]: Without dead ends: 1308 [2018-10-14 16:34:08,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7371 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3969, Invalid=15213, Unknown=0, NotChecked=0, Total=19182 [2018-10-14 16:34:08,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2018-10-14 16:34:08,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1289. [2018-10-14 16:34:08,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1289 states. [2018-10-14 16:34:08,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1302 transitions. [2018-10-14 16:34:08,864 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1302 transitions. Word has length 1084 [2018-10-14 16:34:08,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:34:08,865 INFO L481 AbstractCegarLoop]: Abstraction has 1289 states and 1302 transitions. [2018-10-14 16:34:08,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-14 16:34:08,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1302 transitions. [2018-10-14 16:34:08,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1230 [2018-10-14 16:34:08,879 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:34:08,879 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:34:08,880 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:34:08,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:34:08,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1296599442, now seen corresponding path program 25 times [2018-10-14 16:34:08,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:34:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:34:10,890 INFO L134 CoverageAnalysis]: Checked inductivity of 29728 backedges. 43 proven. 27297 refuted. 0 times theorem prover too weak. 2388 trivial. 0 not checked. [2018-10-14 16:34:10,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:34:10,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-14 16:34:10,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-14 16:34:10,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-14 16:34:10,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=746, Unknown=0, NotChecked=0, Total=930 [2018-10-14 16:34:10,892 INFO L87 Difference]: Start difference. First operand 1289 states and 1302 transitions. Second operand 31 states. [2018-10-14 16:34:14,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:34:14,488 INFO L93 Difference]: Finished difference Result 1453 states and 1467 transitions. [2018-10-14 16:34:14,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-14 16:34:14,488 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 1229 [2018-10-14 16:34:14,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:34:14,495 INFO L225 Difference]: With dead ends: 1453 [2018-10-14 16:34:14,495 INFO L226 Difference]: Without dead ends: 1453 [2018-10-14 16:34:14,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8564 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4929, Invalid=16827, Unknown=0, NotChecked=0, Total=21756 [2018-10-14 16:34:14,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2018-10-14 16:34:14,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1434. [2018-10-14 16:34:14,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2018-10-14 16:34:14,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1448 transitions. [2018-10-14 16:34:14,516 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1448 transitions. Word has length 1229 [2018-10-14 16:34:14,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:34:14,517 INFO L481 AbstractCegarLoop]: Abstraction has 1434 states and 1448 transitions. [2018-10-14 16:34:14,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-14 16:34:14,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1448 transitions. [2018-10-14 16:34:14,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1375 [2018-10-14 16:34:14,539 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:34:14,540 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:34:14,540 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:34:14,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:34:14,541 INFO L82 PathProgramCache]: Analyzing trace with hash 781861580, now seen corresponding path program 26 times [2018-10-14 16:34:14,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:34:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:34:16,429 INFO L134 CoverageAnalysis]: Checked inductivity of 37926 backedges. 43 proven. 35067 refuted. 0 times theorem prover too weak. 2816 trivial. 0 not checked. [2018-10-14 16:34:16,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:34:16,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-14 16:34:16,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-14 16:34:16,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-14 16:34:16,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=845, Unknown=0, NotChecked=0, Total=1056 [2018-10-14 16:34:16,430 INFO L87 Difference]: Start difference. First operand 1434 states and 1448 transitions. Second operand 33 states. [2018-10-14 16:34:20,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:34:20,459 INFO L93 Difference]: Finished difference Result 1598 states and 1613 transitions. [2018-10-14 16:34:20,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-10-14 16:34:20,459 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 1374 [2018-10-14 16:34:20,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:34:20,466 INFO L225 Difference]: With dead ends: 1598 [2018-10-14 16:34:20,467 INFO L226 Difference]: Without dead ends: 1598 [2018-10-14 16:34:20,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10110 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5724, Invalid=19716, Unknown=0, NotChecked=0, Total=25440 [2018-10-14 16:34:20,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2018-10-14 16:34:20,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1579. [2018-10-14 16:34:20,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2018-10-14 16:34:20,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 1594 transitions. [2018-10-14 16:34:20,482 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 1594 transitions. Word has length 1374 [2018-10-14 16:34:20,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:34:20,483 INFO L481 AbstractCegarLoop]: Abstraction has 1579 states and 1594 transitions. [2018-10-14 16:34:20,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-14 16:34:20,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 1594 transitions. [2018-10-14 16:34:20,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1520 [2018-10-14 16:34:20,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:34:20,502 INFO L375 BasicCegarLoop]: trace histogram [78, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:34:20,502 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:34:20,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:34:20,503 INFO L82 PathProgramCache]: Analyzing trace with hash -650607406, now seen corresponding path program 27 times [2018-10-14 16:34:20,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:34:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:34:22,406 INFO L134 CoverageAnalysis]: Checked inductivity of 47125 backedges. 23640 proven. 2184 refuted. 0 times theorem prover too weak. 21301 trivial. 0 not checked. [2018-10-14 16:34:22,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:34:22,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-14 16:34:22,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-14 16:34:22,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-14 16:34:22,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2018-10-14 16:34:22,408 INFO L87 Difference]: Start difference. First operand 1579 states and 1594 transitions. Second operand 28 states. [2018-10-14 16:34:23,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:34:23,845 INFO L93 Difference]: Finished difference Result 1611 states and 1624 transitions. [2018-10-14 16:34:23,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-14 16:34:23,846 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1519 [2018-10-14 16:34:23,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:34:23,852 INFO L225 Difference]: With dead ends: 1611 [2018-10-14 16:34:23,852 INFO L226 Difference]: Without dead ends: 1611 [2018-10-14 16:34:23,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=663, Invalid=2759, Unknown=0, NotChecked=0, Total=3422 [2018-10-14 16:34:23,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2018-10-14 16:34:23,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1594. [2018-10-14 16:34:23,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1594 states. [2018-10-14 16:34:23,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 1609 transitions. [2018-10-14 16:34:23,868 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 1609 transitions. Word has length 1519 [2018-10-14 16:34:23,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:34:23,869 INFO L481 AbstractCegarLoop]: Abstraction has 1594 states and 1609 transitions. [2018-10-14 16:34:23,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-14 16:34:23,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 1609 transitions. [2018-10-14 16:34:23,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1535 [2018-10-14 16:34:23,887 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:34:23,888 INFO L375 BasicCegarLoop]: trace histogram [79, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:34:23,888 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:34:23,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:34:23,889 INFO L82 PathProgramCache]: Analyzing trace with hash -473198923, now seen corresponding path program 28 times [2018-10-14 16:34:23,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:34:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:34:26,700 INFO L134 CoverageAnalysis]: Checked inductivity of 48295 backedges. 0 proven. 44978 refuted. 0 times theorem prover too weak. 3317 trivial. 0 not checked. [2018-10-14 16:34:26,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:34:26,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-14 16:34:26,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-14 16:34:26,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-14 16:34:26,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=953, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 16:34:26,702 INFO L87 Difference]: Start difference. First operand 1594 states and 1609 transitions. Second operand 35 states. [2018-10-14 16:34:31,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:34:31,367 INFO L93 Difference]: Finished difference Result 1758 states and 1774 transitions. [2018-10-14 16:34:31,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-10-14 16:34:31,368 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 1534 [2018-10-14 16:34:31,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:34:31,375 INFO L225 Difference]: With dead ends: 1758 [2018-10-14 16:34:31,375 INFO L226 Difference]: Without dead ends: 1758 [2018-10-14 16:34:31,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12009 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6186, Invalid=24264, Unknown=0, NotChecked=0, Total=30450 [2018-10-14 16:34:31,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2018-10-14 16:34:31,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1739. [2018-10-14 16:34:31,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1739 states. [2018-10-14 16:34:31,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 1755 transitions. [2018-10-14 16:34:31,390 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 1755 transitions. Word has length 1534 [2018-10-14 16:34:31,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:34:31,391 INFO L481 AbstractCegarLoop]: Abstraction has 1739 states and 1755 transitions. [2018-10-14 16:34:31,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-14 16:34:31,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 1755 transitions. [2018-10-14 16:34:31,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1680 [2018-10-14 16:34:31,412 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:34:31,413 INFO L375 BasicCegarLoop]: trace histogram [87, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 15, 15, 15, 15, 15, 15, 15, 15, 15, 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, 1, 1, 1, 1, 1] [2018-10-14 16:34:31,413 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:34:31,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:34:31,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1358759927, now seen corresponding path program 29 times [2018-10-14 16:34:31,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:34:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:34:34,177 INFO L134 CoverageAnalysis]: Checked inductivity of 58616 backedges. 0 proven. 54871 refuted. 0 times theorem prover too weak. 3745 trivial. 0 not checked. [2018-10-14 16:34:34,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:34:34,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-14 16:34:34,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-14 16:34:34,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-14 16:34:34,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=1064, Unknown=0, NotChecked=0, Total=1332 [2018-10-14 16:34:34,179 INFO L87 Difference]: Start difference. First operand 1739 states and 1755 transitions. Second operand 37 states. [2018-10-14 16:34:39,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:34:39,538 INFO L93 Difference]: Finished difference Result 1903 states and 1920 transitions. [2018-10-14 16:34:39,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-10-14 16:34:39,538 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 1679 [2018-10-14 16:34:39,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:34:39,546 INFO L225 Difference]: With dead ends: 1903 [2018-10-14 16:34:39,546 INFO L226 Difference]: Without dead ends: 1903 [2018-10-14 16:34:39,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13805 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7033, Invalid=27749, Unknown=0, NotChecked=0, Total=34782 [2018-10-14 16:34:39,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2018-10-14 16:34:39,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1884. [2018-10-14 16:34:39,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1884 states. [2018-10-14 16:34:39,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 1901 transitions. [2018-10-14 16:34:39,562 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 1901 transitions. Word has length 1679 [2018-10-14 16:34:39,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:34:39,563 INFO L481 AbstractCegarLoop]: Abstraction has 1884 states and 1901 transitions. [2018-10-14 16:34:39,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-14 16:34:39,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 1901 transitions. [2018-10-14 16:34:39,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1825 [2018-10-14 16:34:39,587 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:34:39,587 INFO L375 BasicCegarLoop]: trace histogram [95, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 16, 16, 16, 16, 16, 16, 16, 16, 16, 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, 1, 1, 1, 1, 1] [2018-10-14 16:34:39,588 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:34:39,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:34:39,588 INFO L82 PathProgramCache]: Analyzing trace with hash -880139979, now seen corresponding path program 30 times [2018-10-14 16:34:39,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:34:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:34:43,423 INFO L134 CoverageAnalysis]: Checked inductivity of 69938 backedges. 0 proven. 65765 refuted. 0 times theorem prover too weak. 4173 trivial. 0 not checked. [2018-10-14 16:34:43,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:34:43,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-14 16:34:43,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-14 16:34:43,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-14 16:34:43,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1181, Unknown=0, NotChecked=0, Total=1482 [2018-10-14 16:34:43,425 INFO L87 Difference]: Start difference. First operand 1884 states and 1901 transitions. Second operand 39 states. [2018-10-14 16:34:49,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:34:49,214 INFO L93 Difference]: Finished difference Result 2048 states and 2066 transitions. [2018-10-14 16:34:49,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-14 16:34:49,215 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 1824 [2018-10-14 16:34:49,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:34:49,223 INFO L225 Difference]: With dead ends: 2048 [2018-10-14 16:34:49,223 INFO L226 Difference]: Without dead ends: 2048 [2018-10-14 16:34:49,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15726 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=7934, Invalid=31468, Unknown=0, NotChecked=0, Total=39402 [2018-10-14 16:34:49,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2018-10-14 16:34:49,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 2029. [2018-10-14 16:34:49,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states. [2018-10-14 16:34:49,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 2047 transitions. [2018-10-14 16:34:49,239 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 2047 transitions. Word has length 1824 [2018-10-14 16:34:49,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:34:49,240 INFO L481 AbstractCegarLoop]: Abstraction has 2029 states and 2047 transitions. [2018-10-14 16:34:49,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-14 16:34:49,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 2047 transitions. [2018-10-14 16:34:49,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1970 [2018-10-14 16:34:49,262 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:34:49,263 INFO L375 BasicCegarLoop]: trace histogram [103, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 17, 17, 17, 17, 17, 17, 17, 17, 17, 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, 1, 1, 1, 1, 1] [2018-10-14 16:34:49,263 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:34:49,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:34:49,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1301525897, now seen corresponding path program 31 times [2018-10-14 16:34:49,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:34:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:34:52,817 INFO L134 CoverageAnalysis]: Checked inductivity of 82261 backedges. 0 proven. 77660 refuted. 0 times theorem prover too weak. 4601 trivial. 0 not checked. [2018-10-14 16:34:52,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:34:52,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-14 16:34:52,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-14 16:34:52,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-14 16:34:52,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=1304, Unknown=0, NotChecked=0, Total=1640 [2018-10-14 16:34:52,820 INFO L87 Difference]: Start difference. First operand 2029 states and 2047 transitions. Second operand 41 states. [2018-10-14 16:34:59,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:34:59,117 INFO L93 Difference]: Finished difference Result 2193 states and 2212 transitions. [2018-10-14 16:34:59,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-10-14 16:34:59,118 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 1969 [2018-10-14 16:34:59,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:34:59,126 INFO L225 Difference]: With dead ends: 2193 [2018-10-14 16:34:59,126 INFO L226 Difference]: Without dead ends: 2193 [2018-10-14 16:34:59,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17772 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8889, Invalid=35421, Unknown=0, NotChecked=0, Total=44310 [2018-10-14 16:34:59,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2193 states. [2018-10-14 16:34:59,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2193 to 2174. [2018-10-14 16:34:59,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2174 states. [2018-10-14 16:34:59,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 2193 transitions. [2018-10-14 16:34:59,144 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 2193 transitions. Word has length 1969 [2018-10-14 16:34:59,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:34:59,145 INFO L481 AbstractCegarLoop]: Abstraction has 2174 states and 2193 transitions. [2018-10-14 16:34:59,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-14 16:34:59,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 2193 transitions. [2018-10-14 16:34:59,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2115 [2018-10-14 16:34:59,169 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:34:59,170 INFO L375 BasicCegarLoop]: trace histogram [111, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 18, 18, 18, 18, 18, 18, 18, 18, 18, 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, 1, 1, 1, 1, 1] [2018-10-14 16:34:59,170 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:34:59,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:34:59,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1781797813, now seen corresponding path program 32 times [2018-10-14 16:34:59,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:34:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:35:02,888 INFO L134 CoverageAnalysis]: Checked inductivity of 95585 backedges. 0 proven. 90556 refuted. 0 times theorem prover too weak. 5029 trivial. 0 not checked. [2018-10-14 16:35:02,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:35:02,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-14 16:35:02,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-14 16:35:02,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-14 16:35:02,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=373, Invalid=1433, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 16:35:02,890 INFO L87 Difference]: Start difference. First operand 2174 states and 2193 transitions. Second operand 43 states. [2018-10-14 16:35:09,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:35:09,848 INFO L93 Difference]: Finished difference Result 2338 states and 2358 transitions. [2018-10-14 16:35:09,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-10-14 16:35:09,848 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 2114 [2018-10-14 16:35:09,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:35:09,856 INFO L225 Difference]: With dead ends: 2338 [2018-10-14 16:35:09,856 INFO L226 Difference]: Without dead ends: 2338 [2018-10-14 16:35:09,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19943 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9898, Invalid=39608, Unknown=0, NotChecked=0, Total=49506 [2018-10-14 16:35:09,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2018-10-14 16:35:09,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 2319. [2018-10-14 16:35:09,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2319 states. [2018-10-14 16:35:09,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2319 states to 2319 states and 2339 transitions. [2018-10-14 16:35:09,873 INFO L78 Accepts]: Start accepts. Automaton has 2319 states and 2339 transitions. Word has length 2114 [2018-10-14 16:35:09,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:35:09,874 INFO L481 AbstractCegarLoop]: Abstraction has 2319 states and 2339 transitions. [2018-10-14 16:35:09,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-14 16:35:09,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2319 states and 2339 transitions. [2018-10-14 16:35:09,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2260 [2018-10-14 16:35:09,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:35:09,903 INFO L375 BasicCegarLoop]: trace histogram [119, 118, 118, 118, 118, 118, 118, 118, 118, 118, 118, 118, 118, 118, 118, 19, 19, 19, 19, 19, 19, 19, 19, 19, 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, 1, 1, 1, 1, 1] [2018-10-14 16:35:09,903 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:35:09,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:35:09,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1822092535, now seen corresponding path program 33 times [2018-10-14 16:35:09,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:35:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:35:15,005 INFO L134 CoverageAnalysis]: Checked inductivity of 109910 backedges. 0 proven. 104484 refuted. 0 times theorem prover too weak. 5426 trivial. 0 not checked. [2018-10-14 16:35:15,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:35:15,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-14 16:35:15,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-14 16:35:15,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-14 16:35:15,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=1746, Unknown=0, NotChecked=0, Total=2162 [2018-10-14 16:35:15,007 INFO L87 Difference]: Start difference. First operand 2319 states and 2339 transitions. Second operand 47 states. [2018-10-14 16:35:27,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:35:27,099 INFO L93 Difference]: Finished difference Result 2483 states and 2504 transitions. [2018-10-14 16:35:27,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 268 states. [2018-10-14 16:35:27,099 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 2259 [2018-10-14 16:35:27,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:35:27,109 INFO L225 Difference]: With dead ends: 2483 [2018-10-14 16:35:27,109 INFO L226 Difference]: Without dead ends: 2483 [2018-10-14 16:35:27,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 307 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41736 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=17163, Invalid=78009, Unknown=0, NotChecked=0, Total=95172 [2018-10-14 16:35:27,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2018-10-14 16:35:27,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 2464. [2018-10-14 16:35:27,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2464 states. [2018-10-14 16:35:27,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2464 states to 2464 states and 2485 transitions. [2018-10-14 16:35:27,132 INFO L78 Accepts]: Start accepts. Automaton has 2464 states and 2485 transitions. Word has length 2259 [2018-10-14 16:35:27,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:35:27,134 INFO L481 AbstractCegarLoop]: Abstraction has 2464 states and 2485 transitions. [2018-10-14 16:35:27,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-14 16:35:27,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2464 states and 2485 transitions. [2018-10-14 16:35:27,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2405 [2018-10-14 16:35:27,164 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:35:27,165 INFO L375 BasicCegarLoop]: trace histogram [127, 126, 126, 126, 126, 126, 126, 126, 126, 126, 126, 126, 126, 126, 126, 20, 20, 20, 20, 20, 20, 20, 20, 20, 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, 1, 1, 1, 1, 1] [2018-10-14 16:35:27,165 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:35:27,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:35:27,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1626433077, now seen corresponding path program 34 times [2018-10-14 16:35:27,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:35:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:35:32,331 INFO L134 CoverageAnalysis]: Checked inductivity of 125236 backedges. 75 proven. 119305 refuted. 0 times theorem prover too weak. 5856 trivial. 0 not checked. [2018-10-14 16:35:32,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:35:32,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-14 16:35:32,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-14 16:35:32,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-14 16:35:32,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=1887, Unknown=0, NotChecked=0, Total=2352 [2018-10-14 16:35:32,333 INFO L87 Difference]: Start difference. First operand 2464 states and 2485 transitions. Second operand 49 states. [2018-10-14 16:35:42,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:35:42,582 INFO L93 Difference]: Finished difference Result 2628 states and 2650 transitions. [2018-10-14 16:35:42,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 256 states. [2018-10-14 16:35:42,583 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 2404 [2018-10-14 16:35:42,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:35:42,590 INFO L225 Difference]: With dead ends: 2628 [2018-10-14 16:35:42,591 INFO L226 Difference]: Without dead ends: 2628 [2018-10-14 16:35:42,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40193 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=18668, Invalid=71632, Unknown=0, NotChecked=0, Total=90300 [2018-10-14 16:35:42,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2628 states. [2018-10-14 16:35:42,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2628 to 2609. [2018-10-14 16:35:42,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2609 states. [2018-10-14 16:35:42,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2609 states to 2609 states and 2631 transitions. [2018-10-14 16:35:42,614 INFO L78 Accepts]: Start accepts. Automaton has 2609 states and 2631 transitions. Word has length 2404 [2018-10-14 16:35:42,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:35:42,615 INFO L481 AbstractCegarLoop]: Abstraction has 2609 states and 2631 transitions. [2018-10-14 16:35:42,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-14 16:35:42,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 2631 transitions. [2018-10-14 16:35:42,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2550 [2018-10-14 16:35:42,648 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:35:42,649 INFO L375 BasicCegarLoop]: trace histogram [135, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 21, 21, 21, 21, 21, 21, 21, 21, 21, 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, 1, 1, 1, 1, 1] [2018-10-14 16:35:42,649 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:35:42,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:35:42,650 INFO L82 PathProgramCache]: Analyzing trace with hash -733015927, now seen corresponding path program 35 times [2018-10-14 16:35:42,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:35:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:35:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 141563 backedges. 106403 proven. 11060 refuted. 0 times theorem prover too weak. 24100 trivial. 0 not checked. [2018-10-14 16:35:47,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:35:47,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-14 16:35:47,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-14 16:35:47,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-14 16:35:47,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=1953, Unknown=0, NotChecked=0, Total=2256 [2018-10-14 16:35:47,492 INFO L87 Difference]: Start difference. First operand 2609 states and 2631 transitions. Second operand 48 states. [2018-10-14 16:35:51,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:35:51,510 INFO L93 Difference]: Finished difference Result 2843 states and 2862 transitions. [2018-10-14 16:35:51,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-14 16:35:51,510 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 2549 [2018-10-14 16:35:51,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:35:51,516 INFO L225 Difference]: With dead ends: 2843 [2018-10-14 16:35:51,516 INFO L226 Difference]: Without dead ends: 2843 [2018-10-14 16:35:51,517 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2388 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1956, Invalid=8346, Unknown=0, NotChecked=0, Total=10302 [2018-10-14 16:35:51,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2018-10-14 16:35:51,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 2729. [2018-10-14 16:35:51,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2729 states. [2018-10-14 16:35:51,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2729 states to 2729 states and 2752 transitions. [2018-10-14 16:35:51,533 INFO L78 Accepts]: Start accepts. Automaton has 2729 states and 2752 transitions. Word has length 2549 [2018-10-14 16:35:51,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:35:51,534 INFO L481 AbstractCegarLoop]: Abstraction has 2729 states and 2752 transitions. [2018-10-14 16:35:51,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-14 16:35:51,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2729 states and 2752 transitions. [2018-10-14 16:35:51,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2655 [2018-10-14 16:35:51,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:35:51,572 INFO L375 BasicCegarLoop]: trace histogram [142, 141, 141, 141, 141, 141, 141, 141, 141, 141, 141, 141, 141, 141, 141, 21, 21, 21, 21, 21, 21, 21, 21, 21, 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, 1, 1, 1, 1, 1] [2018-10-14 16:35:51,572 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:35:51,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:35:51,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1429207380, now seen corresponding path program 36 times [2018-10-14 16:35:51,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:35:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:35:55,537 INFO L134 CoverageAnalysis]: Checked inductivity of 156102 backedges. 50741 proven. 2566 refuted. 0 times theorem prover too weak. 102795 trivial. 0 not checked. [2018-10-14 16:35:55,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:35:55,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-14 16:35:55,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-14 16:35:55,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-14 16:35:55,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2018-10-14 16:35:55,539 INFO L87 Difference]: Start difference. First operand 2729 states and 2752 transitions. Second operand 30 states. [2018-10-14 16:35:57,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:35:57,051 INFO L93 Difference]: Finished difference Result 2748 states and 2769 transitions. [2018-10-14 16:35:57,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-14 16:35:57,052 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 2654 [2018-10-14 16:35:57,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:35:57,056 INFO L225 Difference]: With dead ends: 2748 [2018-10-14 16:35:57,057 INFO L226 Difference]: Without dead ends: 2748 [2018-10-14 16:35:57,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=925, Invalid=3905, Unknown=0, NotChecked=0, Total=4830 [2018-10-14 16:35:57,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2748 states. [2018-10-14 16:35:57,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2748 to 2744. [2018-10-14 16:35:57,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2744 states. [2018-10-14 16:35:57,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2744 states to 2744 states and 2767 transitions. [2018-10-14 16:35:57,074 INFO L78 Accepts]: Start accepts. Automaton has 2744 states and 2767 transitions. Word has length 2654 [2018-10-14 16:35:57,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:35:57,074 INFO L481 AbstractCegarLoop]: Abstraction has 2744 states and 2767 transitions. [2018-10-14 16:35:57,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-14 16:35:57,075 INFO L276 IsEmpty]: Start isEmpty. Operand 2744 states and 2767 transitions. [2018-10-14 16:35:57,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2670 [2018-10-14 16:35:57,117 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:35:57,118 INFO L375 BasicCegarLoop]: trace histogram [143, 142, 142, 142, 142, 142, 142, 142, 142, 142, 142, 142, 142, 142, 142, 21, 21, 21, 21, 21, 21, 21, 21, 21, 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, 1, 1, 1, 1, 1] [2018-10-14 16:35:57,118 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:35:57,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:35:57,119 INFO L82 PathProgramCache]: Analyzing trace with hash 280523025, now seen corresponding path program 37 times [2018-10-14 16:35:57,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:35:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:36:02,543 INFO L134 CoverageAnalysis]: Checked inductivity of 158239 backedges. 43 proven. 150942 refuted. 0 times theorem prover too weak. 7254 trivial. 0 not checked. [2018-10-14 16:36:02,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:36:02,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-14 16:36:02,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-14 16:36:02,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-14 16:36:02,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=1853, Unknown=0, NotChecked=0, Total=2352 [2018-10-14 16:36:02,546 INFO L87 Difference]: Start difference. First operand 2744 states and 2767 transitions. Second operand 49 states. [2018-10-14 16:36:10,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:36:10,697 INFO L93 Difference]: Finished difference Result 2923 states and 2947 transitions. [2018-10-14 16:36:10,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2018-10-14 16:36:10,697 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 2669 [2018-10-14 16:36:10,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:36:10,704 INFO L225 Difference]: With dead ends: 2923 [2018-10-14 16:36:10,704 INFO L226 Difference]: Without dead ends: 2923 [2018-10-14 16:36:10,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27086 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=14208, Invalid=51072, Unknown=0, NotChecked=0, Total=65280 [2018-10-14 16:36:10,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2018-10-14 16:36:10,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 2904. [2018-10-14 16:36:10,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2904 states. [2018-10-14 16:36:10,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2904 states to 2904 states and 2928 transitions. [2018-10-14 16:36:10,730 INFO L78 Accepts]: Start accepts. Automaton has 2904 states and 2928 transitions. Word has length 2669 [2018-10-14 16:36:10,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:36:10,732 INFO L481 AbstractCegarLoop]: Abstraction has 2904 states and 2928 transitions. [2018-10-14 16:36:10,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-14 16:36:10,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2904 states and 2928 transitions. [2018-10-14 16:36:10,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2830 [2018-10-14 16:36:10,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:36:10,783 INFO L375 BasicCegarLoop]: trace histogram [152, 151, 151, 151, 151, 151, 151, 151, 151, 151, 151, 151, 151, 151, 151, 22, 22, 22, 22, 22, 22, 22, 22, 22, 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, 1, 1, 1, 1, 1] [2018-10-14 16:36:10,783 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:36:10,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:36:10,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1448773562, now seen corresponding path program 38 times [2018-10-14 16:36:10,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:36:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:36:16,541 INFO L134 CoverageAnalysis]: Checked inductivity of 178808 backedges. 0 proven. 171008 refuted. 0 times theorem prover too weak. 7800 trivial. 0 not checked. [2018-10-14 16:36:16,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:36:16,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-14 16:36:16,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-14 16:36:16,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-14 16:36:16,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=541, Invalid=2009, Unknown=0, NotChecked=0, Total=2550 [2018-10-14 16:36:16,543 INFO L87 Difference]: Start difference. First operand 2904 states and 2928 transitions. Second operand 51 states. [2018-10-14 16:36:25,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:36:25,930 INFO L93 Difference]: Finished difference Result 3083 states and 3108 transitions. [2018-10-14 16:36:25,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 225 states. [2018-10-14 16:36:25,931 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 2829 [2018-10-14 16:36:25,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:36:25,938 INFO L225 Difference]: With dead ends: 3083 [2018-10-14 16:36:25,938 INFO L226 Difference]: Without dead ends: 3083 [2018-10-14 16:36:25,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29877 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=14474, Invalid=58696, Unknown=0, NotChecked=0, Total=73170 [2018-10-14 16:36:25,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2018-10-14 16:36:25,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 3064. [2018-10-14 16:36:25,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3064 states. [2018-10-14 16:36:25,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3064 states to 3064 states and 3089 transitions. [2018-10-14 16:36:25,961 INFO L78 Accepts]: Start accepts. Automaton has 3064 states and 3089 transitions. Word has length 2829 [2018-10-14 16:36:25,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:36:25,963 INFO L481 AbstractCegarLoop]: Abstraction has 3064 states and 3089 transitions. [2018-10-14 16:36:25,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-14 16:36:25,963 INFO L276 IsEmpty]: Start isEmpty. Operand 3064 states and 3089 transitions. [2018-10-14 16:36:26,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2990 [2018-10-14 16:36:26,022 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:36:26,024 INFO L375 BasicCegarLoop]: trace histogram [161, 160, 160, 160, 160, 160, 160, 160, 160, 160, 160, 160, 160, 160, 160, 23, 23, 23, 23, 23, 23, 23, 23, 23, 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, 1, 1, 1, 1, 1] [2018-10-14 16:36:26,024 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:36:26,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:36:26,025 INFO L82 PathProgramCache]: Analyzing trace with hash -2055460253, now seen corresponding path program 39 times [2018-10-14 16:36:26,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:36:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:36:32,697 INFO L134 CoverageAnalysis]: Checked inductivity of 200635 backedges. 0 proven. 192286 refuted. 0 times theorem prover too weak. 8349 trivial. 0 not checked. [2018-10-14 16:36:32,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:36:32,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-14 16:36:32,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-14 16:36:32,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-14 16:36:32,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=588, Invalid=2168, Unknown=0, NotChecked=0, Total=2756 [2018-10-14 16:36:32,699 INFO L87 Difference]: Start difference. First operand 3064 states and 3089 transitions. Second operand 53 states. [2018-10-14 16:36:42,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:36:42,974 INFO L93 Difference]: Finished difference Result 3243 states and 3269 transitions. [2018-10-14 16:36:42,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2018-10-14 16:36:42,975 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 2989 [2018-10-14 16:36:42,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:36:42,981 INFO L225 Difference]: With dead ends: 3243 [2018-10-14 16:36:42,981 INFO L226 Difference]: Without dead ends: 3243 [2018-10-14 16:36:42,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32673 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=15753, Invalid=64053, Unknown=0, NotChecked=0, Total=79806 [2018-10-14 16:36:42,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3243 states. [2018-10-14 16:36:43,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3243 to 3224. [2018-10-14 16:36:43,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3224 states. [2018-10-14 16:36:43,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3224 states to 3224 states and 3250 transitions. [2018-10-14 16:36:43,008 INFO L78 Accepts]: Start accepts. Automaton has 3224 states and 3250 transitions. Word has length 2989 [2018-10-14 16:36:43,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:36:43,009 INFO L481 AbstractCegarLoop]: Abstraction has 3224 states and 3250 transitions. [2018-10-14 16:36:43,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-14 16:36:43,009 INFO L276 IsEmpty]: Start isEmpty. Operand 3224 states and 3250 transitions. [2018-10-14 16:36:43,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3150 [2018-10-14 16:36:43,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:36:43,082 INFO L375 BasicCegarLoop]: trace histogram [170, 169, 169, 169, 169, 169, 169, 169, 169, 169, 169, 169, 169, 169, 169, 24, 24, 24, 24, 24, 24, 24, 24, 24, 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, 1, 1, 1, 1, 1] [2018-10-14 16:36:43,083 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:36:43,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:36:43,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1479366924, now seen corresponding path program 40 times [2018-10-14 16:36:43,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:36:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:36:50,755 INFO L134 CoverageAnalysis]: Checked inductivity of 223720 backedges. 43 proven. 214776 refuted. 0 times theorem prover too weak. 8901 trivial. 0 not checked. [2018-10-14 16:36:50,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:36:50,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-14 16:36:50,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-14 16:36:50,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-14 16:36:50,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=2330, Unknown=0, NotChecked=0, Total=2970 [2018-10-14 16:36:50,758 INFO L87 Difference]: Start difference. First operand 3224 states and 3250 transitions. Second operand 55 states. [2018-10-14 16:37:00,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:37:00,917 INFO L93 Difference]: Finished difference Result 3403 states and 3430 transitions. [2018-10-14 16:37:00,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 241 states. [2018-10-14 16:37:00,918 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 3149 [2018-10-14 16:37:00,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:37:00,922 INFO L225 Difference]: With dead ends: 3403 [2018-10-14 16:37:00,922 INFO L226 Difference]: Without dead ends: 3403 [2018-10-14 16:37:00,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35564 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=18363, Invalid=66609, Unknown=0, NotChecked=0, Total=84972 [2018-10-14 16:37:00,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2018-10-14 16:37:00,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 3384. [2018-10-14 16:37:00,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3384 states. [2018-10-14 16:37:00,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3384 states to 3384 states and 3411 transitions. [2018-10-14 16:37:00,955 INFO L78 Accepts]: Start accepts. Automaton has 3384 states and 3411 transitions. Word has length 3149 [2018-10-14 16:37:00,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:37:00,956 INFO L481 AbstractCegarLoop]: Abstraction has 3384 states and 3411 transitions. [2018-10-14 16:37:00,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-14 16:37:00,957 INFO L276 IsEmpty]: Start isEmpty. Operand 3384 states and 3411 transitions. [2018-10-14 16:37:01,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3310 [2018-10-14 16:37:01,035 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:37:01,036 INFO L375 BasicCegarLoop]: trace histogram [179, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 25, 25, 25, 25, 25, 25, 25, 25, 25, 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, 1, 1, 1, 1, 1] [2018-10-14 16:37:01,036 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:37:01,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:37:01,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1216222133, now seen corresponding path program 41 times [2018-10-14 16:37:01,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:37:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:37:09,691 INFO L134 CoverageAnalysis]: Checked inductivity of 248063 backedges. 0 proven. 238647 refuted. 0 times theorem prover too weak. 9416 trivial. 0 not checked. [2018-10-14 16:37:09,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:37:09,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-14 16:37:09,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-14 16:37:09,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-14 16:37:09,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=692, Invalid=2730, Unknown=0, NotChecked=0, Total=3422 [2018-10-14 16:37:09,694 INFO L87 Difference]: Start difference. First operand 3384 states and 3411 transitions. Second operand 59 states. [2018-10-14 16:37:16,679 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2018-10-14 16:37:29,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:37:29,059 INFO L93 Difference]: Finished difference Result 3563 states and 3591 transitions. [2018-10-14 16:37:29,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 352 states. [2018-10-14 16:37:29,060 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 3309 [2018-10-14 16:37:29,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:37:29,065 INFO L225 Difference]: With dead ends: 3563 [2018-10-14 16:37:29,065 INFO L226 Difference]: Without dead ends: 3563 [2018-10-14 16:37:29,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 403 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73269 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=29268, Invalid=134352, Unknown=0, NotChecked=0, Total=163620 [2018-10-14 16:37:29,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3563 states. [2018-10-14 16:37:29,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3563 to 3544. [2018-10-14 16:37:29,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3544 states. [2018-10-14 16:37:29,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3544 states to 3544 states and 3572 transitions. [2018-10-14 16:37:29,100 INFO L78 Accepts]: Start accepts. Automaton has 3544 states and 3572 transitions. Word has length 3309 [2018-10-14 16:37:29,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:37:29,102 INFO L481 AbstractCegarLoop]: Abstraction has 3544 states and 3572 transitions. [2018-10-14 16:37:29,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-14 16:37:29,102 INFO L276 IsEmpty]: Start isEmpty. Operand 3544 states and 3572 transitions. [2018-10-14 16:37:29,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3470 [2018-10-14 16:37:29,321 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:37:29,322 INFO L375 BasicCegarLoop]: trace histogram [188, 187, 187, 187, 187, 187, 187, 187, 187, 187, 187, 187, 187, 187, 187, 26, 26, 26, 26, 26, 26, 26, 26, 26, 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, 1, 1, 1, 1, 1] [2018-10-14 16:37:29,322 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:37:29,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:37:29,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1870767522, now seen corresponding path program 42 times [2018-10-14 16:37:29,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:37:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:37:38,695 INFO L134 CoverageAnalysis]: Checked inductivity of 273664 backedges. 0 proven. 263668 refuted. 0 times theorem prover too weak. 9996 trivial. 0 not checked. [2018-10-14 16:37:38,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:37:38,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-14 16:37:38,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-14 16:37:38,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-14 16:37:38,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=2681, Unknown=0, NotChecked=0, Total=3422 [2018-10-14 16:37:38,697 INFO L87 Difference]: Start difference. First operand 3544 states and 3572 transitions. Second operand 59 states. [2018-10-14 16:37:50,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:37:50,982 INFO L93 Difference]: Finished difference Result 3723 states and 3752 transitions. [2018-10-14 16:37:50,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 265 states. [2018-10-14 16:37:50,983 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 3469 [2018-10-14 16:37:50,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:37:50,987 INFO L225 Difference]: With dead ends: 3723 [2018-10-14 16:37:50,987 INFO L226 Difference]: Without dead ends: 3723 [2018-10-14 16:37:50,991 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41811 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=19914, Invalid=81528, Unknown=0, NotChecked=0, Total=101442 [2018-10-14 16:37:50,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2018-10-14 16:37:51,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3704. [2018-10-14 16:37:51,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3704 states. [2018-10-14 16:37:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3704 states to 3704 states and 3733 transitions. [2018-10-14 16:37:51,009 INFO L78 Accepts]: Start accepts. Automaton has 3704 states and 3733 transitions. Word has length 3469 [2018-10-14 16:37:51,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:37:51,010 INFO L481 AbstractCegarLoop]: Abstraction has 3704 states and 3733 transitions. [2018-10-14 16:37:51,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-14 16:37:51,010 INFO L276 IsEmpty]: Start isEmpty. Operand 3704 states and 3733 transitions. [2018-10-14 16:37:51,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3630 [2018-10-14 16:37:51,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:37:51,076 INFO L375 BasicCegarLoop]: trace histogram [197, 196, 196, 196, 196, 196, 196, 196, 196, 196, 196, 196, 196, 196, 196, 27, 27, 27, 27, 27, 27, 27, 27, 27, 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, 1, 1, 1, 1, 1] [2018-10-14 16:37:51,076 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:37:51,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:37:51,077 INFO L82 PathProgramCache]: Analyzing trace with hash 708717831, now seen corresponding path program 43 times [2018-10-14 16:37:51,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:37:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:38:00,940 INFO L134 CoverageAnalysis]: Checked inductivity of 300523 backedges. 0 proven. 289978 refuted. 0 times theorem prover too weak. 10545 trivial. 0 not checked. [2018-10-14 16:38:00,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:38:00,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-14 16:38:00,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-14 16:38:00,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-14 16:38:00,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=796, Invalid=2864, Unknown=0, NotChecked=0, Total=3660 [2018-10-14 16:38:00,943 INFO L87 Difference]: Start difference. First operand 3704 states and 3733 transitions. Second operand 61 states. [2018-10-14 16:38:14,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:38:14,827 INFO L93 Difference]: Finished difference Result 3883 states and 3913 transitions. [2018-10-14 16:38:14,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 275 states. [2018-10-14 16:38:14,828 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 3629 [2018-10-14 16:38:14,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:38:14,833 INFO L225 Difference]: With dead ends: 3883 [2018-10-14 16:38:14,833 INFO L226 Difference]: Without dead ends: 3883 [2018-10-14 16:38:14,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45107 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=21409, Invalid=87821, Unknown=0, NotChecked=0, Total=109230 [2018-10-14 16:38:14,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3883 states. [2018-10-14 16:38:14,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3883 to 3864. [2018-10-14 16:38:14,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3864 states. [2018-10-14 16:38:14,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3864 states to 3864 states and 3894 transitions. [2018-10-14 16:38:14,856 INFO L78 Accepts]: Start accepts. Automaton has 3864 states and 3894 transitions. Word has length 3629 [2018-10-14 16:38:14,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:38:14,858 INFO L481 AbstractCegarLoop]: Abstraction has 3864 states and 3894 transitions. [2018-10-14 16:38:14,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-14 16:38:14,858 INFO L276 IsEmpty]: Start isEmpty. Operand 3864 states and 3894 transitions. [2018-10-14 16:38:14,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3790 [2018-10-14 16:38:14,930 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:38:14,931 INFO L375 BasicCegarLoop]: trace histogram [206, 205, 205, 205, 205, 205, 205, 205, 205, 205, 205, 205, 205, 205, 205, 28, 28, 28, 28, 28, 28, 28, 28, 28, 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, 1, 1, 1, 1, 1] [2018-10-14 16:38:14,932 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:38:14,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:38:14,933 INFO L82 PathProgramCache]: Analyzing trace with hash -808612944, now seen corresponding path program 44 times [2018-10-14 16:38:14,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:38:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:38:25,801 INFO L134 CoverageAnalysis]: Checked inductivity of 328640 backedges. 0 proven. 317546 refuted. 0 times theorem prover too weak. 11094 trivial. 0 not checked. [2018-10-14 16:38:25,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:38:25,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-14 16:38:25,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-14 16:38:25,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-14 16:38:25,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=853, Invalid=3053, Unknown=0, NotChecked=0, Total=3906 [2018-10-14 16:38:25,804 INFO L87 Difference]: Start difference. First operand 3864 states and 3894 transitions. Second operand 63 states. [2018-10-14 16:38:39,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:38:39,814 INFO L93 Difference]: Finished difference Result 4043 states and 4074 transitions. [2018-10-14 16:38:39,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 285 states. [2018-10-14 16:38:39,815 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 3789 [2018-10-14 16:38:39,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:38:39,820 INFO L225 Difference]: With dead ends: 4043 [2018-10-14 16:38:39,820 INFO L226 Difference]: Without dead ends: 4043 [2018-10-14 16:38:39,827 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 341 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48528 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=22958, Invalid=94348, Unknown=0, NotChecked=0, Total=117306 [2018-10-14 16:38:39,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4043 states. [2018-10-14 16:38:39,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4043 to 4024. [2018-10-14 16:38:39,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4024 states. [2018-10-14 16:38:39,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4024 states to 4024 states and 4055 transitions. [2018-10-14 16:38:39,847 INFO L78 Accepts]: Start accepts. Automaton has 4024 states and 4055 transitions. Word has length 3789 [2018-10-14 16:38:39,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:38:39,848 INFO L481 AbstractCegarLoop]: Abstraction has 4024 states and 4055 transitions. [2018-10-14 16:38:39,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-14 16:38:39,848 INFO L276 IsEmpty]: Start isEmpty. Operand 4024 states and 4055 transitions. [2018-10-14 16:38:39,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3950 [2018-10-14 16:38:39,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:38:39,925 INFO L375 BasicCegarLoop]: trace histogram [215, 214, 214, 214, 214, 214, 214, 214, 214, 214, 214, 214, 214, 214, 214, 29, 29, 29, 29, 29, 29, 29, 29, 29, 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, 1, 1, 1, 1, 1] [2018-10-14 16:38:39,925 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:38:39,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:38:39,926 INFO L82 PathProgramCache]: Analyzing trace with hash -79923623, now seen corresponding path program 45 times [2018-10-14 16:38:39,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:38:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:38:51,695 INFO L134 CoverageAnalysis]: Checked inductivity of 358015 backedges. 0 proven. 346403 refuted. 0 times theorem prover too weak. 11612 trivial. 0 not checked. [2018-10-14 16:38:51,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:38:51,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-14 16:38:51,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-14 16:38:51,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-14 16:38:51,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=916, Invalid=3506, Unknown=0, NotChecked=0, Total=4422 [2018-10-14 16:38:51,699 INFO L87 Difference]: Start difference. First operand 4024 states and 4055 transitions. Second operand 67 states. [2018-10-14 16:39:16,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:39:16,109 INFO L93 Difference]: Finished difference Result 4203 states and 4235 transitions. [2018-10-14 16:39:16,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 408 states. [2018-10-14 16:39:16,110 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 3949 [2018-10-14 16:39:16,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:39:16,115 INFO L225 Difference]: With dead ends: 4203 [2018-10-14 16:39:16,115 INFO L226 Difference]: Without dead ends: 4203 [2018-10-14 16:39:16,119 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 467 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99191 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=39118, Invalid=180374, Unknown=0, NotChecked=0, Total=219492 [2018-10-14 16:39:16,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4203 states. [2018-10-14 16:39:16,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4203 to 4184. [2018-10-14 16:39:16,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4184 states. [2018-10-14 16:39:16,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4184 states to 4184 states and 4216 transitions. [2018-10-14 16:39:16,140 INFO L78 Accepts]: Start accepts. Automaton has 4184 states and 4216 transitions. Word has length 3949 [2018-10-14 16:39:16,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:39:16,142 INFO L481 AbstractCegarLoop]: Abstraction has 4184 states and 4216 transitions. [2018-10-14 16:39:16,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-14 16:39:16,142 INFO L276 IsEmpty]: Start isEmpty. Operand 4184 states and 4216 transitions. [2018-10-14 16:39:16,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4110 [2018-10-14 16:39:16,222 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:39:16,222 INFO L375 BasicCegarLoop]: trace histogram [224, 223, 223, 223, 223, 223, 223, 223, 223, 223, 223, 223, 223, 223, 223, 30, 30, 30, 30, 30, 30, 30, 30, 30, 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, 1, 1, 1, 1, 1] [2018-10-14 16:39:16,223 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:39:16,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:39:16,223 INFO L82 PathProgramCache]: Analyzing trace with hash -426054398, now seen corresponding path program 46 times [2018-10-14 16:39:16,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:39:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:39:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 388648 backedges. 0 proven. 376456 refuted. 0 times theorem prover too weak. 12192 trivial. 0 not checked. [2018-10-14 16:39:28,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:39:28,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-14 16:39:28,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-14 16:39:28,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-14 16:39:28,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=973, Invalid=3449, Unknown=0, NotChecked=0, Total=4422 [2018-10-14 16:39:28,576 INFO L87 Difference]: Start difference. First operand 4184 states and 4216 transitions. Second operand 67 states. [2018-10-14 16:39:44,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:39:44,438 INFO L93 Difference]: Finished difference Result 4363 states and 4396 transitions. [2018-10-14 16:39:44,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 305 states. [2018-10-14 16:39:44,439 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 4109 [2018-10-14 16:39:44,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:39:44,443 INFO L225 Difference]: With dead ends: 4363 [2018-10-14 16:39:44,443 INFO L226 Difference]: Without dead ends: 4363 [2018-10-14 16:39:44,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 365 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55745 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=26218, Invalid=108104, Unknown=0, NotChecked=0, Total=134322 [2018-10-14 16:39:44,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4363 states. [2018-10-14 16:39:44,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4363 to 4344. [2018-10-14 16:39:44,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4344 states. [2018-10-14 16:39:44,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4344 states to 4344 states and 4377 transitions. [2018-10-14 16:39:44,466 INFO L78 Accepts]: Start accepts. Automaton has 4344 states and 4377 transitions. Word has length 4109 [2018-10-14 16:39:44,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:39:44,467 INFO L481 AbstractCegarLoop]: Abstraction has 4344 states and 4377 transitions. [2018-10-14 16:39:44,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-14 16:39:44,468 INFO L276 IsEmpty]: Start isEmpty. Operand 4344 states and 4377 transitions. [2018-10-14 16:39:44,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4270 [2018-10-14 16:39:44,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:39:44,554 INFO L375 BasicCegarLoop]: trace histogram [233, 232, 232, 232, 232, 232, 232, 232, 232, 232, 232, 232, 232, 232, 232, 31, 31, 31, 31, 31, 31, 31, 31, 31, 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, 1, 1, 1, 1, 1] [2018-10-14 16:39:44,554 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:39:44,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:39:44,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1946619989, now seen corresponding path program 47 times [2018-10-14 16:39:44,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:39:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:39:57,408 INFO L134 CoverageAnalysis]: Checked inductivity of 420539 backedges. 43 proven. 407752 refuted. 0 times theorem prover too weak. 12744 trivial. 0 not checked. [2018-10-14 16:39:57,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:39:57,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-14 16:39:57,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-14 16:39:57,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-14 16:39:57,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1039, Invalid=3653, Unknown=0, NotChecked=0, Total=4692 [2018-10-14 16:39:57,410 INFO L87 Difference]: Start difference. First operand 4344 states and 4377 transitions. Second operand 69 states. [2018-10-14 16:40:12,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:40:12,741 INFO L93 Difference]: Finished difference Result 4523 states and 4557 transitions. [2018-10-14 16:40:12,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 311 states. [2018-10-14 16:40:12,741 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 4269 [2018-10-14 16:40:12,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:40:12,746 INFO L225 Difference]: With dead ends: 4523 [2018-10-14 16:40:12,746 INFO L226 Difference]: Without dead ends: 4523 [2018-10-14 16:40:12,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 374 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59826 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=30123, Invalid=110877, Unknown=0, NotChecked=0, Total=141000 [2018-10-14 16:40:12,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4523 states. [2018-10-14 16:40:12,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4523 to 4504. [2018-10-14 16:40:12,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4504 states. [2018-10-14 16:40:12,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4504 states to 4504 states and 4538 transitions. [2018-10-14 16:40:12,774 INFO L78 Accepts]: Start accepts. Automaton has 4504 states and 4538 transitions. Word has length 4269 [2018-10-14 16:40:12,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:40:12,776 INFO L481 AbstractCegarLoop]: Abstraction has 4504 states and 4538 transitions. [2018-10-14 16:40:12,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-14 16:40:12,776 INFO L276 IsEmpty]: Start isEmpty. Operand 4504 states and 4538 transitions. [2018-10-14 16:40:12,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4430 [2018-10-14 16:40:12,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:40:12,871 INFO L375 BasicCegarLoop]: trace histogram [242, 241, 241, 241, 241, 241, 241, 241, 241, 241, 241, 241, 241, 241, 241, 32, 32, 32, 32, 32, 32, 32, 32, 32, 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, 1, 1, 1, 1, 1] [2018-10-14 16:40:12,871 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:40:12,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:40:12,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1520009644, now seen corresponding path program 48 times [2018-10-14 16:40:12,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:40:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:40:28,286 INFO L134 CoverageAnalysis]: Checked inductivity of 453688 backedges. 43 proven. 440352 refuted. 0 times theorem prover too weak. 13293 trivial. 0 not checked. [2018-10-14 16:40:28,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:40:28,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-14 16:40:28,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-14 16:40:28,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-14 16:40:28,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1104, Invalid=3866, Unknown=0, NotChecked=0, Total=4970 [2018-10-14 16:40:28,288 INFO L87 Difference]: Start difference. First operand 4504 states and 4538 transitions. Second operand 71 states. [2018-10-14 16:40:44,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:40:44,231 INFO L93 Difference]: Finished difference Result 4518 states and 4548 transitions. [2018-10-14 16:40:44,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 320 states. [2018-10-14 16:40:44,231 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 4429 [2018-10-14 16:40:44,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:40:44,235 INFO L225 Difference]: With dead ends: 4518 [2018-10-14 16:40:44,235 INFO L226 Difference]: Without dead ends: 0 [2018-10-14 16:40:44,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63804 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=32039, Invalid=118117, Unknown=0, NotChecked=0, Total=150156 [2018-10-14 16:40:44,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-14 16:40:44,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-14 16:40:44,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-14 16:40:44,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-14 16:40:44,242 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4429 [2018-10-14 16:40:44,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:40:44,242 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-14 16:40:44,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-14 16:40:44,242 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-14 16:40:44,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-14 16:40:44,247 INFO L202 PluginConnector]: Adding new model ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 04:40:44 BoogieIcfgContainer [2018-10-14 16:40:44,248 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-14 16:40:44,249 INFO L168 Benchmark]: Toolchain (without parser) took 461123.01 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -730.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-14 16:40:44,251 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-14 16:40:44,251 INFO L168 Benchmark]: Boogie Preprocessor took 72.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-14 16:40:44,251 INFO L168 Benchmark]: RCFGBuilder took 602.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-14 16:40:44,252 INFO L168 Benchmark]: TraceAbstraction took 460444.39 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -762.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-14 16:40:44,255 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 72.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 602.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 460444.39 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -762.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 138]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 70 locations, 1 error locations. SAFE Result, 460.3s OverallTime, 50 OverallIterations, 242 TraceHistogramMax, 273.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5634 SDtfs, 76806 SDslu, 95428 SDs, 0 SdLazy, 39511 SolverSat, 7288 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 34.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7636 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 7535 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833415 ImplicationChecksByTransitivity, 268.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4504occurred in iteration=49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 50 MinimizatonAttempts, 1263 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 7.2s SatisfiabilityAnalysisTime, 57.8s InterpolantComputationTime, 77050 NumberOfCodeBlocks, 77050 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 77000 ConstructedInterpolants, 0 QuantifiedInterpolants, 609068050 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 50 InterpolantComputations, 1 PerfectInterpolantSequences, 547967/4663243 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-14_16-40-44-267.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-14_16-40-44-267.csv Received shutdown request...