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/20051113-1.c_false-valid-memtrack.i_31.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 15:10:52,819 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 15:10:52,821 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 15:10:52,834 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 15:10:52,834 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 15:10:52,835 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 15:10:52,837 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 15:10:52,839 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 15:10:52,840 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 15:10:52,841 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 15:10:52,842 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 15:10:52,842 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 15:10:52,843 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 15:10:52,844 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 15:10:52,846 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 15:10:52,846 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 15:10:52,847 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 15:10:52,849 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 15:10:52,852 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 15:10:52,853 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 15:10:52,855 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 15:10:52,856 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 15:10:52,858 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 15:10:52,859 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 15:10:52,859 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 15:10:52,860 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 15:10:52,861 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 15:10:52,862 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 15:10:52,864 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 15:10:52,867 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 15:10:52,867 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 15:10:52,870 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 15:10:52,870 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 15:10:52,870 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 15:10:52,871 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 15:10:52,872 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 15:10:52,872 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-10 15:10:52,892 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 15:10:52,893 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 15:10:52,894 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 15:10:52,894 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 15:10:52,894 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 15:10:52,895 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 15:10:52,896 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 15:10:52,896 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 15:10:52,896 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 15:10:52,896 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 15:10:52,896 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 15:10:52,897 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 15:10:52,897 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 15:10:52,898 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 15:10:52,899 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 15:10:52,963 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 15:10:52,983 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 15:10:52,991 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 15:10:52,992 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 15:10:52,993 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 15:10:52,994 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_31.bpl [2018-10-10 15:10:52,994 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_31.bpl' [2018-10-10 15:10:53,092 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 15:10:53,094 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-10 15:10:53,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 15:10:53,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 15:10:53,095 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 15:10:53,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_31.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/1) ... [2018-10-10 15:10:53,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_31.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/1) ... [2018-10-10 15:10:53,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_31.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/1) ... [2018-10-10 15:10:53,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_31.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/1) ... [2018-10-10 15:10:53,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_31.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/1) ... [2018-10-10 15:10:53,167 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_31.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/1) ... [2018-10-10 15:10:53,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_31.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/1) ... [2018-10-10 15:10:53,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 15:10:53,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 15:10:53,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 15:10:53,182 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 15:10:53,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "20051113-1.c_false-valid-memtrack.i_31.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-10 15:10:53,259 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 15:10:53,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 15:10:53,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 15:10:54,187 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 15:10:54,188 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_31.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:10:54 BoogieIcfgContainer [2018-10-10 15:10:54,189 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 15:10:54,190 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 15:10:54,190 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 15:10:54,194 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 15:10:54,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_31.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/2) ... [2018-10-10 15:10:54,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49fdb50d and model type 20051113-1.c_false-valid-memtrack.i_31.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 03:10:54, skipping insertion in model container [2018-10-10 15:10:54,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_31.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:10:54" (2/2) ... [2018-10-10 15:10:54,198 INFO L112 eAbstractionObserver]: Analyzing ICFG 20051113-1.c_false-valid-memtrack.i_31.bpl [2018-10-10 15:10:54,208 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 15:10:54,217 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 15:10:54,235 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 15:10:54,265 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 15:10:54,266 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 15:10:54,266 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 15:10:54,266 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 15:10:54,266 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 15:10:54,266 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 15:10:54,267 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 15:10:54,267 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 15:10:54,267 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 15:10:54,290 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states. [2018-10-10 15:10:54,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-10 15:10:54,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:54,306 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:10:54,308 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:54,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:54,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1843383196, now seen corresponding path program 1 times [2018-10-10 15:10:54,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:54,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:10:54,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:10:54,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 15:10:54,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 15:10:54,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 15:10:54,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 15:10:54,749 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 4 states. [2018-10-10 15:10:54,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:54,876 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-10-10 15:10:54,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 15:10:54,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-10-10 15:10:54,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:54,896 INFO L225 Difference]: With dead ends: 129 [2018-10-10 15:10:54,896 INFO L226 Difference]: Without dead ends: 129 [2018-10-10 15:10:54,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 15:10:54,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-10 15:10:54,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2018-10-10 15:10:54,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-10 15:10:54,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-10-10 15:10:54,947 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 123 [2018-10-10 15:10:54,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:54,948 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-10-10 15:10:54,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 15:10:54,949 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-10-10 15:10:54,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-10 15:10:54,951 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:54,952 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:10:54,952 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:54,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:54,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1466239362, now seen corresponding path program 1 times [2018-10-10 15:10:54,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:55,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:10:55,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:55,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-10 15:10:55,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 15:10:55,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 15:10:55,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 15:10:55,206 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 5 states. [2018-10-10 15:10:55,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:55,412 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-10-10 15:10:55,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 15:10:55,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2018-10-10 15:10:55,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:55,417 INFO L225 Difference]: With dead ends: 132 [2018-10-10 15:10:55,418 INFO L226 Difference]: Without dead ends: 132 [2018-10-10 15:10:55,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:10:55,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-10 15:10:55,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-10-10 15:10:55,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-10 15:10:55,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-10-10 15:10:55,432 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 126 [2018-10-10 15:10:55,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:55,432 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-10-10 15:10:55,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 15:10:55,433 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-10-10 15:10:55,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-10 15:10:55,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:55,436 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:10:55,436 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:55,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:55,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1132349532, now seen corresponding path program 2 times [2018-10-10 15:10:55,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:55,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:10:55,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:55,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-10 15:10:55,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 15:10:55,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 15:10:55,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:10:55,623 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 6 states. [2018-10-10 15:10:55,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:55,802 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-10-10 15:10:55,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 15:10:55,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2018-10-10 15:10:55,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:55,808 INFO L225 Difference]: With dead ends: 135 [2018-10-10 15:10:55,808 INFO L226 Difference]: Without dead ends: 135 [2018-10-10 15:10:55,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:10:55,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-10 15:10:55,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2018-10-10 15:10:55,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-10 15:10:55,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-10-10 15:10:55,825 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 129 [2018-10-10 15:10:55,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:55,826 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-10-10 15:10:55,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 15:10:55,826 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-10-10 15:10:55,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-10 15:10:55,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:55,832 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:10:55,833 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:55,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:55,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1091419714, now seen corresponding path program 3 times [2018-10-10 15:10:55,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:56,082 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:10:56,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:56,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-10 15:10:56,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 15:10:56,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 15:10:56,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-10 15:10:56,084 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 7 states. [2018-10-10 15:10:56,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:56,531 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-10-10 15:10:56,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 15:10:56,534 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2018-10-10 15:10:56,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:56,536 INFO L225 Difference]: With dead ends: 138 [2018-10-10 15:10:56,536 INFO L226 Difference]: Without dead ends: 138 [2018-10-10 15:10:56,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:10:56,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-10 15:10:56,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-10-10 15:10:56,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-10 15:10:56,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-10-10 15:10:56,550 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 132 [2018-10-10 15:10:56,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:56,551 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-10-10 15:10:56,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 15:10:56,551 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-10-10 15:10:56,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-10 15:10:56,558 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:56,558 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:10:56,558 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:56,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:56,561 INFO L82 PathProgramCache]: Analyzing trace with hash -469513500, now seen corresponding path program 4 times [2018-10-10 15:10:56,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:57,126 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:10:57,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:57,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 15:10:57,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:10:57,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:10:57,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:10:57,128 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 8 states. [2018-10-10 15:10:57,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:57,501 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-10-10 15:10:57,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 15:10:57,502 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 135 [2018-10-10 15:10:57,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:57,503 INFO L225 Difference]: With dead ends: 141 [2018-10-10 15:10:57,503 INFO L226 Difference]: Without dead ends: 141 [2018-10-10 15:10:57,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:10:57,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-10 15:10:57,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-10-10 15:10:57,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-10 15:10:57,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-10-10 15:10:57,511 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 135 [2018-10-10 15:10:57,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:57,512 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-10-10 15:10:57,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:10:57,512 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-10-10 15:10:57,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-10 15:10:57,514 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:57,515 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:10:57,515 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:57,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:57,515 INFO L82 PathProgramCache]: Analyzing trace with hash -619977982, now seen corresponding path program 5 times [2018-10-10 15:10:57,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:57,768 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:10:57,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:57,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-10 15:10:57,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 15:10:57,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 15:10:57,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-10 15:10:57,770 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 9 states. [2018-10-10 15:10:57,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:57,970 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-10-10 15:10:57,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 15:10:57,973 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 138 [2018-10-10 15:10:57,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:57,974 INFO L225 Difference]: With dead ends: 144 [2018-10-10 15:10:57,975 INFO L226 Difference]: Without dead ends: 144 [2018-10-10 15:10:57,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:10:57,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-10 15:10:57,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2018-10-10 15:10:57,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-10 15:10:57,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-10-10 15:10:57,982 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 138 [2018-10-10 15:10:57,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:57,983 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-10-10 15:10:57,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 15:10:57,983 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-10-10 15:10:57,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-10 15:10:57,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:57,985 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:10:57,986 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:57,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:57,986 INFO L82 PathProgramCache]: Analyzing trace with hash 838495780, now seen corresponding path program 6 times [2018-10-10 15:10:57,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:58,245 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:10:58,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:58,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 15:10:58,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:10:58,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:10:58,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:10:58,247 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 10 states. [2018-10-10 15:10:58,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:58,540 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-10-10 15:10:58,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 15:10:58,541 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 141 [2018-10-10 15:10:58,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:58,542 INFO L225 Difference]: With dead ends: 147 [2018-10-10 15:10:58,542 INFO L226 Difference]: Without dead ends: 147 [2018-10-10 15:10:58,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:10:58,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-10 15:10:58,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-10-10 15:10:58,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-10 15:10:58,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-10-10 15:10:58,558 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 141 [2018-10-10 15:10:58,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:58,559 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-10-10 15:10:58,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:10:58,559 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-10-10 15:10:58,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-10 15:10:58,563 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:58,563 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:10:58,564 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:58,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:58,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1953794110, now seen corresponding path program 7 times [2018-10-10 15:10:58,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:58,878 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:10:58,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:58,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-10 15:10:58,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 15:10:58,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 15:10:58,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-10 15:10:58,881 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 11 states. [2018-10-10 15:10:59,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:59,100 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-10-10 15:10:59,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 15:10:59,107 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 144 [2018-10-10 15:10:59,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:59,108 INFO L225 Difference]: With dead ends: 150 [2018-10-10 15:10:59,109 INFO L226 Difference]: Without dead ends: 150 [2018-10-10 15:10:59,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:10:59,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-10 15:10:59,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-10-10 15:10:59,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-10 15:10:59,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-10-10 15:10:59,114 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 144 [2018-10-10 15:10:59,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:59,115 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-10-10 15:10:59,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 15:10:59,115 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-10-10 15:10:59,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-10 15:10:59,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:59,117 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:10:59,117 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:59,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:59,118 INFO L82 PathProgramCache]: Analyzing trace with hash -2135318172, now seen corresponding path program 8 times [2018-10-10 15:10:59,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:59,411 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:10:59,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:59,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 15:10:59,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 15:10:59,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 15:10:59,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:10:59,431 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 12 states. [2018-10-10 15:10:59,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:59,738 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-10-10 15:10:59,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 15:10:59,739 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 147 [2018-10-10 15:10:59,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:59,740 INFO L225 Difference]: With dead ends: 153 [2018-10-10 15:10:59,740 INFO L226 Difference]: Without dead ends: 153 [2018-10-10 15:10:59,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:10:59,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-10 15:10:59,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2018-10-10 15:10:59,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-10 15:10:59,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-10-10 15:10:59,745 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 147 [2018-10-10 15:10:59,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:59,745 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-10-10 15:10:59,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 15:10:59,745 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-10-10 15:10:59,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-10 15:10:59,747 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:59,747 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:10:59,747 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:59,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:59,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1740143746, now seen corresponding path program 9 times [2018-10-10 15:10:59,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:59,981 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:10:59,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:59,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-10 15:10:59,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 15:10:59,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 15:10:59,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-10 15:10:59,983 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 13 states. [2018-10-10 15:11:00,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:00,197 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-10-10 15:11:00,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 15:11:00,198 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 150 [2018-10-10 15:11:00,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:00,199 INFO L225 Difference]: With dead ends: 156 [2018-10-10 15:11:00,199 INFO L226 Difference]: Without dead ends: 156 [2018-10-10 15:11:00,200 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:11:00,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-10 15:11:00,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2018-10-10 15:11:00,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-10-10 15:11:00,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-10-10 15:11:00,204 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 150 [2018-10-10 15:11:00,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:00,204 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-10-10 15:11:00,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 15:11:00,204 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-10-10 15:11:00,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-10 15:11:00,206 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:00,206 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:00,206 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:00,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:00,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1684708188, now seen corresponding path program 10 times [2018-10-10 15:11:00,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:00,432 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:00,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:00,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 15:11:00,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 15:11:00,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 15:11:00,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:11:00,434 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 14 states. [2018-10-10 15:11:00,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:00,726 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-10-10 15:11:00,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 15:11:00,728 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 153 [2018-10-10 15:11:00,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:00,729 INFO L225 Difference]: With dead ends: 159 [2018-10-10 15:11:00,729 INFO L226 Difference]: Without dead ends: 159 [2018-10-10 15:11:00,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:11:00,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-10 15:11:00,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2018-10-10 15:11:00,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-10 15:11:00,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-10-10 15:11:00,734 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 153 [2018-10-10 15:11:00,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:00,734 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-10-10 15:11:00,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 15:11:00,734 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-10-10 15:11:00,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-10 15:11:00,735 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:00,735 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:00,736 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:00,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:00,736 INFO L82 PathProgramCache]: Analyzing trace with hash -205590206, now seen corresponding path program 11 times [2018-10-10 15:11:00,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:02,183 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:02,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:02,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 15:11:02,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 15:11:02,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 15:11:02,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:11:02,186 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 15 states. [2018-10-10 15:11:02,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:02,628 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-10-10 15:11:02,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 15:11:02,629 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 156 [2018-10-10 15:11:02,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:02,630 INFO L225 Difference]: With dead ends: 162 [2018-10-10 15:11:02,630 INFO L226 Difference]: Without dead ends: 162 [2018-10-10 15:11:02,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:11:02,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-10 15:11:02,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-10-10 15:11:02,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-10 15:11:02,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-10-10 15:11:02,635 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 156 [2018-10-10 15:11:02,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:02,635 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-10-10 15:11:02,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 15:11:02,635 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-10-10 15:11:02,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-10 15:11:02,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:02,636 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:02,636 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:02,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:02,637 INFO L82 PathProgramCache]: Analyzing trace with hash 2128721892, now seen corresponding path program 12 times [2018-10-10 15:11:02,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:02,969 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:02,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:02,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 15:11:02,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 15:11:02,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 15:11:02,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=132, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:11:02,971 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 16 states. [2018-10-10 15:11:03,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:03,341 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-10-10 15:11:03,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 15:11:03,342 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 159 [2018-10-10 15:11:03,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:03,343 INFO L225 Difference]: With dead ends: 165 [2018-10-10 15:11:03,343 INFO L226 Difference]: Without dead ends: 165 [2018-10-10 15:11:03,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:11:03,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-10 15:11:03,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2018-10-10 15:11:03,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-10 15:11:03,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-10-10 15:11:03,349 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 159 [2018-10-10 15:11:03,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:03,349 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-10-10 15:11:03,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 15:11:03,349 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-10-10 15:11:03,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-10 15:11:03,350 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:03,350 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:03,351 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:03,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:03,351 INFO L82 PathProgramCache]: Analyzing trace with hash -490023422, now seen corresponding path program 13 times [2018-10-10 15:11:03,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:04,300 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:04,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:04,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-10 15:11:04,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 15:11:04,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 15:11:04,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=149, Unknown=0, NotChecked=0, Total=272 [2018-10-10 15:11:04,302 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 17 states. [2018-10-10 15:11:04,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:04,614 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-10-10 15:11:04,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 15:11:04,617 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 162 [2018-10-10 15:11:04,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:04,618 INFO L225 Difference]: With dead ends: 168 [2018-10-10 15:11:04,618 INFO L226 Difference]: Without dead ends: 168 [2018-10-10 15:11:04,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:11:04,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-10-10 15:11:04,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2018-10-10 15:11:04,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-10 15:11:04,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-10-10 15:11:04,624 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 162 [2018-10-10 15:11:04,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:04,624 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-10-10 15:11:04,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 15:11:04,624 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-10-10 15:11:04,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-10 15:11:04,626 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:04,626 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:04,626 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:04,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:04,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1745708252, now seen corresponding path program 14 times [2018-10-10 15:11:04,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:05,253 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:05,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:05,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 15:11:05,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 15:11:05,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 15:11:05,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:11:05,255 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 18 states. [2018-10-10 15:11:05,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:05,755 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-10-10 15:11:05,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 15:11:05,755 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 165 [2018-10-10 15:11:05,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:05,756 INFO L225 Difference]: With dead ends: 171 [2018-10-10 15:11:05,756 INFO L226 Difference]: Without dead ends: 171 [2018-10-10 15:11:05,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-10-10 15:11:05,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-10 15:11:05,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2018-10-10 15:11:05,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-10-10 15:11:05,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-10-10 15:11:05,761 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 165 [2018-10-10 15:11:05,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:05,761 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-10-10 15:11:05,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 15:11:05,762 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-10-10 15:11:05,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-10 15:11:05,763 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:05,763 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:05,763 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:05,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:05,763 INFO L82 PathProgramCache]: Analyzing trace with hash -687330622, now seen corresponding path program 15 times [2018-10-10 15:11:05,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:06,279 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:06,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:06,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 15:11:06,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 15:11:06,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 15:11:06,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=186, Unknown=0, NotChecked=0, Total=342 [2018-10-10 15:11:06,281 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 19 states. [2018-10-10 15:11:06,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:06,738 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-10-10 15:11:06,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 15:11:06,739 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 168 [2018-10-10 15:11:06,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:06,740 INFO L225 Difference]: With dead ends: 174 [2018-10-10 15:11:06,740 INFO L226 Difference]: Without dead ends: 174 [2018-10-10 15:11:06,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:11:06,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-10 15:11:06,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2018-10-10 15:11:06,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-10 15:11:06,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-10-10 15:11:06,744 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 168 [2018-10-10 15:11:06,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:06,744 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-10-10 15:11:06,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 15:11:06,745 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-10-10 15:11:06,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-10 15:11:06,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:06,746 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:06,746 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:06,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:06,746 INFO L82 PathProgramCache]: Analyzing trace with hash 85724772, now seen corresponding path program 16 times [2018-10-10 15:11:06,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:07,140 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:07,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:07,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 15:11:07,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 15:11:07,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 15:11:07,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=206, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:11:07,142 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 20 states. [2018-10-10 15:11:07,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:07,518 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-10-10 15:11:07,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 15:11:07,521 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 171 [2018-10-10 15:11:07,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:07,522 INFO L225 Difference]: With dead ends: 177 [2018-10-10 15:11:07,522 INFO L226 Difference]: Without dead ends: 177 [2018-10-10 15:11:07,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:11:07,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-10-10 15:11:07,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-10-10 15:11:07,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-10 15:11:07,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-10-10 15:11:07,527 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 171 [2018-10-10 15:11:07,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:07,527 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-10-10 15:11:07,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 15:11:07,528 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-10-10 15:11:07,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-10 15:11:07,532 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:07,532 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:07,532 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:07,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:07,533 INFO L82 PathProgramCache]: Analyzing trace with hash 564326274, now seen corresponding path program 17 times [2018-10-10 15:11:07,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:08,771 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:08,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:08,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 15:11:08,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 15:11:08,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 15:11:08,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=227, Unknown=0, NotChecked=0, Total=420 [2018-10-10 15:11:08,772 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 21 states. [2018-10-10 15:11:09,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:09,408 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-10-10 15:11:09,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 15:11:09,408 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 174 [2018-10-10 15:11:09,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:09,409 INFO L225 Difference]: With dead ends: 180 [2018-10-10 15:11:09,410 INFO L226 Difference]: Without dead ends: 180 [2018-10-10 15:11:09,411 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 15:11:09,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-10 15:11:09,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2018-10-10 15:11:09,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-10-10 15:11:09,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-10-10 15:11:09,414 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 174 [2018-10-10 15:11:09,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:09,415 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-10-10 15:11:09,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 15:11:09,415 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-10-10 15:11:09,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-10 15:11:09,416 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:09,416 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:09,416 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:09,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:09,417 INFO L82 PathProgramCache]: Analyzing trace with hash -709750364, now seen corresponding path program 18 times [2018-10-10 15:11:09,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:10,218 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:10,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:10,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 15:11:10,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 15:11:10,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 15:11:10,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:11:10,220 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 22 states. [2018-10-10 15:11:10,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:10,669 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-10-10 15:11:10,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 15:11:10,675 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 177 [2018-10-10 15:11:10,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:10,676 INFO L225 Difference]: With dead ends: 183 [2018-10-10 15:11:10,676 INFO L226 Difference]: Without dead ends: 183 [2018-10-10 15:11:10,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:11:10,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-10 15:11:10,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2018-10-10 15:11:10,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-10 15:11:10,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-10-10 15:11:10,681 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 177 [2018-10-10 15:11:10,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:10,682 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-10-10 15:11:10,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 15:11:10,682 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-10-10 15:11:10,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-10 15:11:10,683 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:10,683 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:10,683 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:10,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:10,684 INFO L82 PathProgramCache]: Analyzing trace with hash -2100878270, now seen corresponding path program 19 times [2018-10-10 15:11:10,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:11,298 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:11,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:11,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 15:11:11,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 15:11:11,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 15:11:11,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=272, Unknown=0, NotChecked=0, Total=506 [2018-10-10 15:11:11,300 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 23 states. [2018-10-10 15:11:11,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:11,810 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-10-10 15:11:11,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-10 15:11:11,810 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 180 [2018-10-10 15:11:11,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:11,811 INFO L225 Difference]: With dead ends: 186 [2018-10-10 15:11:11,811 INFO L226 Difference]: Without dead ends: 186 [2018-10-10 15:11:11,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:11:11,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-10-10 15:11:11,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2018-10-10 15:11:11,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-10-10 15:11:11,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2018-10-10 15:11:11,816 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 180 [2018-10-10 15:11:11,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:11,816 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2018-10-10 15:11:11,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 15:11:11,817 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2018-10-10 15:11:11,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-10 15:11:11,818 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:11,818 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:11,818 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:11,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:11,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1242080484, now seen corresponding path program 20 times [2018-10-10 15:11:11,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:12,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:12,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 15:11:12,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 15:11:12,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 15:11:12,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:11:12,322 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 24 states. [2018-10-10 15:11:13,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:13,067 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-10-10 15:11:13,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 15:11:13,068 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 183 [2018-10-10 15:11:13,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:13,069 INFO L225 Difference]: With dead ends: 189 [2018-10-10 15:11:13,069 INFO L226 Difference]: Without dead ends: 189 [2018-10-10 15:11:13,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 15:11:13,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-10 15:11:13,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2018-10-10 15:11:13,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-10 15:11:13,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-10-10 15:11:13,074 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 183 [2018-10-10 15:11:13,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:13,074 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-10-10 15:11:13,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 15:11:13,075 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-10-10 15:11:13,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-10 15:11:13,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:13,076 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:13,076 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:13,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:13,076 INFO L82 PathProgramCache]: Analyzing trace with hash -375338750, now seen corresponding path program 21 times [2018-10-10 15:11:13,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:14,526 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:14,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:14,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 15:11:14,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 15:11:14,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 15:11:14,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=321, Unknown=0, NotChecked=0, Total=600 [2018-10-10 15:11:14,528 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 25 states. [2018-10-10 15:11:15,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:15,044 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-10-10 15:11:15,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 15:11:15,046 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 186 [2018-10-10 15:11:15,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:15,047 INFO L225 Difference]: With dead ends: 192 [2018-10-10 15:11:15,047 INFO L226 Difference]: Without dead ends: 192 [2018-10-10 15:11:15,048 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 15:11:15,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-10 15:11:15,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2018-10-10 15:11:15,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-10-10 15:11:15,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-10-10 15:11:15,052 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 186 [2018-10-10 15:11:15,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:15,052 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-10-10 15:11:15,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 15:11:15,052 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-10-10 15:11:15,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-10 15:11:15,053 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:15,054 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:15,054 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:15,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:15,054 INFO L82 PathProgramCache]: Analyzing trace with hash 326354980, now seen corresponding path program 22 times [2018-10-10 15:11:15,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:15,774 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:15,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:15,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 15:11:15,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 15:11:15,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 15:11:15,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:11:15,776 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 26 states. [2018-10-10 15:11:16,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:16,335 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-10-10 15:11:16,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-10 15:11:16,335 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 189 [2018-10-10 15:11:16,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:16,336 INFO L225 Difference]: With dead ends: 195 [2018-10-10 15:11:16,336 INFO L226 Difference]: Without dead ends: 195 [2018-10-10 15:11:16,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:11:16,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-10 15:11:16,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2018-10-10 15:11:16,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-10 15:11:16,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-10-10 15:11:16,340 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 189 [2018-10-10 15:11:16,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:16,340 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-10-10 15:11:16,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 15:11:16,340 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-10-10 15:11:16,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-10 15:11:16,341 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:16,341 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:16,341 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:16,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:16,342 INFO L82 PathProgramCache]: Analyzing trace with hash 878435778, now seen corresponding path program 23 times [2018-10-10 15:11:16,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:17,041 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:17,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:17,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 15:11:17,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 15:11:17,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 15:11:17,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=374, Unknown=0, NotChecked=0, Total=702 [2018-10-10 15:11:17,043 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 27 states. [2018-10-10 15:11:17,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:17,746 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-10-10 15:11:17,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 15:11:17,747 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 192 [2018-10-10 15:11:17,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:17,748 INFO L225 Difference]: With dead ends: 198 [2018-10-10 15:11:17,748 INFO L226 Difference]: Without dead ends: 198 [2018-10-10 15:11:17,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 15:11:17,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-10 15:11:17,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2018-10-10 15:11:17,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-10 15:11:17,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-10-10 15:11:17,752 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 192 [2018-10-10 15:11:17,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:17,753 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-10-10 15:11:17,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 15:11:17,753 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-10-10 15:11:17,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-10 15:11:17,754 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:17,754 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:17,754 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:17,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:17,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1807254684, now seen corresponding path program 24 times [2018-10-10 15:11:17,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:18,217 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:18,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:18,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 15:11:18,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 15:11:18,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 15:11:18,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=402, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:11:18,219 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 28 states. [2018-10-10 15:11:18,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:18,843 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-10-10 15:11:18,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-10 15:11:18,846 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 195 [2018-10-10 15:11:18,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:18,848 INFO L225 Difference]: With dead ends: 201 [2018-10-10 15:11:18,848 INFO L226 Difference]: Without dead ends: 201 [2018-10-10 15:11:18,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 15:11:18,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-10-10 15:11:18,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2018-10-10 15:11:18,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-10 15:11:18,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-10-10 15:11:18,853 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 195 [2018-10-10 15:11:18,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:18,854 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-10-10 15:11:18,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 15:11:18,854 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-10-10 15:11:18,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-10 15:11:18,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:18,855 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:18,855 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:18,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:18,855 INFO L82 PathProgramCache]: Analyzing trace with hash -266050942, now seen corresponding path program 25 times [2018-10-10 15:11:18,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:19,645 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:19,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:19,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-10 15:11:19,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-10 15:11:19,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-10 15:11:19,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=431, Unknown=0, NotChecked=0, Total=812 [2018-10-10 15:11:19,647 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 29 states. [2018-10-10 15:11:20,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:20,415 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-10-10 15:11:20,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 15:11:20,416 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 198 [2018-10-10 15:11:20,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:20,417 INFO L225 Difference]: With dead ends: 204 [2018-10-10 15:11:20,417 INFO L226 Difference]: Without dead ends: 204 [2018-10-10 15:11:20,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 15:11:20,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-10-10 15:11:20,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202. [2018-10-10 15:11:20,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-10 15:11:20,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2018-10-10 15:11:20,421 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 198 [2018-10-10 15:11:20,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:20,421 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2018-10-10 15:11:20,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-10 15:11:20,422 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2018-10-10 15:11:20,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-10 15:11:20,423 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:20,423 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:20,423 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:20,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:20,423 INFO L82 PathProgramCache]: Analyzing trace with hash 534232740, now seen corresponding path program 26 times [2018-10-10 15:11:20,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:21,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:21,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:21,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 15:11:21,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 15:11:21,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 15:11:21,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:11:21,535 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 30 states. [2018-10-10 15:11:22,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:22,358 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-10-10 15:11:22,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 15:11:22,358 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 201 [2018-10-10 15:11:22,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:22,360 INFO L225 Difference]: With dead ends: 207 [2018-10-10 15:11:22,360 INFO L226 Difference]: Without dead ends: 207 [2018-10-10 15:11:22,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 15:11:22,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-10 15:11:22,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2018-10-10 15:11:22,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-10 15:11:22,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-10-10 15:11:22,364 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 201 [2018-10-10 15:11:22,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:22,365 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-10-10 15:11:22,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 15:11:22,365 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-10-10 15:11:22,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-10 15:11:22,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:22,366 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:22,367 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:22,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:22,367 INFO L82 PathProgramCache]: Analyzing trace with hash 421943106, now seen corresponding path program 27 times [2018-10-10 15:11:22,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:24,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:24,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:24,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 15:11:24,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 15:11:24,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 15:11:24,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=492, Unknown=0, NotChecked=0, Total=930 [2018-10-10 15:11:24,069 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 31 states. [2018-10-10 15:11:25,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:25,029 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-10-10 15:11:25,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 15:11:25,029 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 204 [2018-10-10 15:11:25,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:25,030 INFO L225 Difference]: With dead ends: 210 [2018-10-10 15:11:25,031 INFO L226 Difference]: Without dead ends: 210 [2018-10-10 15:11:25,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 15:11:25,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-10-10 15:11:25,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2018-10-10 15:11:25,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-10-10 15:11:25,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2018-10-10 15:11:25,036 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 204 [2018-10-10 15:11:25,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:25,036 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2018-10-10 15:11:25,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 15:11:25,036 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2018-10-10 15:11:25,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-10 15:11:25,037 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:25,037 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:25,037 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:25,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:25,038 INFO L82 PathProgramCache]: Analyzing trace with hash 980980196, now seen corresponding path program 28 times [2018-10-10 15:11:25,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:25,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:25,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:25,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 15:11:25,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 15:11:25,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 15:11:25,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=524, Unknown=0, NotChecked=0, Total=992 [2018-10-10 15:11:25,680 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 32 states. [2018-10-10 15:11:26,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:26,810 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-10-10 15:11:26,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-10 15:11:26,810 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 207 [2018-10-10 15:11:26,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:26,811 INFO L225 Difference]: With dead ends: 213 [2018-10-10 15:11:26,811 INFO L226 Difference]: Without dead ends: 213 [2018-10-10 15:11:26,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 15:11:26,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-10-10 15:11:26,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2018-10-10 15:11:26,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-10 15:11:26,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-10-10 15:11:26,815 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 207 [2018-10-10 15:11:26,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:26,816 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-10-10 15:11:26,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 15:11:26,816 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-10-10 15:11:26,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-10 15:11:26,816 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:26,817 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:26,817 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:26,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:26,817 INFO L82 PathProgramCache]: Analyzing trace with hash -628245502, now seen corresponding path program 29 times [2018-10-10 15:11:26,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:27,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:27,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:27,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-10 15:11:27,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-10 15:11:27,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-10 15:11:27,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=557, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 15:11:27,584 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 33 states. [2018-10-10 15:11:28,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:28,453 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-10-10 15:11:28,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-10 15:11:28,453 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 210 [2018-10-10 15:11:28,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:28,454 INFO L225 Difference]: With dead ends: 216 [2018-10-10 15:11:28,454 INFO L226 Difference]: Without dead ends: 216 [2018-10-10 15:11:28,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 15:11:28,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-10 15:11:28,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2018-10-10 15:11:28,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-10-10 15:11:28,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2018-10-10 15:11:28,459 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 210 [2018-10-10 15:11:28,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:28,459 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2018-10-10 15:11:28,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-10 15:11:28,459 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2018-10-10 15:11:28,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-10 15:11:28,460 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:28,460 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:28,461 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:28,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:28,461 INFO L82 PathProgramCache]: Analyzing trace with hash -646056668, now seen corresponding path program 30 times [2018-10-10 15:11:28,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:29,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:29,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:29,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 15:11:29,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 15:11:29,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 15:11:29,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=591, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:11:29,290 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 34 states. [2018-10-10 15:11:30,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:30,301 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-10-10 15:11:30,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 15:11:30,307 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 213 [2018-10-10 15:11:30,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:30,309 INFO L225 Difference]: With dead ends: 219 [2018-10-10 15:11:30,309 INFO L226 Difference]: Without dead ends: 219 [2018-10-10 15:11:30,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 15:11:30,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-10 15:11:30,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2018-10-10 15:11:30,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-10 15:11:30,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-10-10 15:11:30,314 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 213 [2018-10-10 15:11:30,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:30,314 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-10-10 15:11:30,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 15:11:30,314 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-10-10 15:11:30,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-10 15:11:30,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:30,315 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:30,316 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:30,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:30,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1317441730, now seen corresponding path program 31 times [2018-10-10 15:11:30,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:30,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:30,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:30,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-10 15:11:30,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 15:11:30,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 15:11:30,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=626, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 15:11:30,993 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 35 states. [2018-10-10 15:11:31,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:31,991 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2018-10-10 15:11:31,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-10 15:11:31,992 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 216 [2018-10-10 15:11:31,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:31,993 INFO L225 Difference]: With dead ends: 222 [2018-10-10 15:11:31,993 INFO L226 Difference]: Without dead ends: 222 [2018-10-10 15:11:31,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 15:11:31,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-10-10 15:11:31,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2018-10-10 15:11:31,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-10 15:11:31,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2018-10-10 15:11:31,999 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 216 [2018-10-10 15:11:31,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:31,999 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2018-10-10 15:11:31,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 15:11:31,999 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2018-10-10 15:11:32,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-10 15:11:32,001 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:32,001 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:32,002 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:32,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:32,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1556354972, now seen corresponding path program 32 times [2018-10-10 15:11:32,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:32,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:32,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:32,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 15:11:32,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 15:11:32,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 15:11:32,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=662, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:11:32,706 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 36 states. [2018-10-10 15:11:33,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:33,636 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-10-10 15:11:33,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-10 15:11:33,636 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 219 [2018-10-10 15:11:33,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:33,637 INFO L225 Difference]: With dead ends: 225 [2018-10-10 15:11:33,638 INFO L226 Difference]: Without dead ends: 225 [2018-10-10 15:11:33,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 15:11:33,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-10 15:11:33,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2018-10-10 15:11:33,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-10-10 15:11:33,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-10-10 15:11:33,643 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 219 [2018-10-10 15:11:33,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:33,643 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-10-10 15:11:33,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 15:11:33,643 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-10-10 15:11:33,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-10 15:11:33,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:33,645 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:33,646 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:33,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:33,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1044174210, now seen corresponding path program 33 times [2018-10-10 15:11:33,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:34,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:34,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:34,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-10 15:11:34,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 15:11:34,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 15:11:34,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=633, Invalid=699, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 15:11:34,443 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 37 states. [2018-10-10 15:11:35,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:35,720 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-10-10 15:11:35,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 15:11:35,720 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 222 [2018-10-10 15:11:35,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:35,721 INFO L225 Difference]: With dead ends: 228 [2018-10-10 15:11:35,722 INFO L226 Difference]: Without dead ends: 228 [2018-10-10 15:11:35,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-10-10 15:11:35,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-10-10 15:11:35,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 226. [2018-10-10 15:11:35,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-10-10 15:11:35,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-10-10 15:11:35,726 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 222 [2018-10-10 15:11:35,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:35,726 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-10-10 15:11:35,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 15:11:35,727 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-10-10 15:11:35,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-10 15:11:35,728 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:35,728 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:35,728 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:35,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:35,728 INFO L82 PathProgramCache]: Analyzing trace with hash 788949924, now seen corresponding path program 34 times [2018-10-10 15:11:35,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:36,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:36,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:36,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 15:11:36,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 15:11:36,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 15:11:36,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 15:11:36,957 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 38 states. [2018-10-10 15:11:38,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:38,411 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-10-10 15:11:38,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-10 15:11:38,411 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 225 [2018-10-10 15:11:38,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:38,412 INFO L225 Difference]: With dead ends: 231 [2018-10-10 15:11:38,412 INFO L226 Difference]: Without dead ends: 231 [2018-10-10 15:11:38,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 15:11:38,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-10-10 15:11:38,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2018-10-10 15:11:38,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-10 15:11:38,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-10-10 15:11:38,415 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 225 [2018-10-10 15:11:38,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:38,416 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-10-10 15:11:38,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 15:11:38,416 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-10-10 15:11:38,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-10 15:11:38,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:38,417 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:38,418 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:38,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:38,418 INFO L82 PathProgramCache]: Analyzing trace with hash -505640382, now seen corresponding path program 35 times [2018-10-10 15:11:38,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:39,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:39,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:39,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-10 15:11:39,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 15:11:39,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 15:11:39,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=776, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 15:11:39,282 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 39 states. [2018-10-10 15:11:40,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:40,602 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2018-10-10 15:11:40,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 15:11:40,602 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 228 [2018-10-10 15:11:40,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:40,603 INFO L225 Difference]: With dead ends: 234 [2018-10-10 15:11:40,603 INFO L226 Difference]: Without dead ends: 234 [2018-10-10 15:11:40,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 15:11:40,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-10 15:11:40,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2018-10-10 15:11:40,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-10-10 15:11:40,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2018-10-10 15:11:40,606 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 228 [2018-10-10 15:11:40,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:40,607 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2018-10-10 15:11:40,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 15:11:40,607 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2018-10-10 15:11:40,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-10 15:11:40,608 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:40,608 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:40,608 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:40,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:40,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1160871652, now seen corresponding path program 36 times [2018-10-10 15:11:40,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:41,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:41,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:41,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 15:11:41,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 15:11:41,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 15:11:41,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=816, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:11:41,456 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 40 states. [2018-10-10 15:11:42,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:42,649 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-10-10 15:11:42,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-10 15:11:42,650 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 231 [2018-10-10 15:11:42,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:42,651 INFO L225 Difference]: With dead ends: 237 [2018-10-10 15:11:42,651 INFO L226 Difference]: Without dead ends: 237 [2018-10-10 15:11:42,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-10-10 15:11:42,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-10 15:11:42,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2018-10-10 15:11:42,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-10 15:11:42,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-10-10 15:11:42,657 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 231 [2018-10-10 15:11:42,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:42,658 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-10-10 15:11:42,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 15:11:42,658 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-10-10 15:11:42,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-10 15:11:42,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:42,660 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:42,660 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:42,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:42,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1601065214, now seen corresponding path program 37 times [2018-10-10 15:11:42,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:43,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:43,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:43,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-10 15:11:43,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-10 15:11:43,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-10 15:11:43,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=857, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 15:11:43,539 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 41 states. [2018-10-10 15:11:44,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:44,787 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2018-10-10 15:11:44,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-10 15:11:44,788 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 234 [2018-10-10 15:11:44,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:44,789 INFO L225 Difference]: With dead ends: 240 [2018-10-10 15:11:44,789 INFO L226 Difference]: Without dead ends: 240 [2018-10-10 15:11:44,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-10-10 15:11:44,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-10-10 15:11:44,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2018-10-10 15:11:44,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-10-10 15:11:44,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2018-10-10 15:11:44,792 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 234 [2018-10-10 15:11:44,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:44,792 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2018-10-10 15:11:44,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-10 15:11:44,792 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2018-10-10 15:11:44,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-10 15:11:44,793 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:44,793 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:44,793 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:44,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:44,794 INFO L82 PathProgramCache]: Analyzing trace with hash 521216548, now seen corresponding path program 38 times [2018-10-10 15:11:44,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:45,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:45,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:45,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 15:11:45,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 15:11:45,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 15:11:45,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=899, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:11:45,787 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 42 states. [2018-10-10 15:11:47,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:47,021 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-10-10 15:11:47,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-10 15:11:47,021 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 237 [2018-10-10 15:11:47,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:47,022 INFO L225 Difference]: With dead ends: 243 [2018-10-10 15:11:47,022 INFO L226 Difference]: Without dead ends: 243 [2018-10-10 15:11:47,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 15:11:47,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-10 15:11:47,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2018-10-10 15:11:47,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-10 15:11:47,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-10-10 15:11:47,027 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 237 [2018-10-10 15:11:47,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:47,027 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-10-10 15:11:47,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 15:11:47,027 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-10-10 15:11:47,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-10 15:11:47,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:47,028 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:47,028 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:47,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:47,029 INFO L82 PathProgramCache]: Analyzing trace with hash -796376126, now seen corresponding path program 39 times [2018-10-10 15:11:47,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:47,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:47,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:47,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-10 15:11:47,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 15:11:47,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 15:11:47,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=864, Invalid=942, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 15:11:47,965 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 43 states. [2018-10-10 15:11:49,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:49,368 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2018-10-10 15:11:49,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 15:11:49,368 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 240 [2018-10-10 15:11:49,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:49,369 INFO L225 Difference]: With dead ends: 246 [2018-10-10 15:11:49,369 INFO L226 Difference]: Without dead ends: 246 [2018-10-10 15:11:49,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-10-10 15:11:49,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-10-10 15:11:49,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2018-10-10 15:11:49,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-10-10 15:11:49,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 244 transitions. [2018-10-10 15:11:49,375 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 244 transitions. Word has length 240 [2018-10-10 15:11:49,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:49,375 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 244 transitions. [2018-10-10 15:11:49,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 15:11:49,375 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 244 transitions. [2018-10-10 15:11:49,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-10 15:11:49,376 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:49,377 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:49,377 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:49,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:49,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1493609116, now seen corresponding path program 40 times [2018-10-10 15:11:49,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:50,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:50,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:50,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 15:11:50,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 15:11:50,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 15:11:50,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=906, Invalid=986, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 15:11:50,752 INFO L87 Difference]: Start difference. First operand 244 states and 244 transitions. Second operand 44 states. [2018-10-10 15:11:52,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:52,144 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-10-10 15:11:52,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-10 15:11:52,144 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 243 [2018-10-10 15:11:52,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:52,145 INFO L225 Difference]: With dead ends: 249 [2018-10-10 15:11:52,145 INFO L226 Difference]: Without dead ends: 249 [2018-10-10 15:11:52,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-10-10 15:11:52,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-10 15:11:52,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 247. [2018-10-10 15:11:52,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-10 15:11:52,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-10-10 15:11:52,149 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 243 [2018-10-10 15:11:52,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:52,150 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-10-10 15:11:52,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 15:11:52,150 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-10-10 15:11:52,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-10 15:11:52,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:52,151 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:52,151 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:52,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:52,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1995196546, now seen corresponding path program 41 times [2018-10-10 15:11:52,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:53,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:53,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:53,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-10 15:11:53,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-10 15:11:53,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-10 15:11:53,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1031, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 15:11:53,259 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 45 states. [2018-10-10 15:11:54,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:54,843 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2018-10-10 15:11:54,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 15:11:54,843 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 246 [2018-10-10 15:11:54,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:54,844 INFO L225 Difference]: With dead ends: 252 [2018-10-10 15:11:54,844 INFO L226 Difference]: Without dead ends: 252 [2018-10-10 15:11:54,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-10-10 15:11:54,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-10-10 15:11:54,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 250. [2018-10-10 15:11:54,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-10 15:11:54,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2018-10-10 15:11:54,849 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 246 [2018-10-10 15:11:54,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:54,849 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2018-10-10 15:11:54,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-10 15:11:54,849 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2018-10-10 15:11:54,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-10 15:11:54,850 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:54,851 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:54,851 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:54,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:54,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1203890012, now seen corresponding path program 42 times [2018-10-10 15:11:54,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:56,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:56,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:56,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 15:11:56,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 15:11:56,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 15:11:56,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=1077, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 15:11:56,007 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand 46 states. [2018-10-10 15:11:57,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:57,612 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-10-10 15:11:57,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-10 15:11:57,612 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 249 [2018-10-10 15:11:57,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:57,613 INFO L225 Difference]: With dead ends: 255 [2018-10-10 15:11:57,613 INFO L226 Difference]: Without dead ends: 255 [2018-10-10 15:11:57,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-10-10 15:11:57,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-10-10 15:11:57,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2018-10-10 15:11:57,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-10-10 15:11:57,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-10-10 15:11:57,617 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 249 [2018-10-10 15:11:57,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:57,617 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-10-10 15:11:57,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 15:11:57,617 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-10-10 15:11:57,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-10 15:11:57,618 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:57,618 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:11:57,619 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:57,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:57,619 INFO L82 PathProgramCache]: Analyzing trace with hash 132758850, now seen corresponding path program 43 times [2018-10-10 15:11:57,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:58,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:58,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:58,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-10 15:11:58,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-10 15:11:58,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-10 15:11:58,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1038, Invalid=1124, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 15:11:58,901 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 47 states. [2018-10-10 15:12:00,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:00,556 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2018-10-10 15:12:00,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-10 15:12:00,562 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 252 [2018-10-10 15:12:00,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:00,563 INFO L225 Difference]: With dead ends: 258 [2018-10-10 15:12:00,563 INFO L226 Difference]: Without dead ends: 258 [2018-10-10 15:12:00,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-10-10 15:12:00,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-10 15:12:00,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2018-10-10 15:12:00,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-10 15:12:00,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2018-10-10 15:12:00,567 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 252 [2018-10-10 15:12:00,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:00,568 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2018-10-10 15:12:00,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-10 15:12:00,568 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2018-10-10 15:12:00,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-10 15:12:00,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:00,569 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:00,570 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:00,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:00,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1597205476, now seen corresponding path program 44 times [2018-10-10 15:12:00,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:01,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:01,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:01,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 15:12:01,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 15:12:01,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 15:12:01,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1084, Invalid=1172, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:12:01,706 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 48 states. [2018-10-10 15:12:03,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:03,306 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-10-10 15:12:03,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-10 15:12:03,306 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 255 [2018-10-10 15:12:03,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:03,307 INFO L225 Difference]: With dead ends: 261 [2018-10-10 15:12:03,307 INFO L226 Difference]: Without dead ends: 261 [2018-10-10 15:12:03,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-10-10 15:12:03,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-10-10 15:12:03,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 259. [2018-10-10 15:12:03,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-10 15:12:03,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2018-10-10 15:12:03,311 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 255 [2018-10-10 15:12:03,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:03,311 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2018-10-10 15:12:03,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 15:12:03,312 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2018-10-10 15:12:03,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-10 15:12:03,313 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:03,313 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:03,313 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:03,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:03,314 INFO L82 PathProgramCache]: Analyzing trace with hash 648847874, now seen corresponding path program 45 times [2018-10-10 15:12:03,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:04,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:04,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:04,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-10 15:12:04,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-10 15:12:04,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-10 15:12:04,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1131, Invalid=1221, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 15:12:04,590 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 49 states. [2018-10-10 15:12:06,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:06,423 INFO L93 Difference]: Finished difference Result 264 states and 264 transitions. [2018-10-10 15:12:06,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-10 15:12:06,424 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 258 [2018-10-10 15:12:06,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:06,425 INFO L225 Difference]: With dead ends: 264 [2018-10-10 15:12:06,425 INFO L226 Difference]: Without dead ends: 264 [2018-10-10 15:12:06,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-10-10 15:12:06,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-10-10 15:12:06,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2018-10-10 15:12:06,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-10-10 15:12:06,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2018-10-10 15:12:06,429 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 258 [2018-10-10 15:12:06,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:06,429 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2018-10-10 15:12:06,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-10 15:12:06,429 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2018-10-10 15:12:06,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-10 15:12:06,431 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:06,431 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:06,431 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:06,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:06,431 INFO L82 PathProgramCache]: Analyzing trace with hash 422399780, now seen corresponding path program 46 times [2018-10-10 15:12:06,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:07,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:07,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:07,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-10 15:12:07,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-10 15:12:07,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-10 15:12:07,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1179, Invalid=1271, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 15:12:07,612 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 50 states. [2018-10-10 15:12:09,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:09,210 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-10-10 15:12:09,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-10 15:12:09,211 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 261 [2018-10-10 15:12:09,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:09,212 INFO L225 Difference]: With dead ends: 267 [2018-10-10 15:12:09,212 INFO L226 Difference]: Without dead ends: 267 [2018-10-10 15:12:09,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-10-10 15:12:09,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-10 15:12:09,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2018-10-10 15:12:09,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-10-10 15:12:09,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-10-10 15:12:09,215 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 261 [2018-10-10 15:12:09,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:09,216 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-10-10 15:12:09,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-10 15:12:09,216 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-10-10 15:12:09,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-10 15:12:09,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:09,217 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:09,218 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:09,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:09,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1700853442, now seen corresponding path program 47 times [2018-10-10 15:12:09,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:10,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 0 proven. 3290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:10,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:10,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-10 15:12:10,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-10 15:12:10,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-10 15:12:10,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1228, Invalid=1322, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 15:12:10,776 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 51 states. [2018-10-10 15:12:12,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:12,546 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2018-10-10 15:12:12,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-10 15:12:12,546 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 264 [2018-10-10 15:12:12,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:12,547 INFO L225 Difference]: With dead ends: 270 [2018-10-10 15:12:12,547 INFO L226 Difference]: Without dead ends: 270 [2018-10-10 15:12:12,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-10-10 15:12:12,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-10 15:12:12,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 268. [2018-10-10 15:12:12,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-10 15:12:12,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 268 transitions. [2018-10-10 15:12:12,551 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 268 transitions. Word has length 264 [2018-10-10 15:12:12,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:12,551 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 268 transitions. [2018-10-10 15:12:12,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-10 15:12:12,551 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 268 transitions. [2018-10-10 15:12:12,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-10 15:12:12,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:12,553 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:12,553 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:12,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:12,553 INFO L82 PathProgramCache]: Analyzing trace with hash 343917156, now seen corresponding path program 48 times [2018-10-10 15:12:12,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:13,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:13,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:13,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-10 15:12:13,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-10 15:12:13,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-10 15:12:13,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1278, Invalid=1374, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 15:12:13,815 INFO L87 Difference]: Start difference. First operand 268 states and 268 transitions. Second operand 52 states. [2018-10-10 15:12:15,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:15,801 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-10-10 15:12:15,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 15:12:15,802 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 267 [2018-10-10 15:12:15,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:15,803 INFO L225 Difference]: With dead ends: 273 [2018-10-10 15:12:15,803 INFO L226 Difference]: Without dead ends: 273 [2018-10-10 15:12:15,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-10-10 15:12:15,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-10-10 15:12:15,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2018-10-10 15:12:15,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-10 15:12:15,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-10-10 15:12:15,807 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 267 [2018-10-10 15:12:15,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:15,807 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-10-10 15:12:15,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-10 15:12:15,808 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-10-10 15:12:15,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-10 15:12:15,809 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:15,810 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:15,810 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:15,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:15,810 INFO L82 PathProgramCache]: Analyzing trace with hash 87210882, now seen corresponding path program 49 times [2018-10-10 15:12:15,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:17,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 0 proven. 3577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:17,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:17,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-10 15:12:17,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-10 15:12:17,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-10 15:12:17,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1329, Invalid=1427, Unknown=0, NotChecked=0, Total=2756 [2018-10-10 15:12:17,362 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 53 states. [2018-10-10 15:12:19,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:19,263 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2018-10-10 15:12:19,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-10 15:12:19,264 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 270 [2018-10-10 15:12:19,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:19,265 INFO L225 Difference]: With dead ends: 276 [2018-10-10 15:12:19,265 INFO L226 Difference]: Without dead ends: 276 [2018-10-10 15:12:19,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-10-10 15:12:19,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-10-10 15:12:19,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 274. [2018-10-10 15:12:19,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-10 15:12:19,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 274 transitions. [2018-10-10 15:12:19,276 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 274 transitions. Word has length 270 [2018-10-10 15:12:19,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:19,276 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 274 transitions. [2018-10-10 15:12:19,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-10 15:12:19,276 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 274 transitions. [2018-10-10 15:12:19,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-10-10 15:12:19,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:19,277 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:19,277 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:19,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:19,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1887356324, now seen corresponding path program 50 times [2018-10-10 15:12:19,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:20,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 0 proven. 3725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:20,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:20,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-10 15:12:20,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-10 15:12:20,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-10 15:12:20,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1381, Invalid=1481, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 15:12:20,891 INFO L87 Difference]: Start difference. First operand 274 states and 274 transitions. Second operand 54 states. [2018-10-10 15:12:22,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:22,771 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-10-10 15:12:22,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-10 15:12:22,771 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 273 [2018-10-10 15:12:22,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:22,773 INFO L225 Difference]: With dead ends: 279 [2018-10-10 15:12:22,773 INFO L226 Difference]: Without dead ends: 279 [2018-10-10 15:12:22,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-10-10 15:12:22,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-10 15:12:22,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2018-10-10 15:12:22,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-10 15:12:22,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-10-10 15:12:22,777 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 273 [2018-10-10 15:12:22,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:22,777 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-10-10 15:12:22,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-10 15:12:22,778 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-10-10 15:12:22,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-10 15:12:22,779 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:22,779 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:22,779 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:22,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:22,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1236406206, now seen corresponding path program 51 times [2018-10-10 15:12:22,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:24,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 0 proven. 3876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:24,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:24,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-10 15:12:24,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-10 15:12:24,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-10 15:12:24,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1434, Invalid=1536, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 15:12:24,140 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 55 states. [2018-10-10 15:12:26,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:26,371 INFO L93 Difference]: Finished difference Result 282 states and 282 transitions. [2018-10-10 15:12:26,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-10 15:12:26,372 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 276 [2018-10-10 15:12:26,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:26,373 INFO L225 Difference]: With dead ends: 282 [2018-10-10 15:12:26,373 INFO L226 Difference]: Without dead ends: 282 [2018-10-10 15:12:26,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-10-10 15:12:26,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-10-10 15:12:26,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2018-10-10 15:12:26,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-10 15:12:26,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 280 transitions. [2018-10-10 15:12:26,376 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 280 transitions. Word has length 276 [2018-10-10 15:12:26,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:26,376 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 280 transitions. [2018-10-10 15:12:26,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-10 15:12:26,377 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 280 transitions. [2018-10-10 15:12:26,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-10 15:12:26,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:26,378 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:26,378 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:26,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:26,378 INFO L82 PathProgramCache]: Analyzing trace with hash 2105432292, now seen corresponding path program 52 times [2018-10-10 15:12:26,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:27,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 0 proven. 4030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:27,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:27,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-10 15:12:27,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-10 15:12:27,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-10 15:12:27,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1488, Invalid=1592, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 15:12:27,791 INFO L87 Difference]: Start difference. First operand 280 states and 280 transitions. Second operand 56 states. [2018-10-10 15:12:29,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:29,832 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-10-10 15:12:29,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-10 15:12:29,833 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 279 [2018-10-10 15:12:29,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:29,837 INFO L225 Difference]: With dead ends: 285 [2018-10-10 15:12:29,837 INFO L226 Difference]: Without dead ends: 285 [2018-10-10 15:12:29,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-10-10 15:12:29,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-10-10 15:12:29,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2018-10-10 15:12:29,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-10 15:12:29,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-10-10 15:12:29,841 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 279 [2018-10-10 15:12:29,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:29,842 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-10-10 15:12:29,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-10 15:12:29,842 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-10-10 15:12:29,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-10 15:12:29,843 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:29,843 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:29,844 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:29,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:29,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1474204930, now seen corresponding path program 53 times [2018-10-10 15:12:29,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:31,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 0 proven. 4187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:31,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:31,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-10 15:12:31,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-10 15:12:31,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-10 15:12:31,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1543, Invalid=1649, Unknown=0, NotChecked=0, Total=3192 [2018-10-10 15:12:31,645 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 57 states. [2018-10-10 15:12:33,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:33,754 INFO L93 Difference]: Finished difference Result 288 states and 288 transitions. [2018-10-10 15:12:33,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-10 15:12:33,754 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 282 [2018-10-10 15:12:33,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:33,755 INFO L225 Difference]: With dead ends: 288 [2018-10-10 15:12:33,755 INFO L226 Difference]: Without dead ends: 288 [2018-10-10 15:12:33,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-10-10 15:12:33,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-10-10 15:12:33,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 286. [2018-10-10 15:12:33,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-10-10 15:12:33,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2018-10-10 15:12:33,758 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 282 [2018-10-10 15:12:33,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:33,759 INFO L481 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2018-10-10 15:12:33,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-10 15:12:33,759 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2018-10-10 15:12:33,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-10-10 15:12:33,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:33,761 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:33,761 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:33,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:33,761 INFO L82 PathProgramCache]: Analyzing trace with hash -53314524, now seen corresponding path program 54 times [2018-10-10 15:12:33,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:35,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:35,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:35,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-10 15:12:35,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-10 15:12:35,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-10 15:12:35,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=1707, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 15:12:35,348 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 58 states. [2018-10-10 15:12:37,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:37,812 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-10-10 15:12:37,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-10 15:12:37,812 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 285 [2018-10-10 15:12:37,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:37,813 INFO L225 Difference]: With dead ends: 291 [2018-10-10 15:12:37,813 INFO L226 Difference]: Without dead ends: 291 [2018-10-10 15:12:37,814 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-10-10 15:12:37,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-10 15:12:37,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2018-10-10 15:12:37,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-10-10 15:12:37,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-10-10 15:12:37,816 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 285 [2018-10-10 15:12:37,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:37,817 INFO L481 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-10-10 15:12:37,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-10 15:12:37,817 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-10-10 15:12:37,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-10 15:12:37,818 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:37,818 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:37,818 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:37,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:37,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1206867518, now seen corresponding path program 55 times [2018-10-10 15:12:37,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:39,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 0 proven. 4510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:39,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:39,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-10 15:12:39,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-10 15:12:39,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-10 15:12:39,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1656, Invalid=1766, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 15:12:39,278 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 59 states. [2018-10-10 15:12:41,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:41,869 INFO L93 Difference]: Finished difference Result 294 states and 294 transitions. [2018-10-10 15:12:41,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-10 15:12:41,870 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 288 [2018-10-10 15:12:41,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:41,871 INFO L225 Difference]: With dead ends: 294 [2018-10-10 15:12:41,871 INFO L226 Difference]: Without dead ends: 294 [2018-10-10 15:12:41,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-10-10 15:12:41,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-10-10 15:12:41,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2018-10-10 15:12:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-10-10 15:12:41,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2018-10-10 15:12:41,874 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 288 [2018-10-10 15:12:41,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:41,874 INFO L481 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2018-10-10 15:12:41,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-10 15:12:41,874 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2018-10-10 15:12:41,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-10-10 15:12:41,876 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:41,876 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:41,876 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:41,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:41,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1624190820, now seen corresponding path program 56 times [2018-10-10 15:12:41,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:43,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 0 proven. 4676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:43,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:43,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-10 15:12:43,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-10 15:12:43,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-10 15:12:43,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1714, Invalid=1826, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 15:12:43,457 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 60 states. [2018-10-10 15:12:45,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:45,911 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2018-10-10 15:12:45,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-10 15:12:45,911 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 291 [2018-10-10 15:12:45,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:45,912 INFO L225 Difference]: With dead ends: 297 [2018-10-10 15:12:45,913 INFO L226 Difference]: Without dead ends: 297 [2018-10-10 15:12:45,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-10-10 15:12:45,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-10-10 15:12:45,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 295. [2018-10-10 15:12:45,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-10-10 15:12:45,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2018-10-10 15:12:45,916 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 291 [2018-10-10 15:12:45,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:45,916 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2018-10-10 15:12:45,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-10 15:12:45,917 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2018-10-10 15:12:45,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-10 15:12:45,917 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:45,918 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:45,918 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:45,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:45,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1410346626, now seen corresponding path program 57 times [2018-10-10 15:12:45,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:47,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 0 proven. 4845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:47,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:47,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-10 15:12:47,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-10 15:12:47,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-10 15:12:47,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1773, Invalid=1887, Unknown=0, NotChecked=0, Total=3660 [2018-10-10 15:12:47,848 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 61 states. [2018-10-10 15:12:50,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:50,261 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2018-10-10 15:12:50,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-10 15:12:50,262 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 294 [2018-10-10 15:12:50,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:50,263 INFO L225 Difference]: With dead ends: 300 [2018-10-10 15:12:50,263 INFO L226 Difference]: Without dead ends: 300 [2018-10-10 15:12:50,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-10-10 15:12:50,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-10-10 15:12:50,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2018-10-10 15:12:50,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-10-10 15:12:50,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 298 transitions. [2018-10-10 15:12:50,267 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 298 transitions. Word has length 294 [2018-10-10 15:12:50,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:50,267 INFO L481 AbstractCegarLoop]: Abstraction has 298 states and 298 transitions. [2018-10-10 15:12:50,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-10 15:12:50,267 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 298 transitions. [2018-10-10 15:12:50,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-10-10 15:12:50,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:50,268 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:50,268 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:50,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:50,269 INFO L82 PathProgramCache]: Analyzing trace with hash 214463140, now seen corresponding path program 58 times [2018-10-10 15:12:50,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:52,536 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 0 proven. 5017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:52,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:52,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-10 15:12:52,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-10 15:12:52,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-10 15:12:52,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1833, Invalid=1949, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 15:12:52,538 INFO L87 Difference]: Start difference. First operand 298 states and 298 transitions. Second operand 62 states. [2018-10-10 15:12:55,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:55,185 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-10-10 15:12:55,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-10 15:12:55,185 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 297 [2018-10-10 15:12:55,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:55,186 INFO L225 Difference]: With dead ends: 303 [2018-10-10 15:12:55,186 INFO L226 Difference]: Without dead ends: 303 [2018-10-10 15:12:55,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-10-10 15:12:55,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-10-10 15:12:55,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2018-10-10 15:12:55,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-10 15:12:55,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-10-10 15:12:55,190 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 297 [2018-10-10 15:12:55,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:55,190 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-10-10 15:12:55,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-10 15:12:55,190 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-10-10 15:12:55,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-10-10 15:12:55,191 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:55,191 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:55,191 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:55,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:55,192 INFO L82 PathProgramCache]: Analyzing trace with hash 403252034, now seen corresponding path program 59 times [2018-10-10 15:12:55,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:57,147 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 0 proven. 5192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:57,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:57,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-10 15:12:57,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-10 15:12:57,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-10 15:12:57,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=2012, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 15:12:57,149 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 63 states. [2018-10-10 15:12:59,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:59,747 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2018-10-10 15:12:59,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-10 15:12:59,748 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 300 [2018-10-10 15:12:59,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:59,749 INFO L225 Difference]: With dead ends: 306 [2018-10-10 15:12:59,749 INFO L226 Difference]: Without dead ends: 306 [2018-10-10 15:12:59,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-10-10 15:12:59,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-10-10 15:12:59,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2018-10-10 15:12:59,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-10-10 15:12:59,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 304 transitions. [2018-10-10 15:12:59,752 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 304 transitions. Word has length 300 [2018-10-10 15:12:59,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:59,752 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 304 transitions. [2018-10-10 15:12:59,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-10 15:12:59,752 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 304 transitions. [2018-10-10 15:12:59,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-10-10 15:12:59,753 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:59,753 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:59,754 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:59,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:59,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1793964572, now seen corresponding path program 60 times [2018-10-10 15:12:59,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:01,553 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 0 proven. 5370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:01,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:01,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-10 15:13:01,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-10 15:13:01,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-10 15:13:01,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 15:13:01,555 INFO L87 Difference]: Start difference. First operand 304 states and 304 transitions. Second operand 64 states. [2018-10-10 15:13:04,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:04,380 INFO L93 Difference]: Finished difference Result 309 states and 309 transitions. [2018-10-10 15:13:04,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-10 15:13:04,380 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 303 [2018-10-10 15:13:04,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:04,381 INFO L225 Difference]: With dead ends: 309 [2018-10-10 15:13:04,382 INFO L226 Difference]: Without dead ends: 309 [2018-10-10 15:13:04,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-10-10 15:13:04,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-10-10 15:13:04,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2018-10-10 15:13:04,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-10-10 15:13:04,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2018-10-10 15:13:04,386 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 303 [2018-10-10 15:13:04,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:04,386 INFO L481 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2018-10-10 15:13:04,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-10 15:13:04,386 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2018-10-10 15:13:04,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-10-10 15:13:04,387 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:04,387 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:04,388 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:04,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:04,388 INFO L82 PathProgramCache]: Analyzing trace with hash 522684418, now seen corresponding path program 61 times [2018-10-10 15:13:04,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 0 proven. 5551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:06,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:06,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-10 15:13:06,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-10 15:13:06,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-10 15:13:06,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2019, Invalid=2141, Unknown=0, NotChecked=0, Total=4160 [2018-10-10 15:13:06,149 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 65 states. [2018-10-10 15:13:08,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:08,877 INFO L93 Difference]: Finished difference Result 312 states and 312 transitions. [2018-10-10 15:13:08,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-10 15:13:08,878 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 306 [2018-10-10 15:13:08,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:08,879 INFO L225 Difference]: With dead ends: 312 [2018-10-10 15:13:08,879 INFO L226 Difference]: Without dead ends: 312 [2018-10-10 15:13:08,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-10-10 15:13:08,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-10-10 15:13:08,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 310. [2018-10-10 15:13:08,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-10-10 15:13:08,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 310 transitions. [2018-10-10 15:13:08,883 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 310 transitions. Word has length 306 [2018-10-10 15:13:08,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:08,883 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 310 transitions. [2018-10-10 15:13:08,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-10 15:13:08,883 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 310 transitions. [2018-10-10 15:13:08,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-10-10 15:13:08,884 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:08,884 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:08,884 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:08,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:08,885 INFO L82 PathProgramCache]: Analyzing trace with hash -16733916, now seen corresponding path program 62 times [2018-10-10 15:13:08,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:10,725 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:10,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:10,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-10 15:13:10,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-10 15:13:10,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-10 15:13:10,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2083, Invalid=2207, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 15:13:10,726 INFO L87 Difference]: Start difference. First operand 310 states and 310 transitions. Second operand 66 states. [2018-10-10 15:13:13,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:13,721 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2018-10-10 15:13:13,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-10 15:13:13,722 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 309 [2018-10-10 15:13:13,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:13,723 INFO L225 Difference]: With dead ends: 315 [2018-10-10 15:13:13,723 INFO L226 Difference]: Without dead ends: 315 [2018-10-10 15:13:13,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-10-10 15:13:13,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-10-10 15:13:13,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2018-10-10 15:13:13,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-10-10 15:13:13,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2018-10-10 15:13:13,727 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 309 [2018-10-10 15:13:13,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:13,727 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2018-10-10 15:13:13,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-10 15:13:13,727 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2018-10-10 15:13:13,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-10-10 15:13:13,728 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:13,728 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:13,729 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:13,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:13,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1939299522, now seen corresponding path program 63 times [2018-10-10 15:13:13,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:15,615 INFO L134 CoverageAnalysis]: Checked inductivity of 5922 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:15,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:15,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-10 15:13:15,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-10 15:13:15,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-10 15:13:15,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2148, Invalid=2274, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 15:13:15,617 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 67 states. [2018-10-10 15:13:18,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:18,661 INFO L93 Difference]: Finished difference Result 318 states and 318 transitions. [2018-10-10 15:13:18,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-10 15:13:18,661 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 312 [2018-10-10 15:13:18,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:18,662 INFO L225 Difference]: With dead ends: 318 [2018-10-10 15:13:18,662 INFO L226 Difference]: Without dead ends: 318 [2018-10-10 15:13:18,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-10-10 15:13:18,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-10-10 15:13:18,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 316. [2018-10-10 15:13:18,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-10-10 15:13:18,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 316 transitions. [2018-10-10 15:13:18,666 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 316 transitions. Word has length 312 [2018-10-10 15:13:18,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:18,666 INFO L481 AbstractCegarLoop]: Abstraction has 316 states and 316 transitions. [2018-10-10 15:13:18,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-10 15:13:18,666 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 316 transitions. [2018-10-10 15:13:18,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-10-10 15:13:18,668 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:18,668 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:18,668 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:18,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:18,668 INFO L82 PathProgramCache]: Analyzing trace with hash 15178852, now seen corresponding path program 64 times [2018-10-10 15:13:18,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:20,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6112 backedges. 0 proven. 6112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:20,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:20,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-10 15:13:20,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-10 15:13:20,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-10 15:13:20,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2214, Invalid=2342, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 15:13:20,601 INFO L87 Difference]: Start difference. First operand 316 states and 316 transitions. Second operand 68 states. [2018-10-10 15:13:23,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:23,717 INFO L93 Difference]: Finished difference Result 321 states and 321 transitions. [2018-10-10 15:13:23,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-10 15:13:23,717 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 315 [2018-10-10 15:13:23,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:23,718 INFO L225 Difference]: With dead ends: 321 [2018-10-10 15:13:23,719 INFO L226 Difference]: Without dead ends: 321 [2018-10-10 15:13:23,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-10-10 15:13:23,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-10-10 15:13:23,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 319. [2018-10-10 15:13:23,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-10-10 15:13:23,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 319 transitions. [2018-10-10 15:13:23,722 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 319 transitions. Word has length 315 [2018-10-10 15:13:23,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:23,722 INFO L481 AbstractCegarLoop]: Abstraction has 319 states and 319 transitions. [2018-10-10 15:13:23,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-10 15:13:23,723 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 319 transitions. [2018-10-10 15:13:23,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-10-10 15:13:23,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:23,724 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:23,724 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:23,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:23,724 INFO L82 PathProgramCache]: Analyzing trace with hash -830168702, now seen corresponding path program 65 times [2018-10-10 15:13:23,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:25,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6305 backedges. 0 proven. 6305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:25,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:25,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-10 15:13:25,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-10 15:13:25,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-10 15:13:25,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2281, Invalid=2411, Unknown=0, NotChecked=0, Total=4692 [2018-10-10 15:13:25,835 INFO L87 Difference]: Start difference. First operand 319 states and 319 transitions. Second operand 69 states. [2018-10-10 15:13:29,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:29,099 INFO L93 Difference]: Finished difference Result 324 states and 324 transitions. [2018-10-10 15:13:29,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-10 15:13:29,099 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 318 [2018-10-10 15:13:29,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:29,100 INFO L225 Difference]: With dead ends: 324 [2018-10-10 15:13:29,101 INFO L226 Difference]: Without dead ends: 324 [2018-10-10 15:13:29,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-10-10 15:13:29,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-10-10 15:13:29,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 322. [2018-10-10 15:13:29,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-10-10 15:13:29,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 322 transitions. [2018-10-10 15:13:29,105 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 322 transitions. Word has length 318 [2018-10-10 15:13:29,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:29,105 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 322 transitions. [2018-10-10 15:13:29,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-10 15:13:29,106 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 322 transitions. [2018-10-10 15:13:29,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-10-10 15:13:29,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:29,107 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:29,107 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:29,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:29,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1109073828, now seen corresponding path program 66 times [2018-10-10 15:13:29,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:31,210 INFO L134 CoverageAnalysis]: Checked inductivity of 6501 backedges. 0 proven. 6501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:31,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:31,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-10 15:13:31,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-10 15:13:31,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-10 15:13:31,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2349, Invalid=2481, Unknown=0, NotChecked=0, Total=4830 [2018-10-10 15:13:31,211 INFO L87 Difference]: Start difference. First operand 322 states and 322 transitions. Second operand 70 states. [2018-10-10 15:13:34,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:34,503 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2018-10-10 15:13:34,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-10 15:13:34,503 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 321 [2018-10-10 15:13:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:34,504 INFO L225 Difference]: With dead ends: 327 [2018-10-10 15:13:34,504 INFO L226 Difference]: Without dead ends: 327 [2018-10-10 15:13:34,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-10-10 15:13:34,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-10 15:13:34,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2018-10-10 15:13:34,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-10-10 15:13:34,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2018-10-10 15:13:34,509 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 321 [2018-10-10 15:13:34,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:34,509 INFO L481 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2018-10-10 15:13:34,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-10 15:13:34,509 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2018-10-10 15:13:34,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-10-10 15:13:34,510 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:34,511 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:34,511 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:34,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:34,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1478186562, now seen corresponding path program 67 times [2018-10-10 15:13:34,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:34,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:36,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 0 proven. 6700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:36,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:36,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-10 15:13:36,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-10 15:13:36,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-10 15:13:36,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2418, Invalid=2552, Unknown=0, NotChecked=0, Total=4970 [2018-10-10 15:13:36,623 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 71 states. [2018-10-10 15:13:39,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:39,882 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2018-10-10 15:13:39,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-10 15:13:39,882 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 324 [2018-10-10 15:13:39,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:39,884 INFO L225 Difference]: With dead ends: 330 [2018-10-10 15:13:39,884 INFO L226 Difference]: Without dead ends: 330 [2018-10-10 15:13:39,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-10-10 15:13:39,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-10-10 15:13:39,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2018-10-10 15:13:39,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-10 15:13:39,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 328 transitions. [2018-10-10 15:13:39,888 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 328 transitions. Word has length 324 [2018-10-10 15:13:39,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:39,888 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 328 transitions. [2018-10-10 15:13:39,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-10 15:13:39,888 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 328 transitions. [2018-10-10 15:13:39,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-10-10 15:13:39,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:39,889 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:39,889 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:39,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:39,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1695599900, now seen corresponding path program 68 times [2018-10-10 15:13:39,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:42,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6902 backedges. 0 proven. 6902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:42,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:42,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-10 15:13:42,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-10 15:13:42,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-10 15:13:42,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2488, Invalid=2624, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 15:13:42,278 INFO L87 Difference]: Start difference. First operand 328 states and 328 transitions. Second operand 72 states. [2018-10-10 15:13:45,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:45,772 INFO L93 Difference]: Finished difference Result 333 states and 333 transitions. [2018-10-10 15:13:45,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-10 15:13:45,773 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 327 [2018-10-10 15:13:45,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:45,774 INFO L225 Difference]: With dead ends: 333 [2018-10-10 15:13:45,774 INFO L226 Difference]: Without dead ends: 333 [2018-10-10 15:13:45,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-10-10 15:13:45,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-10-10 15:13:45,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2018-10-10 15:13:45,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-10-10 15:13:45,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2018-10-10 15:13:45,777 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 327 [2018-10-10 15:13:45,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:45,778 INFO L481 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2018-10-10 15:13:45,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-10 15:13:45,778 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2018-10-10 15:13:45,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-10 15:13:45,779 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:45,779 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:45,779 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:45,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:45,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1736932098, now seen corresponding path program 69 times [2018-10-10 15:13:45,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:48,293 INFO L134 CoverageAnalysis]: Checked inductivity of 7107 backedges. 0 proven. 7107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:48,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:48,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-10 15:13:48,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-10 15:13:48,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-10 15:13:48,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2559, Invalid=2697, Unknown=0, NotChecked=0, Total=5256 [2018-10-10 15:13:48,294 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 73 states. [2018-10-10 15:13:51,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:51,679 INFO L93 Difference]: Finished difference Result 336 states and 336 transitions. [2018-10-10 15:13:51,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-10 15:13:51,679 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 330 [2018-10-10 15:13:51,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:51,680 INFO L225 Difference]: With dead ends: 336 [2018-10-10 15:13:51,680 INFO L226 Difference]: Without dead ends: 336 [2018-10-10 15:13:51,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-10-10 15:13:51,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-10-10 15:13:51,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2018-10-10 15:13:51,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-10-10 15:13:51,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 334 transitions. [2018-10-10 15:13:51,683 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 334 transitions. Word has length 330 [2018-10-10 15:13:51,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:51,684 INFO L481 AbstractCegarLoop]: Abstraction has 334 states and 334 transitions. [2018-10-10 15:13:51,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-10 15:13:51,684 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 334 transitions. [2018-10-10 15:13:51,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-10-10 15:13:51,685 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:51,685 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:51,685 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:51,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:51,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1421334052, now seen corresponding path program 70 times [2018-10-10 15:13:51,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:54,268 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 0 proven. 7315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:54,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:54,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-10 15:13:54,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-10 15:13:54,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-10 15:13:54,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2631, Invalid=2771, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 15:13:54,269 INFO L87 Difference]: Start difference. First operand 334 states and 334 transitions. Second operand 74 states. [2018-10-10 15:13:57,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:57,883 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2018-10-10 15:13:57,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-10 15:13:57,883 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 333 [2018-10-10 15:13:57,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:57,884 INFO L225 Difference]: With dead ends: 339 [2018-10-10 15:13:57,884 INFO L226 Difference]: Without dead ends: 339 [2018-10-10 15:13:57,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-10-10 15:13:57,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-10-10 15:13:57,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2018-10-10 15:13:57,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-10-10 15:13:57,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2018-10-10 15:13:57,888 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 333 [2018-10-10 15:13:57,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:57,888 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2018-10-10 15:13:57,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-10 15:13:57,888 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2018-10-10 15:13:57,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-10-10 15:13:57,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:57,889 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:57,890 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:57,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:57,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1123356610, now seen corresponding path program 71 times [2018-10-10 15:13:57,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:00,357 INFO L134 CoverageAnalysis]: Checked inductivity of 7526 backedges. 0 proven. 7526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:00,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:00,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-10 15:14:00,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-10 15:14:00,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-10 15:14:00,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2704, Invalid=2846, Unknown=0, NotChecked=0, Total=5550 [2018-10-10 15:14:00,358 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 75 states. [2018-10-10 15:14:04,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:04,290 INFO L93 Difference]: Finished difference Result 342 states and 342 transitions. [2018-10-10 15:14:04,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-10 15:14:04,291 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 336 [2018-10-10 15:14:04,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:04,292 INFO L225 Difference]: With dead ends: 342 [2018-10-10 15:14:04,292 INFO L226 Difference]: Without dead ends: 342 [2018-10-10 15:14:04,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-10-10 15:14:04,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-10-10 15:14:04,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2018-10-10 15:14:04,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-10 15:14:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 340 transitions. [2018-10-10 15:14:04,295 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 340 transitions. Word has length 336 [2018-10-10 15:14:04,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:04,295 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 340 transitions. [2018-10-10 15:14:04,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-10 15:14:04,296 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 340 transitions. [2018-10-10 15:14:04,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-10-10 15:14:04,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:04,297 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:14:04,297 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:04,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:04,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1774782820, now seen corresponding path program 72 times [2018-10-10 15:14:04,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:06,796 INFO L134 CoverageAnalysis]: Checked inductivity of 7740 backedges. 0 proven. 7740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:06,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:06,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-10 15:14:06,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-10 15:14:06,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-10 15:14:06,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2778, Invalid=2922, Unknown=0, NotChecked=0, Total=5700 [2018-10-10 15:14:06,798 INFO L87 Difference]: Start difference. First operand 340 states and 340 transitions. Second operand 76 states. [2018-10-10 15:14:10,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:10,724 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2018-10-10 15:14:10,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-10 15:14:10,724 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 339 [2018-10-10 15:14:10,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:10,725 INFO L225 Difference]: With dead ends: 345 [2018-10-10 15:14:10,725 INFO L226 Difference]: Without dead ends: 345 [2018-10-10 15:14:10,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-10-10 15:14:10,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-10-10 15:14:10,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2018-10-10 15:14:10,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-10-10 15:14:10,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 343 transitions. [2018-10-10 15:14:10,729 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 343 transitions. Word has length 339 [2018-10-10 15:14:10,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:10,729 INFO L481 AbstractCegarLoop]: Abstraction has 343 states and 343 transitions. [2018-10-10 15:14:10,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-10 15:14:10,729 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 343 transitions. [2018-10-10 15:14:10,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-10-10 15:14:10,730 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:10,730 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:14:10,731 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:10,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:10,731 INFO L82 PathProgramCache]: Analyzing trace with hash -544205694, now seen corresponding path program 73 times [2018-10-10 15:14:10,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:13,300 INFO L134 CoverageAnalysis]: Checked inductivity of 7957 backedges. 0 proven. 7957 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:13,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:13,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-10 15:14:13,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-10 15:14:13,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-10 15:14:13,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2853, Invalid=2999, Unknown=0, NotChecked=0, Total=5852 [2018-10-10 15:14:13,301 INFO L87 Difference]: Start difference. First operand 343 states and 343 transitions. Second operand 77 states. [2018-10-10 15:14:17,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:17,135 INFO L93 Difference]: Finished difference Result 348 states and 348 transitions. [2018-10-10 15:14:17,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-10 15:14:17,136 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 342 [2018-10-10 15:14:17,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:17,137 INFO L225 Difference]: With dead ends: 348 [2018-10-10 15:14:17,137 INFO L226 Difference]: Without dead ends: 348 [2018-10-10 15:14:17,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-10-10 15:14:17,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-10-10 15:14:17,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 346. [2018-10-10 15:14:17,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-10-10 15:14:17,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 346 transitions. [2018-10-10 15:14:17,141 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 346 transitions. Word has length 342 [2018-10-10 15:14:17,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:17,141 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 346 transitions. [2018-10-10 15:14:17,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-10 15:14:17,141 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 346 transitions. [2018-10-10 15:14:17,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-10-10 15:14:17,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:17,142 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:14:17,142 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:17,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:17,143 INFO L82 PathProgramCache]: Analyzing trace with hash -982070108, now seen corresponding path program 74 times [2018-10-10 15:14:17,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 8177 backedges. 0 proven. 8177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:19,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:19,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-10 15:14:19,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-10 15:14:19,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-10 15:14:19,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2929, Invalid=3077, Unknown=0, NotChecked=0, Total=6006 [2018-10-10 15:14:19,953 INFO L87 Difference]: Start difference. First operand 346 states and 346 transitions. Second operand 78 states. [2018-10-10 15:14:23,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:23,984 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2018-10-10 15:14:23,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-10 15:14:23,985 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 345 [2018-10-10 15:14:23,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:23,986 INFO L225 Difference]: With dead ends: 351 [2018-10-10 15:14:23,986 INFO L226 Difference]: Without dead ends: 351 [2018-10-10 15:14:23,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-10-10 15:14:23,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-10-10 15:14:23,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2018-10-10 15:14:23,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-10 15:14:23,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2018-10-10 15:14:23,989 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 345 [2018-10-10 15:14:23,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:23,990 INFO L481 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2018-10-10 15:14:23,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-10 15:14:23,990 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2018-10-10 15:14:23,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-10 15:14:23,991 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:23,991 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:14:23,991 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:23,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:23,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1585149630, now seen corresponding path program 75 times [2018-10-10 15:14:23,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:26,619 INFO L134 CoverageAnalysis]: Checked inductivity of 8400 backedges. 0 proven. 8400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:26,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:26,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-10 15:14:26,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-10 15:14:26,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-10 15:14:26,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3006, Invalid=3156, Unknown=0, NotChecked=0, Total=6162 [2018-10-10 15:14:26,621 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 79 states. [2018-10-10 15:14:30,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:30,556 INFO L93 Difference]: Finished difference Result 354 states and 354 transitions. [2018-10-10 15:14:30,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-10 15:14:30,557 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 348 [2018-10-10 15:14:30,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:30,558 INFO L225 Difference]: With dead ends: 354 [2018-10-10 15:14:30,558 INFO L226 Difference]: Without dead ends: 354 [2018-10-10 15:14:30,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-10-10 15:14:30,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-10-10 15:14:30,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2018-10-10 15:14:30,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-10-10 15:14:30,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 352 transitions. [2018-10-10 15:14:30,562 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 352 transitions. Word has length 348 [2018-10-10 15:14:30,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:30,562 INFO L481 AbstractCegarLoop]: Abstraction has 352 states and 352 transitions. [2018-10-10 15:14:30,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-10 15:14:30,563 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 352 transitions. [2018-10-10 15:14:30,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-10-10 15:14:30,564 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:30,564 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:14:30,564 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:30,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:30,564 INFO L82 PathProgramCache]: Analyzing trace with hash -2078990364, now seen corresponding path program 76 times [2018-10-10 15:14:30,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:33,330 INFO L134 CoverageAnalysis]: Checked inductivity of 8626 backedges. 0 proven. 8626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:33,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:33,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-10 15:14:33,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-10 15:14:33,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-10 15:14:33,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3084, Invalid=3236, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 15:14:33,332 INFO L87 Difference]: Start difference. First operand 352 states and 352 transitions. Second operand 80 states. [2018-10-10 15:14:37,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:37,401 INFO L93 Difference]: Finished difference Result 357 states and 357 transitions. [2018-10-10 15:14:37,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-10 15:14:37,401 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 351 [2018-10-10 15:14:37,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:37,403 INFO L225 Difference]: With dead ends: 357 [2018-10-10 15:14:37,403 INFO L226 Difference]: Without dead ends: 357 [2018-10-10 15:14:37,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9164, Invalid=15016, Unknown=0, NotChecked=0, Total=24180 [2018-10-10 15:14:37,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-10-10 15:14:37,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 355. [2018-10-10 15:14:37,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-10-10 15:14:37,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 355 transitions. [2018-10-10 15:14:37,406 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 355 transitions. Word has length 351 [2018-10-10 15:14:37,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:37,407 INFO L481 AbstractCegarLoop]: Abstraction has 355 states and 355 transitions. [2018-10-10 15:14:37,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-10 15:14:37,407 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 355 transitions. [2018-10-10 15:14:37,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-10-10 15:14:37,408 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:37,408 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:14:37,408 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:37,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:37,409 INFO L82 PathProgramCache]: Analyzing trace with hash 469659138, now seen corresponding path program 77 times [2018-10-10 15:14:37,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:40,402 INFO L134 CoverageAnalysis]: Checked inductivity of 8855 backedges. 0 proven. 8855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:40,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:40,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-10 15:14:40,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-10 15:14:40,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-10 15:14:40,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3163, Invalid=3317, Unknown=0, NotChecked=0, Total=6480 [2018-10-10 15:14:40,404 INFO L87 Difference]: Start difference. First operand 355 states and 355 transitions. Second operand 81 states. [2018-10-10 15:14:44,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:44,701 INFO L93 Difference]: Finished difference Result 360 states and 360 transitions. [2018-10-10 15:14:44,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-10 15:14:44,702 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 354 [2018-10-10 15:14:44,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:44,703 INFO L225 Difference]: With dead ends: 360 [2018-10-10 15:14:44,703 INFO L226 Difference]: Without dead ends: 360 [2018-10-10 15:14:44,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9400, Invalid=15406, Unknown=0, NotChecked=0, Total=24806 [2018-10-10 15:14:44,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-10-10 15:14:44,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 358. [2018-10-10 15:14:44,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-10-10 15:14:44,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 358 transitions. [2018-10-10 15:14:44,706 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 358 transitions. Word has length 354 [2018-10-10 15:14:44,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:44,707 INFO L481 AbstractCegarLoop]: Abstraction has 358 states and 358 transitions. [2018-10-10 15:14:44,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-10 15:14:44,707 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 358 transitions. [2018-10-10 15:14:44,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-10-10 15:14:44,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:44,708 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:14:44,708 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:44,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:44,709 INFO L82 PathProgramCache]: Analyzing trace with hash 855114532, now seen corresponding path program 78 times [2018-10-10 15:14:44,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:47,506 INFO L134 CoverageAnalysis]: Checked inductivity of 9087 backedges. 0 proven. 9087 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:47,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:47,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-10 15:14:47,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-10 15:14:47,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-10 15:14:47,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3243, Invalid=3399, Unknown=0, NotChecked=0, Total=6642 [2018-10-10 15:14:47,508 INFO L87 Difference]: Start difference. First operand 358 states and 358 transitions. Second operand 82 states. [2018-10-10 15:14:51,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:51,832 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2018-10-10 15:14:51,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-10 15:14:51,832 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 357 [2018-10-10 15:14:51,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:51,834 INFO L225 Difference]: With dead ends: 363 [2018-10-10 15:14:51,834 INFO L226 Difference]: Without dead ends: 363 [2018-10-10 15:14:51,835 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9639, Invalid=15801, Unknown=0, NotChecked=0, Total=25440 [2018-10-10 15:14:51,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-10-10 15:14:51,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2018-10-10 15:14:51,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-10-10 15:14:51,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2018-10-10 15:14:51,837 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 357 [2018-10-10 15:14:51,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:51,838 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2018-10-10 15:14:51,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-10 15:14:51,838 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2018-10-10 15:14:51,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-10-10 15:14:51,839 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:51,839 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:14:51,839 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:51,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:51,840 INFO L82 PathProgramCache]: Analyzing trace with hash -785792318, now seen corresponding path program 79 times [2018-10-10 15:14:51,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:54,968 INFO L134 CoverageAnalysis]: Checked inductivity of 9322 backedges. 0 proven. 9322 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:54,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:54,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-10 15:14:54,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-10 15:14:54,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-10 15:14:54,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3324, Invalid=3482, Unknown=0, NotChecked=0, Total=6806 [2018-10-10 15:14:54,970 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 83 states. [2018-10-10 15:14:59,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:59,211 INFO L93 Difference]: Finished difference Result 366 states and 366 transitions. [2018-10-10 15:14:59,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-10 15:14:59,211 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 360 [2018-10-10 15:14:59,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:59,212 INFO L225 Difference]: With dead ends: 366 [2018-10-10 15:14:59,213 INFO L226 Difference]: Without dead ends: 366 [2018-10-10 15:14:59,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9881, Invalid=16201, Unknown=0, NotChecked=0, Total=26082 [2018-10-10 15:14:59,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-10-10 15:14:59,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 364. [2018-10-10 15:14:59,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-10 15:14:59,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 364 transitions. [2018-10-10 15:14:59,216 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 364 transitions. Word has length 360 [2018-10-10 15:14:59,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:59,216 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 364 transitions. [2018-10-10 15:14:59,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-10 15:14:59,216 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 364 transitions. [2018-10-10 15:14:59,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-10-10 15:14:59,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:59,217 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:14:59,218 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:59,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:59,218 INFO L82 PathProgramCache]: Analyzing trace with hash 276002404, now seen corresponding path program 80 times [2018-10-10 15:14:59,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:02,412 INFO L134 CoverageAnalysis]: Checked inductivity of 9560 backedges. 0 proven. 9560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:02,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:02,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-10 15:15:02,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-10 15:15:02,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-10 15:15:02,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3406, Invalid=3566, Unknown=0, NotChecked=0, Total=6972 [2018-10-10 15:15:02,413 INFO L87 Difference]: Start difference. First operand 364 states and 364 transitions. Second operand 84 states. [2018-10-10 15:15:06,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:06,820 INFO L93 Difference]: Finished difference Result 369 states and 369 transitions. [2018-10-10 15:15:06,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-10 15:15:06,820 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 363 [2018-10-10 15:15:06,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:06,821 INFO L225 Difference]: With dead ends: 369 [2018-10-10 15:15:06,821 INFO L226 Difference]: Without dead ends: 369 [2018-10-10 15:15:06,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3240 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10126, Invalid=16606, Unknown=0, NotChecked=0, Total=26732 [2018-10-10 15:15:06,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-10-10 15:15:06,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 367. [2018-10-10 15:15:06,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-10-10 15:15:06,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 367 transitions. [2018-10-10 15:15:06,826 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 367 transitions. Word has length 363 [2018-10-10 15:15:06,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:06,826 INFO L481 AbstractCegarLoop]: Abstraction has 367 states and 367 transitions. [2018-10-10 15:15:06,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-10 15:15:06,826 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 367 transitions. [2018-10-10 15:15:06,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-10-10 15:15:06,828 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:06,828 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:15:06,828 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:06,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:06,828 INFO L82 PathProgramCache]: Analyzing trace with hash -231569534, now seen corresponding path program 81 times [2018-10-10 15:15:06,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:10,230 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:10,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:10,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-10 15:15:10,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-10 15:15:10,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-10 15:15:10,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3489, Invalid=3651, Unknown=0, NotChecked=0, Total=7140 [2018-10-10 15:15:10,232 INFO L87 Difference]: Start difference. First operand 367 states and 367 transitions. Second operand 85 states. [2018-10-10 15:15:14,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:14,456 INFO L93 Difference]: Finished difference Result 372 states and 372 transitions. [2018-10-10 15:15:14,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-10 15:15:14,456 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 366 [2018-10-10 15:15:14,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:14,457 INFO L225 Difference]: With dead ends: 372 [2018-10-10 15:15:14,457 INFO L226 Difference]: Without dead ends: 372 [2018-10-10 15:15:14,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10374, Invalid=17016, Unknown=0, NotChecked=0, Total=27390 [2018-10-10 15:15:14,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-10-10 15:15:14,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 370. [2018-10-10 15:15:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-10-10 15:15:14,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 370 transitions. [2018-10-10 15:15:14,462 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 370 transitions. Word has length 366 [2018-10-10 15:15:14,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:14,463 INFO L481 AbstractCegarLoop]: Abstraction has 370 states and 370 transitions. [2018-10-10 15:15:14,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-10 15:15:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 370 transitions. [2018-10-10 15:15:14,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-10-10 15:15:14,464 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:14,464 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:15:14,464 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:14,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:14,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1272674724, now seen corresponding path program 82 times [2018-10-10 15:15:14,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:17,819 INFO L134 CoverageAnalysis]: Checked inductivity of 10045 backedges. 0 proven. 10045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:17,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:17,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-10 15:15:17,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-10 15:15:17,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-10 15:15:17,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3573, Invalid=3737, Unknown=0, NotChecked=0, Total=7310 [2018-10-10 15:15:17,820 INFO L87 Difference]: Start difference. First operand 370 states and 370 transitions. Second operand 86 states. [2018-10-10 15:15:22,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:22,645 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2018-10-10 15:15:22,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-10 15:15:22,646 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 369 [2018-10-10 15:15:22,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:22,647 INFO L225 Difference]: With dead ends: 375 [2018-10-10 15:15:22,647 INFO L226 Difference]: Without dead ends: 375 [2018-10-10 15:15:22,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3403 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10625, Invalid=17431, Unknown=0, NotChecked=0, Total=28056 [2018-10-10 15:15:22,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-10-10 15:15:22,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373. [2018-10-10 15:15:22,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-10-10 15:15:22,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2018-10-10 15:15:22,651 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 369 [2018-10-10 15:15:22,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:22,651 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2018-10-10 15:15:22,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-10 15:15:22,651 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2018-10-10 15:15:22,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-10-10 15:15:22,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:22,653 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:15:22,653 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:22,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:22,653 INFO L82 PathProgramCache]: Analyzing trace with hash 524598338, now seen corresponding path program 83 times [2018-10-10 15:15:22,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:26,138 INFO L134 CoverageAnalysis]: Checked inductivity of 10292 backedges. 0 proven. 10292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:26,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:26,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-10 15:15:26,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-10 15:15:26,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-10 15:15:26,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3658, Invalid=3824, Unknown=0, NotChecked=0, Total=7482 [2018-10-10 15:15:26,140 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 87 states. [2018-10-10 15:15:31,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:31,044 INFO L93 Difference]: Finished difference Result 378 states and 378 transitions. [2018-10-10 15:15:31,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-10 15:15:31,044 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 372 [2018-10-10 15:15:31,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:31,045 INFO L225 Difference]: With dead ends: 378 [2018-10-10 15:15:31,045 INFO L226 Difference]: Without dead ends: 378 [2018-10-10 15:15:31,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10879, Invalid=17851, Unknown=0, NotChecked=0, Total=28730 [2018-10-10 15:15:31,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-10-10 15:15:31,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 376. [2018-10-10 15:15:31,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-10-10 15:15:31,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 376 transitions. [2018-10-10 15:15:31,050 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 376 transitions. Word has length 372 [2018-10-10 15:15:31,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:31,050 INFO L481 AbstractCegarLoop]: Abstraction has 376 states and 376 transitions. [2018-10-10 15:15:31,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-10 15:15:31,050 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 376 transitions. [2018-10-10 15:15:31,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-10-10 15:15:31,051 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:31,051 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:15:31,052 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:31,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:31,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1166281956, now seen corresponding path program 84 times [2018-10-10 15:15:31,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:34,314 INFO L134 CoverageAnalysis]: Checked inductivity of 10542 backedges. 0 proven. 10542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:34,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:34,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-10-10 15:15:34,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-10 15:15:34,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-10 15:15:34,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3744, Invalid=3912, Unknown=0, NotChecked=0, Total=7656 [2018-10-10 15:15:34,316 INFO L87 Difference]: Start difference. First operand 376 states and 376 transitions. Second operand 88 states. [2018-10-10 15:15:39,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:39,203 INFO L93 Difference]: Finished difference Result 381 states and 381 transitions. [2018-10-10 15:15:39,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-10 15:15:39,203 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 375 [2018-10-10 15:15:39,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:39,204 INFO L225 Difference]: With dead ends: 381 [2018-10-10 15:15:39,204 INFO L226 Difference]: Without dead ends: 381 [2018-10-10 15:15:39,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=11136, Invalid=18276, Unknown=0, NotChecked=0, Total=29412 [2018-10-10 15:15:39,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-10 15:15:39,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 379. [2018-10-10 15:15:39,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-10-10 15:15:39,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 379 transitions. [2018-10-10 15:15:39,209 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 379 transitions. Word has length 375 [2018-10-10 15:15:39,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:39,209 INFO L481 AbstractCegarLoop]: Abstraction has 379 states and 379 transitions. [2018-10-10 15:15:39,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-10 15:15:39,209 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 379 transitions. [2018-10-10 15:15:39,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-10-10 15:15:39,211 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:39,211 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:15:39,212 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:39,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:39,212 INFO L82 PathProgramCache]: Analyzing trace with hash 663511298, now seen corresponding path program 85 times [2018-10-10 15:15:39,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:42,797 INFO L134 CoverageAnalysis]: Checked inductivity of 10795 backedges. 0 proven. 10795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:42,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:42,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-10 15:15:42,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-10 15:15:42,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-10 15:15:42,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3831, Invalid=4001, Unknown=0, NotChecked=0, Total=7832 [2018-10-10 15:15:42,799 INFO L87 Difference]: Start difference. First operand 379 states and 379 transitions. Second operand 89 states. [2018-10-10 15:15:47,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:47,871 INFO L93 Difference]: Finished difference Result 384 states and 384 transitions. [2018-10-10 15:15:47,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-10 15:15:47,872 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 378 [2018-10-10 15:15:47,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:47,873 INFO L225 Difference]: With dead ends: 384 [2018-10-10 15:15:47,873 INFO L226 Difference]: Without dead ends: 384 [2018-10-10 15:15:47,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11396, Invalid=18706, Unknown=0, NotChecked=0, Total=30102 [2018-10-10 15:15:47,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-10-10 15:15:47,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 382. [2018-10-10 15:15:47,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-10 15:15:47,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 382 transitions. [2018-10-10 15:15:47,878 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 382 transitions. Word has length 378 [2018-10-10 15:15:47,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:47,878 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 382 transitions. [2018-10-10 15:15:47,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-10 15:15:47,878 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 382 transitions. [2018-10-10 15:15:47,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-10-10 15:15:47,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:47,880 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:15:47,880 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:47,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:47,881 INFO L82 PathProgramCache]: Analyzing trace with hash -826200028, now seen corresponding path program 86 times [2018-10-10 15:15:47,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:51,566 INFO L134 CoverageAnalysis]: Checked inductivity of 11051 backedges. 0 proven. 11051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:51,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:51,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-10 15:15:51,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-10 15:15:51,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-10 15:15:51,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3919, Invalid=4091, Unknown=0, NotChecked=0, Total=8010 [2018-10-10 15:15:51,568 INFO L87 Difference]: Start difference. First operand 382 states and 382 transitions. Second operand 90 states. [2018-10-10 15:15:56,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:56,589 INFO L93 Difference]: Finished difference Result 387 states and 387 transitions. [2018-10-10 15:15:56,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-10 15:15:56,590 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 381 [2018-10-10 15:15:56,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:56,591 INFO L225 Difference]: With dead ends: 387 [2018-10-10 15:15:56,591 INFO L226 Difference]: Without dead ends: 387 [2018-10-10 15:15:56,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3741 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=11659, Invalid=19141, Unknown=0, NotChecked=0, Total=30800 [2018-10-10 15:15:56,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-10-10 15:15:56,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 385. [2018-10-10 15:15:56,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-10-10 15:15:56,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 385 transitions. [2018-10-10 15:15:56,595 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 385 transitions. Word has length 381 [2018-10-10 15:15:56,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:56,595 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 385 transitions. [2018-10-10 15:15:56,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-10 15:15:56,596 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 385 transitions. [2018-10-10 15:15:56,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-10-10 15:15:56,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:56,597 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:15:56,597 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:56,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:56,598 INFO L82 PathProgramCache]: Analyzing trace with hash -919243326, now seen corresponding path program 87 times [2018-10-10 15:15:56,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:00,117 INFO L134 CoverageAnalysis]: Checked inductivity of 11310 backedges. 0 proven. 11310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:16:00,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:00,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-10 15:16:00,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-10 15:16:00,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-10 15:16:00,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4008, Invalid=4182, Unknown=0, NotChecked=0, Total=8190 [2018-10-10 15:16:00,118 INFO L87 Difference]: Start difference. First operand 385 states and 385 transitions. Second operand 91 states. [2018-10-10 15:16:05,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:05,282 INFO L93 Difference]: Finished difference Result 390 states and 390 transitions. [2018-10-10 15:16:05,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-10 15:16:05,283 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 384 [2018-10-10 15:16:05,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:05,284 INFO L225 Difference]: With dead ends: 390 [2018-10-10 15:16:05,284 INFO L226 Difference]: Without dead ends: 390 [2018-10-10 15:16:05,285 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11925, Invalid=19581, Unknown=0, NotChecked=0, Total=31506 [2018-10-10 15:16:05,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-10-10 15:16:05,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 388. [2018-10-10 15:16:05,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-10-10 15:16:05,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 388 transitions. [2018-10-10 15:16:05,288 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 388 transitions. Word has length 384 [2018-10-10 15:16:05,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:05,288 INFO L481 AbstractCegarLoop]: Abstraction has 388 states and 388 transitions. [2018-10-10 15:16:05,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-10 15:16:05,289 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 388 transitions. [2018-10-10 15:16:05,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-10-10 15:16:05,290 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:05,290 INFO L375 BasicCegarLoop]: trace histogram [88, 88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:16:05,290 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:05,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:05,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1776739172, now seen corresponding path program 88 times [2018-10-10 15:16:05,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:09,021 INFO L134 CoverageAnalysis]: Checked inductivity of 11572 backedges. 0 proven. 11572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:16:09,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:09,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-10-10 15:16:09,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-10 15:16:09,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-10 15:16:09,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4098, Invalid=4274, Unknown=0, NotChecked=0, Total=8372 [2018-10-10 15:16:09,023 INFO L87 Difference]: Start difference. First operand 388 states and 388 transitions. Second operand 92 states. [2018-10-10 15:16:14,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:14,394 INFO L93 Difference]: Finished difference Result 393 states and 393 transitions. [2018-10-10 15:16:14,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-10 15:16:14,394 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 387 [2018-10-10 15:16:14,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:14,396 INFO L225 Difference]: With dead ends: 393 [2018-10-10 15:16:14,396 INFO L226 Difference]: Without dead ends: 393 [2018-10-10 15:16:14,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3916 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=12194, Invalid=20026, Unknown=0, NotChecked=0, Total=32220 [2018-10-10 15:16:14,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-10-10 15:16:14,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 391. [2018-10-10 15:16:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-10-10 15:16:14,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 391 transitions. [2018-10-10 15:16:14,401 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 391 transitions. Word has length 387 [2018-10-10 15:16:14,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:14,401 INFO L481 AbstractCegarLoop]: Abstraction has 391 states and 391 transitions. [2018-10-10 15:16:14,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-10 15:16:14,401 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 391 transitions. [2018-10-10 15:16:14,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-10-10 15:16:14,403 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:14,403 INFO L375 BasicCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:16:14,403 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:14,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:14,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1902901890, now seen corresponding path program 89 times [2018-10-10 15:16:14,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:18,321 INFO L134 CoverageAnalysis]: Checked inductivity of 11837 backedges. 0 proven. 11837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:16:18,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:18,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-10 15:16:18,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-10 15:16:18,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-10 15:16:18,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4189, Invalid=4367, Unknown=0, NotChecked=0, Total=8556 [2018-10-10 15:16:18,323 INFO L87 Difference]: Start difference. First operand 391 states and 391 transitions. Second operand 93 states. [2018-10-10 15:16:23,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:23,823 INFO L93 Difference]: Finished difference Result 396 states and 396 transitions. [2018-10-10 15:16:23,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-10 15:16:23,824 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 390 [2018-10-10 15:16:23,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:23,825 INFO L225 Difference]: With dead ends: 396 [2018-10-10 15:16:23,825 INFO L226 Difference]: Without dead ends: 396 [2018-10-10 15:16:23,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12466, Invalid=20476, Unknown=0, NotChecked=0, Total=32942 [2018-10-10 15:16:23,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-10-10 15:16:23,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 394. [2018-10-10 15:16:23,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-10-10 15:16:23,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 394 transitions. [2018-10-10 15:16:23,829 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 394 transitions. Word has length 390 [2018-10-10 15:16:23,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:23,829 INFO L481 AbstractCegarLoop]: Abstraction has 394 states and 394 transitions. [2018-10-10 15:16:23,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-10 15:16:23,829 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 394 transitions. [2018-10-10 15:16:23,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2018-10-10 15:16:23,831 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:23,831 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:16:23,831 INFO L424 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:23,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:23,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1974917468, now seen corresponding path program 90 times [2018-10-10 15:16:23,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:27,733 INFO L134 CoverageAnalysis]: Checked inductivity of 12105 backedges. 0 proven. 12105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:16:27,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:27,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-10-10 15:16:27,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-10 15:16:27,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-10 15:16:27,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4281, Invalid=4461, Unknown=0, NotChecked=0, Total=8742 [2018-10-10 15:16:27,735 INFO L87 Difference]: Start difference. First operand 394 states and 394 transitions. Second operand 94 states. [2018-10-10 15:16:33,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:33,130 INFO L93 Difference]: Finished difference Result 399 states and 399 transitions. [2018-10-10 15:16:33,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-10 15:16:33,131 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 393 [2018-10-10 15:16:33,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:33,132 INFO L225 Difference]: With dead ends: 399 [2018-10-10 15:16:33,132 INFO L226 Difference]: Without dead ends: 399 [2018-10-10 15:16:33,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4095 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12741, Invalid=20931, Unknown=0, NotChecked=0, Total=33672 [2018-10-10 15:16:33,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-10-10 15:16:33,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 397. [2018-10-10 15:16:33,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-10-10 15:16:33,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 397 transitions. [2018-10-10 15:16:33,136 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 397 transitions. Word has length 393 [2018-10-10 15:16:33,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:33,136 INFO L481 AbstractCegarLoop]: Abstraction has 397 states and 397 transitions. [2018-10-10 15:16:33,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-10 15:16:33,136 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 397 transitions. [2018-10-10 15:16:33,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-10-10 15:16:33,138 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:33,138 INFO L375 BasicCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:16:33,138 INFO L424 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:33,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:33,138 INFO L82 PathProgramCache]: Analyzing trace with hash -61083838, now seen corresponding path program 91 times [2018-10-10 15:16:33,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:37,119 INFO L134 CoverageAnalysis]: Checked inductivity of 12376 backedges. 0 proven. 12376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:16:37,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:37,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-10 15:16:37,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-10 15:16:37,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-10 15:16:37,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4374, Invalid=4556, Unknown=0, NotChecked=0, Total=8930 [2018-10-10 15:16:37,120 INFO L87 Difference]: Start difference. First operand 397 states and 397 transitions. Second operand 95 states. [2018-10-10 15:16:42,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:42,628 INFO L93 Difference]: Finished difference Result 402 states and 402 transitions. [2018-10-10 15:16:42,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-10 15:16:42,628 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 396 [2018-10-10 15:16:42,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:42,630 INFO L225 Difference]: With dead ends: 402 [2018-10-10 15:16:42,630 INFO L226 Difference]: Without dead ends: 402 [2018-10-10 15:16:42,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=13019, Invalid=21391, Unknown=0, NotChecked=0, Total=34410 [2018-10-10 15:16:42,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-10-10 15:16:42,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2018-10-10 15:16:42,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-10-10 15:16:42,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 400 transitions. [2018-10-10 15:16:42,634 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 400 transitions. Word has length 396 [2018-10-10 15:16:42,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:42,634 INFO L481 AbstractCegarLoop]: Abstraction has 400 states and 400 transitions. [2018-10-10 15:16:42,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-10 15:16:42,635 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 400 transitions. [2018-10-10 15:16:42,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-10-10 15:16:42,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:42,636 INFO L375 BasicCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:16:42,636 INFO L424 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:42,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:42,637 INFO L82 PathProgramCache]: Analyzing trace with hash -734266908, now seen corresponding path program 92 times [2018-10-10 15:16:42,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:46,566 INFO L134 CoverageAnalysis]: Checked inductivity of 12650 backedges. 0 proven. 12650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:16:46,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:46,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-10-10 15:16:46,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-10 15:16:46,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-10 15:16:46,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4468, Invalid=4652, Unknown=0, NotChecked=0, Total=9120 [2018-10-10 15:16:46,568 INFO L87 Difference]: Start difference. First operand 400 states and 400 transitions. Second operand 96 states. [2018-10-10 15:16:52,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:52,558 INFO L93 Difference]: Finished difference Result 405 states and 405 transitions. [2018-10-10 15:16:52,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-10 15:16:52,559 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 399 [2018-10-10 15:16:52,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:52,560 INFO L225 Difference]: With dead ends: 405 [2018-10-10 15:16:52,560 INFO L226 Difference]: Without dead ends: 405 [2018-10-10 15:16:52,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4278 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=13300, Invalid=21856, Unknown=0, NotChecked=0, Total=35156 [2018-10-10 15:16:52,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-10-10 15:16:52,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 403. [2018-10-10 15:16:52,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-10 15:16:52,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 403 transitions. [2018-10-10 15:16:52,565 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 403 transitions. Word has length 399 [2018-10-10 15:16:52,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:52,565 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 403 transitions. [2018-10-10 15:16:52,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-10 15:16:52,565 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 403 transitions. [2018-10-10 15:16:52,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-10-10 15:16:52,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:52,567 INFO L375 BasicCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:16:52,567 INFO L424 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:52,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:52,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1966167042, now seen corresponding path program 93 times [2018-10-10 15:16:52,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:56,561 INFO L134 CoverageAnalysis]: Checked inductivity of 12927 backedges. 0 proven. 12927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:16:56,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:56,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-10 15:16:56,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-10 15:16:56,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-10 15:16:56,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4563, Invalid=4749, Unknown=0, NotChecked=0, Total=9312 [2018-10-10 15:16:56,562 INFO L87 Difference]: Start difference. First operand 403 states and 403 transitions. Second operand 97 states. [2018-10-10 15:17:02,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:02,448 INFO L93 Difference]: Finished difference Result 406 states and 406 transitions. [2018-10-10 15:17:02,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-10 15:17:02,448 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 402 [2018-10-10 15:17:02,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:02,450 INFO L225 Difference]: With dead ends: 406 [2018-10-10 15:17:02,450 INFO L226 Difference]: Without dead ends: 406 [2018-10-10 15:17:02,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4371 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=13584, Invalid=22326, Unknown=0, NotChecked=0, Total=35910 [2018-10-10 15:17:02,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-10-10 15:17:02,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2018-10-10 15:17:02,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-10-10 15:17:02,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 406 transitions. [2018-10-10 15:17:02,454 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 406 transitions. Word has length 402 [2018-10-10 15:17:02,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:02,454 INFO L481 AbstractCegarLoop]: Abstraction has 406 states and 406 transitions. [2018-10-10 15:17:02,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-10 15:17:02,454 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 406 transitions. [2018-10-10 15:17:02,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-10-10 15:17:02,456 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:02,456 INFO L375 BasicCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:02,456 INFO L424 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:02,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:02,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1561550116, now seen corresponding path program 94 times [2018-10-10 15:17:02,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:02,959 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13207 trivial. 0 not checked. [2018-10-10 15:17:02,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:17:02,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 15:17:02,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 15:17:02,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 15:17:02,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-10 15:17:02,960 INFO L87 Difference]: Start difference. First operand 406 states and 406 transitions. Second operand 7 states. [2018-10-10 15:17:04,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:04,144 INFO L93 Difference]: Finished difference Result 404 states and 404 transitions. [2018-10-10 15:17:04,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 15:17:04,145 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 405 [2018-10-10 15:17:04,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:04,145 INFO L225 Difference]: With dead ends: 404 [2018-10-10 15:17:04,146 INFO L226 Difference]: Without dead ends: 0 [2018-10-10 15:17:04,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-10-10 15:17:04,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-10 15:17:04,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-10 15:17:04,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-10 15:17:04,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-10 15:17:04,147 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 405 [2018-10-10 15:17:04,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:04,147 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-10 15:17:04,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 15:17:04,147 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-10 15:17:04,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-10 15:17:04,152 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_31.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 03:17:04 BoogieIcfgContainer [2018-10-10 15:17:04,152 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 15:17:04,153 INFO L168 Benchmark]: Toolchain (without parser) took 371059.54 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -114.8 MB). Free memory was 1.4 GB in the beginning and 906.6 MB in the end (delta: 535.5 MB). Peak memory consumption was 420.6 MB. Max. memory is 7.1 GB. [2018-10-10 15:17:04,154 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 15:17:04,154 INFO L168 Benchmark]: Boogie Preprocessor took 85.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 15:17:04,155 INFO L168 Benchmark]: RCFGBuilder took 1007.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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-10 15:17:04,155 INFO L168 Benchmark]: TraceAbstraction took 369961.91 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -114.8 MB). Free memory was 1.4 GB in the beginning and 906.6 MB in the end (delta: 493.2 MB). Peak memory consumption was 378.3 MB. Max. memory is 7.1 GB. [2018-10-10 15:17:04,158 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 85.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1007.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 369961.91 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -114.8 MB). Free memory was 1.4 GB in the beginning and 906.6 MB in the end (delta: 493.2 MB). Peak memory consumption was 378.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 196]: 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, 128 locations, 1 error locations. SAFE Result, 369.8s OverallTime, 95 OverallIterations, 94 TraceHistogramMax, 212.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11393 SDtfs, 27573 SDslu, 410724 SDs, 0 SdLazy, 31608 SolverSat, 4606 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9135 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 8939 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138419 ImplicationChecksByTransitivity, 315.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=406occurred in iteration=94, 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.3s AutomataMinimizationTime, 95 MinimizatonAttempts, 186 StatesRemovedByMinimization, 93 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 148.2s InterpolantComputationTime, 25080 NumberOfCodeBlocks, 25080 NumberOfCodeBlocksAsserted, 95 NumberOfCheckSat, 24985 ConstructedInterpolants, 0 QuantifiedInterpolants, 24119411 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 95 InterpolantComputations, 2 PerfectInterpolantSequences, 13207/419710 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/20051113-1.c_false-valid-memtrack.i_31.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-10_15-17-04-168.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_31.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-10_15-17-04-168.csv Received shutdown request...