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_20.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 15:10:52,662 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 15:10:52,665 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 15:10:52,683 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 15:10:52,683 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 15:10:52,684 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 15:10:52,686 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 15:10:52,688 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 15:10:52,693 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 15:10:52,695 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 15:10:52,696 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 15:10:52,696 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 15:10:52,697 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 15:10:52,699 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 15:10:52,706 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 15:10:52,706 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 15:10:52,707 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 15:10:52,711 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 15:10:52,714 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 15:10:52,716 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 15:10:52,717 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 15:10:52,721 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 15:10:52,723 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 15:10:52,723 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 15:10:52,723 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 15:10:52,728 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 15:10:52,729 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 15:10:52,730 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 15:10:52,730 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 15:10:52,731 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 15:10:52,731 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 15:10:52,732 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 15:10:52,732 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 15:10:52,732 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 15:10:52,733 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 15:10:52,734 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 15:10:52,734 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,744 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 15:10:52,744 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 15:10:52,745 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 15:10:52,745 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 15:10:52,745 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 15:10:52,746 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 15:10:52,746 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 15:10:52,747 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 15:10:52,747 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 15:10:52,747 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 15:10:52,747 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 15:10:52,747 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 15:10:52,748 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 15:10:52,748 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 15:10:52,749 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 15:10:52,806 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 15:10:52,822 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 15:10:52,828 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 15:10:52,830 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 15:10:52,831 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 15:10:52,831 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_20.bpl [2018-10-10 15:10:52,832 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_20.bpl' [2018-10-10 15:10:52,918 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 15:10:52,922 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-10 15:10:52,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 15:10:52,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 15:10:52,923 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 15:10:52,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:52" (1/1) ... [2018-10-10 15:10:52,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:52" (1/1) ... [2018-10-10 15:10:52,976 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:52" (1/1) ... [2018-10-10 15:10:52,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:52" (1/1) ... [2018-10-10 15:10:52,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:52" (1/1) ... [2018-10-10 15:10:52,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:52" (1/1) ... [2018-10-10 15:10:52,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:52" (1/1) ... [2018-10-10 15:10:53,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 15:10:53,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 15:10:53,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 15:10:53,003 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 15:10:53,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "20051113-1.c_false-valid-memtrack.i_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-10 15:10:53,066 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 15:10:53,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 15:10:53,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 15:10:53,959 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 15:10:53,960 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:10:53 BoogieIcfgContainer [2018-10-10 15:10:53,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 15:10:53,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 15:10:53,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 15:10:53,965 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 15:10:53,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:52" (1/2) ... [2018-10-10 15:10:53,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dd7f0e8 and model type 20051113-1.c_false-valid-memtrack.i_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 03:10:53, skipping insertion in model container [2018-10-10 15:10:53,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:10:53" (2/2) ... [2018-10-10 15:10:53,968 INFO L112 eAbstractionObserver]: Analyzing ICFG 20051113-1.c_false-valid-memtrack.i_20.bpl [2018-10-10 15:10:53,979 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 15:10:53,988 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 15:10:54,008 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 15:10:54,039 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 15:10:54,040 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 15:10:54,040 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 15:10:54,040 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 15:10:54,040 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 15:10:54,040 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 15:10:54,041 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 15:10:54,041 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 15:10:54,041 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 15:10:54,063 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2018-10-10 15:10:54,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-10 15:10:54,077 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:54,079 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] [2018-10-10 15:10:54,080 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:54,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:54,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1202403498, now seen corresponding path program 1 times [2018-10-10 15:10:54,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:54,532 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,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:10:54,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 15:10:54,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 15:10:54,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 15:10:54,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 15:10:54,561 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 4 states. [2018-10-10 15:10:54,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:54,704 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-10-10 15:10:54,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 15:10:54,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-10-10 15:10:54,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:54,719 INFO L225 Difference]: With dead ends: 101 [2018-10-10 15:10:54,719 INFO L226 Difference]: Without dead ends: 101 [2018-10-10 15:10:54,721 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,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-10 15:10:54,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-10-10 15:10:54,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-10 15:10:54,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-10-10 15:10:54,769 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 95 [2018-10-10 15:10:54,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:54,770 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-10-10 15:10:54,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 15:10:54,770 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-10-10 15:10:54,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-10 15:10:54,774 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:54,774 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] [2018-10-10 15:10:54,775 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:54,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:54,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1329452404, now seen corresponding path program 1 times [2018-10-10 15:10:54,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:54,954 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:54,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:54,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-10 15:10:54,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 15:10:54,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 15:10:54,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 15:10:54,958 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 5 states. [2018-10-10 15:10:55,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:55,179 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-10-10 15:10:55,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 15:10:55,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-10-10 15:10:55,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:55,185 INFO L225 Difference]: With dead ends: 104 [2018-10-10 15:10:55,185 INFO L226 Difference]: Without dead ends: 104 [2018-10-10 15:10:55,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:10:55,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-10 15:10:55,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2018-10-10 15:10:55,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-10 15:10:55,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-10-10 15:10:55,209 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 98 [2018-10-10 15:10:55,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:55,210 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-10-10 15:10:55,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 15:10:55,210 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-10-10 15:10:55,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-10 15:10:55,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:55,217 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] [2018-10-10 15:10:55,218 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:55,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:55,219 INFO L82 PathProgramCache]: Analyzing trace with hash -367023466, now seen corresponding path program 2 times [2018-10-10 15:10:55,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:55,533 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,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:55,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-10 15:10:55,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 15:10:55,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 15:10:55,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:10:55,536 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 6 states. [2018-10-10 15:10:55,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:55,656 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-10-10 15:10:55,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 15:10:55,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2018-10-10 15:10:55,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:55,662 INFO L225 Difference]: With dead ends: 107 [2018-10-10 15:10:55,662 INFO L226 Difference]: Without dead ends: 107 [2018-10-10 15:10:55,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:10:55,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-10 15:10:55,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-10-10 15:10:55,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-10 15:10:55,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-10-10 15:10:55,672 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 101 [2018-10-10 15:10:55,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:55,673 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-10-10 15:10:55,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 15:10:55,673 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-10-10 15:10:55,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-10 15:10:55,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:55,675 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] [2018-10-10 15:10:55,676 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:55,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:55,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1199494604, now seen corresponding path program 3 times [2018-10-10 15:10:55,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:55,821 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:55,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:55,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-10 15:10:55,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 15:10:55,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 15:10:55,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-10 15:10:55,823 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 7 states. [2018-10-10 15:10:56,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:56,163 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-10-10 15:10:56,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 15:10:56,164 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-10-10 15:10:56,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:56,166 INFO L225 Difference]: With dead ends: 110 [2018-10-10 15:10:56,166 INFO L226 Difference]: Without dead ends: 110 [2018-10-10 15:10:56,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:10:56,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-10 15:10:56,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-10-10 15:10:56,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-10 15:10:56,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-10-10 15:10:56,176 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 104 [2018-10-10 15:10:56,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:56,177 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-10-10 15:10:56,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 15:10:56,177 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-10-10 15:10:56,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-10 15:10:56,179 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:56,179 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] [2018-10-10 15:10:56,180 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:56,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:56,180 INFO L82 PathProgramCache]: Analyzing trace with hash 2088967638, now seen corresponding path program 4 times [2018-10-10 15:10:56,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:56,529 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:56,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:56,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 15:10:56,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:10:56,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:10:56,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:10:56,531 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 8 states. [2018-10-10 15:10:56,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:56,752 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-10-10 15:10:56,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 15:10:56,756 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 107 [2018-10-10 15:10:56,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:56,758 INFO L225 Difference]: With dead ends: 113 [2018-10-10 15:10:56,758 INFO L226 Difference]: Without dead ends: 113 [2018-10-10 15:10:56,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:10:56,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-10 15:10:56,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2018-10-10 15:10:56,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-10 15:10:56,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-10-10 15:10:56,775 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 107 [2018-10-10 15:10:56,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:56,779 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-10-10 15:10:56,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:10:56,779 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-10-10 15:10:56,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-10 15:10:56,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:56,785 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] [2018-10-10 15:10:56,785 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:56,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:56,788 INFO L82 PathProgramCache]: Analyzing trace with hash 463597300, now seen corresponding path program 5 times [2018-10-10 15:10:56,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:57,153 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,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:57,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-10 15:10:57,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 15:10:57,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 15:10:57,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-10 15:10:57,155 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 9 states. [2018-10-10 15:10:57,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:57,360 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-10-10 15:10:57,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 15:10:57,366 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2018-10-10 15:10:57,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:57,367 INFO L225 Difference]: With dead ends: 116 [2018-10-10 15:10:57,368 INFO L226 Difference]: Without dead ends: 116 [2018-10-10 15:10:57,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:10:57,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-10 15:10:57,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-10-10 15:10:57,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-10 15:10:57,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-10-10 15:10:57,375 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 110 [2018-10-10 15:10:57,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:57,376 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-10-10 15:10:57,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 15:10:57,376 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-10-10 15:10:57,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-10 15:10:57,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:57,380 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] [2018-10-10 15:10:57,381 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:57,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:57,381 INFO L82 PathProgramCache]: Analyzing trace with hash 517153046, now seen corresponding path program 6 times [2018-10-10 15:10:57,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:57,742 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:57,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:57,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 15:10:57,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:10:57,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:10:57,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:10:57,744 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 10 states. [2018-10-10 15:10:57,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:58,000 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-10-10 15:10:58,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 15:10:58,000 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2018-10-10 15:10:58,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:58,002 INFO L225 Difference]: With dead ends: 119 [2018-10-10 15:10:58,002 INFO L226 Difference]: Without dead ends: 119 [2018-10-10 15:10:58,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:10:58,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-10 15:10:58,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-10-10 15:10:58,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-10 15:10:58,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-10-10 15:10:58,009 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 113 [2018-10-10 15:10:58,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:58,009 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-10-10 15:10:58,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:10:58,010 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-10-10 15:10:58,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-10 15:10:58,011 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:58,011 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] [2018-10-10 15:10:58,012 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:58,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:58,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1731451980, now seen corresponding path program 7 times [2018-10-10 15:10:58,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:58,211 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,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:58,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-10 15:10:58,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 15:10:58,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 15:10:58,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-10 15:10:58,213 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 11 states. [2018-10-10 15:10:58,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:58,395 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-10-10 15:10:58,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 15:10:58,402 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 116 [2018-10-10 15:10:58,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:58,403 INFO L225 Difference]: With dead ends: 122 [2018-10-10 15:10:58,403 INFO L226 Difference]: Without dead ends: 122 [2018-10-10 15:10:58,404 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:58,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-10 15:10:58,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-10-10 15:10:58,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-10 15:10:58,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-10-10 15:10:58,412 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 116 [2018-10-10 15:10:58,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:58,412 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-10-10 15:10:58,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 15:10:58,412 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-10-10 15:10:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-10 15:10:58,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:58,414 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] [2018-10-10 15:10:58,415 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:58,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:58,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1318865834, now seen corresponding path program 8 times [2018-10-10 15:10:58,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:58,881 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:58,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:58,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 15:10:58,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 15:10:58,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 15:10:58,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:10:58,883 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 12 states. [2018-10-10 15:10:59,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:59,258 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-10-10 15:10:59,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 15:10:59,259 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 119 [2018-10-10 15:10:59,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:59,260 INFO L225 Difference]: With dead ends: 125 [2018-10-10 15:10:59,260 INFO L226 Difference]: Without dead ends: 125 [2018-10-10 15:10:59,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:10:59,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-10 15:10:59,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-10-10 15:10:59,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-10 15:10:59,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-10-10 15:10:59,275 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 119 [2018-10-10 15:10:59,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:59,275 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-10-10 15:10:59,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 15:10:59,276 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-10-10 15:10:59,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-10 15:10:59,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:59,277 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] [2018-10-10 15:10:59,281 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:59,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:59,281 INFO L82 PathProgramCache]: Analyzing trace with hash 2133575796, now seen corresponding path program 9 times [2018-10-10 15:10:59,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:59,574 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,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:59,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-10 15:10:59,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 15:10:59,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 15:10:59,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-10 15:10:59,576 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 13 states. [2018-10-10 15:10:59,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:59,887 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-10-10 15:10:59,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 15:10:59,888 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 122 [2018-10-10 15:10:59,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:59,889 INFO L225 Difference]: With dead ends: 128 [2018-10-10 15:10:59,889 INFO L226 Difference]: Without dead ends: 128 [2018-10-10 15:10:59,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:10:59,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-10 15:10:59,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-10-10 15:10:59,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-10 15:10:59,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-10-10 15:10:59,893 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 122 [2018-10-10 15:10:59,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:59,893 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-10-10 15:10:59,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 15:10:59,894 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-10-10 15:10:59,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-10 15:10:59,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:59,895 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] [2018-10-10 15:10:59,895 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:59,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:59,896 INFO L82 PathProgramCache]: Analyzing trace with hash -2054629482, now seen corresponding path program 10 times [2018-10-10 15:10:59,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:00,188 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,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:00,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 15:11:00,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 15:11:00,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 15:11:00,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:11:00,190 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 14 states. [2018-10-10 15:11:00,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:00,384 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-10-10 15:11:00,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 15:11:00,385 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 125 [2018-10-10 15:11:00,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:00,386 INFO L225 Difference]: With dead ends: 131 [2018-10-10 15:11:00,386 INFO L226 Difference]: Without dead ends: 131 [2018-10-10 15:11:00,387 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,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-10 15:11:00,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2018-10-10 15:11:00,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-10 15:11:00,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-10-10 15:11:00,390 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 125 [2018-10-10 15:11:00,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:00,391 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-10-10 15:11:00,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 15:11:00,391 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-10-10 15:11:00,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-10 15:11:00,392 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:00,392 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] [2018-10-10 15:11:00,392 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:00,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:00,393 INFO L82 PathProgramCache]: Analyzing trace with hash 216849716, now seen corresponding path program 11 times [2018-10-10 15:11:00,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:00,755 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:00,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:00,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 15:11:00,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 15:11:00,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 15:11:00,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:11:00,757 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 15 states. [2018-10-10 15:11:01,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:01,433 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-10-10 15:11:01,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 15:11:01,434 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 128 [2018-10-10 15:11:01,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:01,434 INFO L225 Difference]: With dead ends: 134 [2018-10-10 15:11:01,434 INFO L226 Difference]: Without dead ends: 134 [2018-10-10 15:11:01,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:11:01,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-10 15:11:01,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2018-10-10 15:11:01,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-10 15:11:01,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-10-10 15:11:01,439 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 128 [2018-10-10 15:11:01,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:01,439 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-10-10 15:11:01,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 15:11:01,440 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-10-10 15:11:01,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-10 15:11:01,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:01,440 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] [2018-10-10 15:11:01,441 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:01,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:01,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1651078442, now seen corresponding path program 12 times [2018-10-10 15:11:01,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:01,712 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:01,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:01,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 15:11:01,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 15:11:01,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 15:11:01,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=132, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:11:01,714 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 16 states. [2018-10-10 15:11:02,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:02,041 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-10-10 15:11:02,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 15:11:02,041 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 131 [2018-10-10 15:11:02,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:02,042 INFO L225 Difference]: With dead ends: 137 [2018-10-10 15:11:02,042 INFO L226 Difference]: Without dead ends: 137 [2018-10-10 15:11:02,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:11:02,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-10 15:11:02,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-10-10 15:11:02,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-10 15:11:02,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-10-10 15:11:02,047 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 131 [2018-10-10 15:11:02,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:02,048 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-10-10 15:11:02,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 15:11:02,048 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-10-10 15:11:02,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-10 15:11:02,049 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:02,049 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] [2018-10-10 15:11:02,050 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:02,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:02,050 INFO L82 PathProgramCache]: Analyzing trace with hash 792420852, now seen corresponding path program 13 times [2018-10-10 15:11:02,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:02,724 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:02,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:02,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-10 15:11:02,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 15:11:02,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 15:11:02,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=149, Unknown=0, NotChecked=0, Total=272 [2018-10-10 15:11:02,726 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 17 states. [2018-10-10 15:11:03,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:03,067 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-10-10 15:11:03,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 15:11:03,071 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 134 [2018-10-10 15:11:03,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:03,072 INFO L225 Difference]: With dead ends: 140 [2018-10-10 15:11:03,072 INFO L226 Difference]: Without dead ends: 140 [2018-10-10 15:11:03,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:11:03,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-10 15:11:03,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2018-10-10 15:11:03,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-10-10 15:11:03,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-10-10 15:11:03,076 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 134 [2018-10-10 15:11:03,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:03,076 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-10-10 15:11:03,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 15:11:03,076 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-10-10 15:11:03,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-10 15:11:03,077 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:03,077 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] [2018-10-10 15:11:03,078 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:03,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:03,078 INFO L82 PathProgramCache]: Analyzing trace with hash -320811498, now seen corresponding path program 14 times [2018-10-10 15:11:03,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:03,376 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:03,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:03,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 15:11:03,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 15:11:03,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 15:11:03,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:11:03,378 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 18 states. [2018-10-10 15:11:03,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:03,738 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-10-10 15:11:03,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 15:11:03,747 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 137 [2018-10-10 15:11:03,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:03,748 INFO L225 Difference]: With dead ends: 143 [2018-10-10 15:11:03,748 INFO L226 Difference]: Without dead ends: 143 [2018-10-10 15:11:03,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-10-10 15:11:03,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-10 15:11:03,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-10-10 15:11:03,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-10 15:11:03,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-10-10 15:11:03,752 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 137 [2018-10-10 15:11:03,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:03,753 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-10-10 15:11:03,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 15:11:03,753 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-10-10 15:11:03,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-10 15:11:03,754 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:03,754 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] [2018-10-10 15:11:03,754 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:03,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:03,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1111709364, now seen corresponding path program 15 times [2018-10-10 15:11:03,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:04,261 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:04,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:04,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 15:11:04,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 15:11:04,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 15:11:04,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=186, Unknown=0, NotChecked=0, Total=342 [2018-10-10 15:11:04,264 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 19 states. [2018-10-10 15:11:04,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:04,833 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-10-10 15:11:04,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 15:11:04,834 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 140 [2018-10-10 15:11:04,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:04,835 INFO L225 Difference]: With dead ends: 146 [2018-10-10 15:11:04,835 INFO L226 Difference]: Without dead ends: 146 [2018-10-10 15:11:04,836 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:04,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-10 15:11:04,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-10-10 15:11:04,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-10 15:11:04,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-10-10 15:11:04,840 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 140 [2018-10-10 15:11:04,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:04,841 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-10-10 15:11:04,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 15:11:04,841 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-10-10 15:11:04,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-10 15:11:04,842 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:04,842 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] [2018-10-10 15:11:04,842 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:04,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:04,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1749311146, now seen corresponding path program 16 times [2018-10-10 15:11:04,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:05,370 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:05,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:05,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 15:11:05,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 15:11:05,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 15:11:05,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=206, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:11:05,372 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 20 states. [2018-10-10 15:11:05,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:05,731 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-10-10 15:11:05,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 15:11:05,732 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 143 [2018-10-10 15:11:05,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:05,732 INFO L225 Difference]: With dead ends: 149 [2018-10-10 15:11:05,733 INFO L226 Difference]: Without dead ends: 149 [2018-10-10 15:11:05,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:11:05,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-10 15:11:05,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2018-10-10 15:11:05,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-10 15:11:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-10-10 15:11:05,737 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 143 [2018-10-10 15:11:05,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:05,737 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-10-10 15:11:05,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 15:11:05,737 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-10-10 15:11:05,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-10 15:11:05,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:05,738 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] [2018-10-10 15:11:05,739 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:05,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:05,739 INFO L82 PathProgramCache]: Analyzing trace with hash -785335436, now seen corresponding path program 17 times [2018-10-10 15:11:05,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:06,071 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:06,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:06,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 15:11:06,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 15:11:06,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 15:11:06,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=227, Unknown=0, NotChecked=0, Total=420 [2018-10-10 15:11:06,073 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 21 states. [2018-10-10 15:11:06,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:06,538 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-10-10 15:11:06,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 15:11:06,539 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 146 [2018-10-10 15:11:06,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:06,540 INFO L225 Difference]: With dead ends: 152 [2018-10-10 15:11:06,540 INFO L226 Difference]: Without dead ends: 152 [2018-10-10 15:11:06,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 15:11:06,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-10 15:11:06,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-10-10 15:11:06,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-10 15:11:06,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-10-10 15:11:06,545 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 146 [2018-10-10 15:11:06,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:06,545 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-10-10 15:11:06,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 15:11:06,545 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-10-10 15:11:06,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-10 15:11:06,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:06,546 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] [2018-10-10 15:11:06,546 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:06,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:06,547 INFO L82 PathProgramCache]: Analyzing trace with hash 863700118, now seen corresponding path program 18 times [2018-10-10 15:11:06,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:06,860 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:06,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:06,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 15:11:06,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 15:11:06,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 15:11:06,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:11:06,862 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 22 states. [2018-10-10 15:11:07,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:07,405 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-10-10 15:11:07,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 15:11:07,405 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 149 [2018-10-10 15:11:07,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:07,406 INFO L225 Difference]: With dead ends: 155 [2018-10-10 15:11:07,406 INFO L226 Difference]: Without dead ends: 155 [2018-10-10 15:11:07,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:11:07,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-10 15:11:07,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2018-10-10 15:11:07,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-10 15:11:07,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-10-10 15:11:07,410 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 149 [2018-10-10 15:11:07,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:07,410 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-10-10 15:11:07,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 15:11:07,410 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-10-10 15:11:07,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-10 15:11:07,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:07,411 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] [2018-10-10 15:11:07,411 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:07,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:07,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1445957684, now seen corresponding path program 19 times [2018-10-10 15:11:07,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:08,218 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:08,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:08,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 15:11:08,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 15:11:08,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 15:11:08,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=272, Unknown=0, NotChecked=0, Total=506 [2018-10-10 15:11:08,220 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 23 states. [2018-10-10 15:11:08,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:08,634 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-10-10 15:11:08,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-10 15:11:08,635 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 152 [2018-10-10 15:11:08,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:08,636 INFO L225 Difference]: With dead ends: 158 [2018-10-10 15:11:08,636 INFO L226 Difference]: Without dead ends: 158 [2018-10-10 15:11:08,636 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:11:08,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-10 15:11:08,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2018-10-10 15:11:08,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-10 15:11:08,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-10-10 15:11:08,640 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 152 [2018-10-10 15:11:08,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:08,640 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-10-10 15:11:08,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 15:11:08,640 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-10-10 15:11:08,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-10 15:11:08,641 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:08,642 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] [2018-10-10 15:11:08,642 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:08,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:08,642 INFO L82 PathProgramCache]: Analyzing trace with hash 108197846, now seen corresponding path program 20 times [2018-10-10 15:11:08,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:09,660 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:09,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:09,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 15:11:09,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 15:11:09,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 15:11:09,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:11:09,662 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 24 states. [2018-10-10 15:11:10,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:10,274 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-10-10 15:11:10,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 15:11:10,277 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 155 [2018-10-10 15:11:10,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:10,278 INFO L225 Difference]: With dead ends: 161 [2018-10-10 15:11:10,278 INFO L226 Difference]: Without dead ends: 161 [2018-10-10 15:11:10,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 15:11:10,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-10 15:11:10,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2018-10-10 15:11:10,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-10 15:11:10,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-10-10 15:11:10,282 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 155 [2018-10-10 15:11:10,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:10,283 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-10-10 15:11:10,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 15:11:10,283 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-10-10 15:11:10,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-10 15:11:10,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:10,284 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] [2018-10-10 15:11:10,284 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:10,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:10,285 INFO L82 PathProgramCache]: Analyzing trace with hash -93596428, now seen corresponding path program 21 times [2018-10-10 15:11:10,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:11,023 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:11,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:11,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 15:11:11,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 15:11:11,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 15:11:11,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=321, Unknown=0, NotChecked=0, Total=600 [2018-10-10 15:11:11,025 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 25 states. [2018-10-10 15:11:11,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:11,677 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-10-10 15:11:11,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 15:11:11,679 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 158 [2018-10-10 15:11:11,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:11,680 INFO L225 Difference]: With dead ends: 164 [2018-10-10 15:11:11,680 INFO L226 Difference]: Without dead ends: 164 [2018-10-10 15:11:11,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 15:11:11,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-10 15:11:11,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2018-10-10 15:11:11,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-10 15:11:11,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-10-10 15:11:11,685 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 158 [2018-10-10 15:11:11,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:11,685 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-10-10 15:11:11,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 15:11:11,685 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-10-10 15:11:11,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-10 15:11:11,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:11,686 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] [2018-10-10 15:11:11,687 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:11,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:11,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1207401238, now seen corresponding path program 22 times [2018-10-10 15:11:11,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:12,081 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:12,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:12,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 15:11:12,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 15:11:12,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 15:11:12,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:11:12,082 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 26 states. [2018-10-10 15:11:12,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:12,711 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-10-10 15:11:12,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-10 15:11:12,712 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 161 [2018-10-10 15:11:12,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:12,713 INFO L225 Difference]: With dead ends: 167 [2018-10-10 15:11:12,713 INFO L226 Difference]: Without dead ends: 167 [2018-10-10 15:11:12,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:11:12,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-10 15:11:12,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-10-10 15:11:12,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-10 15:11:12,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-10-10 15:11:12,717 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 161 [2018-10-10 15:11:12,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:12,717 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-10-10 15:11:12,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 15:11:12,717 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-10-10 15:11:12,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-10 15:11:12,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:12,718 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] [2018-10-10 15:11:12,719 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:12,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:12,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1443989940, now seen corresponding path program 23 times [2018-10-10 15:11:12,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:13,823 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:13,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:13,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 15:11:13,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 15:11:13,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 15:11:13,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=374, Unknown=0, NotChecked=0, Total=702 [2018-10-10 15:11:13,825 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 27 states. [2018-10-10 15:11:14,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:14,654 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-10-10 15:11:14,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 15:11:14,655 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 164 [2018-10-10 15:11:14,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:14,656 INFO L225 Difference]: With dead ends: 170 [2018-10-10 15:11:14,656 INFO L226 Difference]: Without dead ends: 170 [2018-10-10 15:11:14,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 15:11:14,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-10 15:11:14,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2018-10-10 15:11:14,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-10-10 15:11:14,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-10-10 15:11:14,660 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 164 [2018-10-10 15:11:14,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:14,660 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-10-10 15:11:14,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 15:11:14,660 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-10-10 15:11:14,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-10 15:11:14,661 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:14,661 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] [2018-10-10 15:11:14,662 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:14,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:14,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1616678486, now seen corresponding path program 24 times [2018-10-10 15:11:14,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:15,894 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:15,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:15,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 15:11:15,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 15:11:15,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 15:11:15,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=402, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:11:15,896 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 28 states. [2018-10-10 15:11:16,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:16,646 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-10-10 15:11:16,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-10 15:11:16,646 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 167 [2018-10-10 15:11:16,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:16,647 INFO L225 Difference]: With dead ends: 173 [2018-10-10 15:11:16,647 INFO L226 Difference]: Without dead ends: 173 [2018-10-10 15:11:16,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 15:11:16,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-10 15:11:16,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2018-10-10 15:11:16,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-10 15:11:16,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-10 15:11:16,651 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 167 [2018-10-10 15:11:16,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:16,652 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-10 15:11:16,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 15:11:16,652 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-10 15:11:16,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-10 15:11:16,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:16,653 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] [2018-10-10 15:11:16,653 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:16,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:16,654 INFO L82 PathProgramCache]: Analyzing trace with hash 810331764, now seen corresponding path program 25 times [2018-10-10 15:11:16,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:17,160 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:17,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:17,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-10 15:11:17,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-10 15:11:17,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-10 15:11:17,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=431, Unknown=0, NotChecked=0, Total=812 [2018-10-10 15:11:17,162 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 29 states. [2018-10-10 15:11:17,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:17,903 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-10-10 15:11:17,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 15:11:17,907 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 170 [2018-10-10 15:11:17,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:17,908 INFO L225 Difference]: With dead ends: 176 [2018-10-10 15:11:17,908 INFO L226 Difference]: Without dead ends: 176 [2018-10-10 15:11:17,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 15:11:17,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-10 15:11:17,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2018-10-10 15:11:17,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-10-10 15:11:17,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-10-10 15:11:17,913 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 170 [2018-10-10 15:11:17,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:17,913 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-10-10 15:11:17,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-10 15:11:17,914 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-10-10 15:11:17,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-10 15:11:17,914 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:17,915 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] [2018-10-10 15:11:17,915 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:17,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:17,915 INFO L82 PathProgramCache]: Analyzing trace with hash 687223190, now seen corresponding path program 26 times [2018-10-10 15:11:17,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:18,872 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:18,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:18,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 15:11:18,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 15:11:18,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 15:11:18,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:11:18,874 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 30 states. [2018-10-10 15:11:19,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:19,871 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-10-10 15:11:19,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 15:11:19,871 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 173 [2018-10-10 15:11:19,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:19,872 INFO L225 Difference]: With dead ends: 179 [2018-10-10 15:11:19,872 INFO L226 Difference]: Without dead ends: 179 [2018-10-10 15:11:19,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 15:11:19,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-10 15:11:19,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2018-10-10 15:11:19,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-10 15:11:19,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-10-10 15:11:19,876 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 173 [2018-10-10 15:11:19,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:19,877 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-10-10 15:11:19,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 15:11:19,877 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-10-10 15:11:19,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-10 15:11:19,878 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:19,878 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] [2018-10-10 15:11:19,878 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:19,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:19,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1061765940, now seen corresponding path program 27 times [2018-10-10 15:11:19,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:20,358 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:20,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:20,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 15:11:20,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 15:11:20,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 15:11:20,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=492, Unknown=0, NotChecked=0, Total=930 [2018-10-10 15:11:20,360 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 31 states. [2018-10-10 15:11:21,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:21,133 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-10-10 15:11:21,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 15:11:21,134 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 176 [2018-10-10 15:11:21,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:21,135 INFO L225 Difference]: With dead ends: 182 [2018-10-10 15:11:21,135 INFO L226 Difference]: Without dead ends: 182 [2018-10-10 15:11:21,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 15:11:21,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-10 15:11:21,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-10-10 15:11:21,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-10 15:11:21,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-10-10 15:11:21,141 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 176 [2018-10-10 15:11:21,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:21,141 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-10-10 15:11:21,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 15:11:21,141 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-10-10 15:11:21,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-10 15:11:21,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:21,143 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] [2018-10-10 15:11:21,143 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:21,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:21,143 INFO L82 PathProgramCache]: Analyzing trace with hash 739796182, now seen corresponding path program 28 times [2018-10-10 15:11:21,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:21,702 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:21,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:21,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 15:11:21,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 15:11:21,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 15:11:21,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=524, Unknown=0, NotChecked=0, Total=992 [2018-10-10 15:11:21,704 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 32 states. [2018-10-10 15:11:22,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:22,543 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-10-10 15:11:22,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-10 15:11:22,543 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 179 [2018-10-10 15:11:22,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:22,544 INFO L225 Difference]: With dead ends: 185 [2018-10-10 15:11:22,544 INFO L226 Difference]: Without dead ends: 185 [2018-10-10 15:11:22,545 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 15:11:22,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-10 15:11:22,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2018-10-10 15:11:22,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-10 15:11:22,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-10-10 15:11:22,549 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 179 [2018-10-10 15:11:22,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:22,549 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-10-10 15:11:22,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 15:11:22,549 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-10-10 15:11:22,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-10 15:11:22,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:22,550 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] [2018-10-10 15:11:22,551 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:22,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:22,551 INFO L82 PathProgramCache]: Analyzing trace with hash -399292428, now seen corresponding path program 29 times [2018-10-10 15:11:22,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:23,162 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:23,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:23,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-10 15:11:23,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-10 15:11:23,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-10 15:11:23,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=557, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 15:11:23,163 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 33 states. [2018-10-10 15:11:24,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:24,072 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-10-10 15:11:24,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-10 15:11:24,072 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 182 [2018-10-10 15:11:24,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:24,074 INFO L225 Difference]: With dead ends: 188 [2018-10-10 15:11:24,074 INFO L226 Difference]: Without dead ends: 188 [2018-10-10 15:11:24,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 15:11:24,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-10 15:11:24,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2018-10-10 15:11:24,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-10 15:11:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-10-10 15:11:24,080 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 182 [2018-10-10 15:11:24,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:24,080 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-10-10 15:11:24,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-10 15:11:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-10-10 15:11:24,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-10 15:11:24,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:24,081 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] [2018-10-10 15:11:24,082 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:24,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:24,082 INFO L82 PathProgramCache]: Analyzing trace with hash -451467242, now seen corresponding path program 30 times [2018-10-10 15:11:24,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:25,814 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:25,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:25,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 15:11:25,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 15:11:25,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 15:11:25,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=591, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:11:25,816 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 34 states. [2018-10-10 15:11:26,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:26,766 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-10-10 15:11:26,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 15:11:26,766 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 185 [2018-10-10 15:11:26,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:26,767 INFO L225 Difference]: With dead ends: 191 [2018-10-10 15:11:26,767 INFO L226 Difference]: Without dead ends: 191 [2018-10-10 15:11:26,769 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 15:11:26,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-10 15:11:26,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2018-10-10 15:11:26,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-10 15:11:26,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-10-10 15:11:26,772 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 185 [2018-10-10 15:11:26,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:26,772 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-10-10 15:11:26,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 15:11:26,772 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-10-10 15:11:26,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-10 15:11:26,774 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:26,774 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] [2018-10-10 15:11:26,774 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:26,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:26,774 INFO L82 PathProgramCache]: Analyzing trace with hash -13189964, now seen corresponding path program 31 times [2018-10-10 15:11:26,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:27,716 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:27,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:27,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-10 15:11:27,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 15:11:27,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 15:11:27,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=626, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 15:11:27,718 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 35 states. [2018-10-10 15:11:28,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:28,704 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-10-10 15:11:28,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-10 15:11:28,704 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 188 [2018-10-10 15:11:28,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:28,705 INFO L225 Difference]: With dead ends: 194 [2018-10-10 15:11:28,705 INFO L226 Difference]: Without dead ends: 194 [2018-10-10 15:11:28,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 15:11:28,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-10 15:11:28,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2018-10-10 15:11:28,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-10-10 15:11:28,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-10-10 15:11:28,710 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 188 [2018-10-10 15:11:28,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:28,710 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-10-10 15:11:28,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 15:11:28,710 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-10-10 15:11:28,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-10 15:11:28,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:28,711 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] [2018-10-10 15:11:28,711 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:28,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:28,711 INFO L82 PathProgramCache]: Analyzing trace with hash 4619094, now seen corresponding path program 32 times [2018-10-10 15:11:28,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:29,675 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:29,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:29,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 15:11:29,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 15:11:29,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 15:11:29,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=662, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:11:29,677 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 36 states. [2018-10-10 15:11:30,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:30,687 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-10-10 15:11:30,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-10 15:11:30,688 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 191 [2018-10-10 15:11:30,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:30,689 INFO L225 Difference]: With dead ends: 197 [2018-10-10 15:11:30,689 INFO L226 Difference]: Without dead ends: 197 [2018-10-10 15:11:30,690 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 15:11:30,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-10 15:11:30,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2018-10-10 15:11:30,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-10 15:11:30,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-10-10 15:11:30,693 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 191 [2018-10-10 15:11:30,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:30,693 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-10-10 15:11:30,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 15:11:30,693 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-10-10 15:11:30,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-10 15:11:30,694 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:30,694 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] [2018-10-10 15:11:30,695 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:30,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:30,695 INFO L82 PathProgramCache]: Analyzing trace with hash -2021678732, now seen corresponding path program 33 times [2018-10-10 15:11:30,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:31,626 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:31,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:31,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-10 15:11:31,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 15:11:31,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 15:11:31,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=633, Invalid=699, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 15:11:31,628 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 37 states. [2018-10-10 15:11:32,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:32,713 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-10-10 15:11:32,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 15:11:32,713 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 194 [2018-10-10 15:11:32,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:32,714 INFO L225 Difference]: With dead ends: 200 [2018-10-10 15:11:32,714 INFO L226 Difference]: Without dead ends: 200 [2018-10-10 15:11:32,715 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:32,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-10 15:11:32,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2018-10-10 15:11:32,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-10 15:11:32,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-10-10 15:11:32,718 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 194 [2018-10-10 15:11:32,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:32,718 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-10-10 15:11:32,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 15:11:32,719 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-10-10 15:11:32,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-10 15:11:32,720 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:32,720 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] [2018-10-10 15:11:32,720 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:32,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:32,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1694867818, now seen corresponding path program 34 times [2018-10-10 15:11:32,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:33,711 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:33,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:33,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 15:11:33,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 15:11:33,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 15:11:33,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 15:11:33,713 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 38 states. [2018-10-10 15:11:35,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:35,747 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-10-10 15:11:35,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-10 15:11:35,747 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 197 [2018-10-10 15:11:35,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:35,748 INFO L225 Difference]: With dead ends: 203 [2018-10-10 15:11:35,748 INFO L226 Difference]: Without dead ends: 203 [2018-10-10 15:11:35,749 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:35,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-10 15:11:35,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2018-10-10 15:11:35,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-10 15:11:35,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-10-10 15:11:35,751 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 197 [2018-10-10 15:11:35,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:35,752 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-10-10 15:11:35,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 15:11:35,752 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-10-10 15:11:35,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-10 15:11:35,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:35,753 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] [2018-10-10 15:11:35,753 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:35,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:35,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1933178420, now seen corresponding path program 35 times [2018-10-10 15:11:35,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:36,678 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:36,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:36,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-10 15:11:36,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 15:11:36,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 15:11:36,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=776, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 15:11:36,680 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 39 states. [2018-10-10 15:11:37,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:37,802 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-10-10 15:11:37,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 15:11:37,802 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 200 [2018-10-10 15:11:37,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:37,803 INFO L225 Difference]: With dead ends: 206 [2018-10-10 15:11:37,803 INFO L226 Difference]: Without dead ends: 206 [2018-10-10 15:11:37,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 15:11:37,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-10 15:11:37,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2018-10-10 15:11:37,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-10 15:11:37,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2018-10-10 15:11:37,806 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 200 [2018-10-10 15:11:37,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:37,806 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2018-10-10 15:11:37,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 15:11:37,806 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2018-10-10 15:11:37,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-10 15:11:37,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:37,807 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] [2018-10-10 15:11:37,808 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:37,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:37,808 INFO L82 PathProgramCache]: Analyzing trace with hash -2088316458, now seen corresponding path program 36 times [2018-10-10 15:11:37,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:38,862 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:38,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:38,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 15:11:38,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 15:11:38,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 15:11:38,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=816, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:11:38,864 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 40 states. [2018-10-10 15:11:40,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:40,364 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-10-10 15:11:40,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-10 15:11:40,364 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 203 [2018-10-10 15:11:40,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:40,365 INFO L225 Difference]: With dead ends: 209 [2018-10-10 15:11:40,365 INFO L226 Difference]: Without dead ends: 209 [2018-10-10 15:11:40,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-10-10 15:11:40,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-10 15:11:40,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2018-10-10 15:11:40,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-10 15:11:40,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-10-10 15:11:40,371 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 203 [2018-10-10 15:11:40,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:40,371 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-10-10 15:11:40,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 15:11:40,371 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-10-10 15:11:40,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-10 15:11:40,372 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:40,372 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] [2018-10-10 15:11:40,373 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:40,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:40,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1670494964, now seen corresponding path program 37 times [2018-10-10 15:11:40,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:41,257 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:41,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:41,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-10 15:11:41,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-10 15:11:41,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-10 15:11:41,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=857, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 15:11:41,259 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 41 states. [2018-10-10 15:11:42,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:42,669 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2018-10-10 15:11:42,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-10 15:11:42,669 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 206 [2018-10-10 15:11:42,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:42,671 INFO L225 Difference]: With dead ends: 212 [2018-10-10 15:11:42,671 INFO L226 Difference]: Without dead ends: 212 [2018-10-10 15:11:42,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-10-10 15:11:42,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-10-10 15:11:42,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2018-10-10 15:11:42,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-10 15:11:42,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-10-10 15:11:42,674 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 206 [2018-10-10 15:11:42,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:42,675 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-10-10 15:11:42,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-10 15:11:42,675 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-10-10 15:11:42,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-10 15:11:42,676 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:42,676 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] [2018-10-10 15:11:42,676 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:42,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:42,676 INFO L82 PathProgramCache]: Analyzing trace with hash 2034226454, now seen corresponding path program 38 times [2018-10-10 15:11:42,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:43,747 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:43,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:43,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 15:11:43,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 15:11:43,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 15:11:43,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=899, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:11:43,748 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 42 states. [2018-10-10 15:11:45,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:45,186 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-10-10 15:11:45,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-10 15:11:45,187 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 209 [2018-10-10 15:11:45,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:45,188 INFO L225 Difference]: With dead ends: 215 [2018-10-10 15:11:45,188 INFO L226 Difference]: Without dead ends: 215 [2018-10-10 15:11:45,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 15:11:45,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-10 15:11:45,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-10-10 15:11:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-10 15:11:45,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-10-10 15:11:45,191 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 209 [2018-10-10 15:11:45,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:45,192 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-10-10 15:11:45,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 15:11:45,192 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-10-10 15:11:45,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-10 15:11:45,193 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:45,193 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] [2018-10-10 15:11:45,193 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:45,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:45,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1756557236, now seen corresponding path program 39 times [2018-10-10 15:11:45,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:46,103 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:46,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:46,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-10 15:11:46,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 15:11:46,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 15:11:46,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=864, Invalid=942, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 15:11:46,105 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 43 states. [2018-10-10 15:11:47,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:47,464 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-10-10 15:11:47,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 15:11:47,464 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 212 [2018-10-10 15:11:47,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:47,465 INFO L225 Difference]: With dead ends: 218 [2018-10-10 15:11:47,465 INFO L226 Difference]: Without dead ends: 218 [2018-10-10 15:11:47,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-10-10 15:11:47,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-10 15:11:47,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2018-10-10 15:11:47,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-10 15:11:47,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-10-10 15:11:47,470 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 212 [2018-10-10 15:11:47,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:47,471 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-10-10 15:11:47,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 15:11:47,471 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-10-10 15:11:47,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-10 15:11:47,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:47,472 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] [2018-10-10 15:11:47,472 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:47,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:47,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1819895894, now seen corresponding path program 40 times [2018-10-10 15:11:47,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:48,899 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:48,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:48,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 15:11:48,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 15:11:48,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 15:11:48,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=906, Invalid=986, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 15:11:48,900 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 44 states. [2018-10-10 15:11:50,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:50,537 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-10-10 15:11:50,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-10 15:11:50,537 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 215 [2018-10-10 15:11:50,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:50,538 INFO L225 Difference]: With dead ends: 221 [2018-10-10 15:11:50,538 INFO L226 Difference]: Without dead ends: 221 [2018-10-10 15:11:50,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-10-10 15:11:50,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-10 15:11:50,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2018-10-10 15:11:50,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-10 15:11:50,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-10-10 15:11:50,542 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 215 [2018-10-10 15:11:50,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:50,542 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-10-10 15:11:50,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 15:11:50,542 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-10-10 15:11:50,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-10 15:11:50,543 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:50,543 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] [2018-10-10 15:11:50,544 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:50,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:50,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1043753868, now seen corresponding path program 41 times [2018-10-10 15:11:50,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:52,114 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:52,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:52,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-10 15:11:52,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-10 15:11:52,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-10 15:11:52,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1031, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 15:11:52,115 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 45 states. [2018-10-10 15:11:53,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:53,633 INFO L93 Difference]: Finished difference Result 224 states and 224 transitions. [2018-10-10 15:11:53,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 15:11:53,633 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 218 [2018-10-10 15:11:53,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:53,634 INFO L225 Difference]: With dead ends: 224 [2018-10-10 15:11:53,634 INFO L226 Difference]: Without dead ends: 224 [2018-10-10 15:11:53,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-10-10 15:11:53,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-10-10 15:11:53,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2018-10-10 15:11:53,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-10 15:11:53,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2018-10-10 15:11:53,638 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 218 [2018-10-10 15:11:53,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:53,639 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2018-10-10 15:11:53,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-10 15:11:53,639 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2018-10-10 15:11:53,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-10 15:11:53,640 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:53,640 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] [2018-10-10 15:11:53,640 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:53,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:53,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1098413162, now seen corresponding path program 42 times [2018-10-10 15:11:53,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:54,711 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:54,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:54,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 15:11:54,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 15:11:54,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 15:11:54,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=1077, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 15:11:54,712 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 46 states. [2018-10-10 15:11:56,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:56,371 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-10-10 15:11:56,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-10 15:11:56,371 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 221 [2018-10-10 15:11:56,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:56,372 INFO L225 Difference]: With dead ends: 227 [2018-10-10 15:11:56,372 INFO L226 Difference]: Without dead ends: 227 [2018-10-10 15:11:56,373 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:56,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-10 15:11:56,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2018-10-10 15:11:56,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-10 15:11:56,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-10-10 15:11:56,377 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 221 [2018-10-10 15:11:56,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:56,377 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-10-10 15:11:56,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 15:11:56,377 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-10-10 15:11:56,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-10 15:11:56,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:56,378 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] [2018-10-10 15:11:56,378 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:56,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:56,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1660835532, now seen corresponding path program 43 times [2018-10-10 15:11:56,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:57,522 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:57,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:57,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-10 15:11:57,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-10 15:11:57,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-10 15:11:57,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1038, Invalid=1124, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 15:11:57,524 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 47 states. [2018-10-10 15:11:58,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:58,965 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-10-10 15:11:58,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-10 15:11:58,965 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 224 [2018-10-10 15:11:58,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:58,966 INFO L225 Difference]: With dead ends: 230 [2018-10-10 15:11:58,966 INFO L226 Difference]: Without dead ends: 230 [2018-10-10 15:11:58,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-10-10 15:11:58,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-10 15:11:58,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2018-10-10 15:11:58,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-10-10 15:11:58,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2018-10-10 15:11:58,969 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 224 [2018-10-10 15:11:58,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:58,969 INFO L481 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2018-10-10 15:11:58,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-10 15:11:58,969 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2018-10-10 15:11:58,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-10 15:11:58,970 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:58,970 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] [2018-10-10 15:11:58,971 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:58,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:58,971 INFO L82 PathProgramCache]: Analyzing trace with hash -2118238506, now seen corresponding path program 44 times [2018-10-10 15:11:58,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:00,449 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:00,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:00,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 15:12:00,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 15:12:00,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 15:12:00,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1084, Invalid=1172, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:12:00,451 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 48 states. [2018-10-10 15:12:02,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:02,044 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-10-10 15:12:02,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-10 15:12:02,045 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 227 [2018-10-10 15:12:02,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:02,046 INFO L225 Difference]: With dead ends: 233 [2018-10-10 15:12:02,046 INFO L226 Difference]: Without dead ends: 233 [2018-10-10 15:12:02,046 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-10-10 15:12:02,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-10 15:12:02,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2018-10-10 15:12:02,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-10 15:12:02,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-10-10 15:12:02,049 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 227 [2018-10-10 15:12:02,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:02,049 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-10-10 15:12:02,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 15:12:02,049 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-10-10 15:12:02,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-10 15:12:02,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:02,050 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] [2018-10-10 15:12:02,050 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:02,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:02,050 INFO L82 PathProgramCache]: Analyzing trace with hash -679006732, now seen corresponding path program 45 times [2018-10-10 15:12:02,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:03,270 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:03,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:03,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-10 15:12:03,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-10 15:12:03,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-10 15:12:03,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1131, Invalid=1221, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 15:12:03,272 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 49 states. [2018-10-10 15:12:04,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:04,781 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-10-10 15:12:04,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-10 15:12:04,782 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 230 [2018-10-10 15:12:04,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:04,783 INFO L225 Difference]: With dead ends: 236 [2018-10-10 15:12:04,783 INFO L226 Difference]: Without dead ends: 236 [2018-10-10 15:12:04,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-10-10 15:12:04,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-10-10 15:12:04,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2018-10-10 15:12:04,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-10-10 15:12:04,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 234 transitions. [2018-10-10 15:12:04,787 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 234 transitions. Word has length 230 [2018-10-10 15:12:04,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:04,787 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 234 transitions. [2018-10-10 15:12:04,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-10 15:12:04,787 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 234 transitions. [2018-10-10 15:12:04,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-10 15:12:04,789 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:04,789 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] [2018-10-10 15:12:04,789 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:04,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:04,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1183743466, now seen corresponding path program 46 times [2018-10-10 15:12:04,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:06,379 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:06,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:06,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-10 15:12:06,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-10 15:12:06,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-10 15:12:06,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1179, Invalid=1271, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 15:12:06,380 INFO L87 Difference]: Start difference. First operand 234 states and 234 transitions. Second operand 50 states. [2018-10-10 15:12:08,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:08,003 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-10-10 15:12:08,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-10 15:12:08,003 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 233 [2018-10-10 15:12:08,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:08,004 INFO L225 Difference]: With dead ends: 239 [2018-10-10 15:12:08,004 INFO L226 Difference]: Without dead ends: 239 [2018-10-10 15:12:08,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-10-10 15:12:08,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-10 15:12:08,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2018-10-10 15:12:08,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-10 15:12:08,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-10-10 15:12:08,008 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 233 [2018-10-10 15:12:08,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:08,009 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-10-10 15:12:08,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-10 15:12:08,009 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-10-10 15:12:08,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-10 15:12:08,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:08,010 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] [2018-10-10 15:12:08,010 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:08,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:08,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1115282764, now seen corresponding path program 47 times [2018-10-10 15:12:08,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:09,213 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:09,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:09,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-10 15:12:09,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-10 15:12:09,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-10 15:12:09,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1228, Invalid=1322, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 15:12:09,215 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 51 states. [2018-10-10 15:12:11,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:11,073 INFO L93 Difference]: Finished difference Result 242 states and 242 transitions. [2018-10-10 15:12:11,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-10 15:12:11,074 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 236 [2018-10-10 15:12:11,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:11,075 INFO L225 Difference]: With dead ends: 242 [2018-10-10 15:12:11,075 INFO L226 Difference]: Without dead ends: 242 [2018-10-10 15:12:11,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-10-10 15:12:11,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-10-10 15:12:11,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2018-10-10 15:12:11,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-10 15:12:11,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 240 transitions. [2018-10-10 15:12:11,079 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 240 transitions. Word has length 236 [2018-10-10 15:12:11,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:11,079 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 240 transitions. [2018-10-10 15:12:11,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-10 15:12:11,079 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 240 transitions. [2018-10-10 15:12:11,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-10 15:12:11,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:11,080 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] [2018-10-10 15:12:11,081 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:11,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:11,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1711975082, now seen corresponding path program 48 times [2018-10-10 15:12:11,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:12,296 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:12,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:12,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-10 15:12:12,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-10 15:12:12,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-10 15:12:12,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1278, Invalid=1374, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 15:12:12,298 INFO L87 Difference]: Start difference. First operand 240 states and 240 transitions. Second operand 52 states. [2018-10-10 15:12:14,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:14,017 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-10-10 15:12:14,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 15:12:14,017 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 239 [2018-10-10 15:12:14,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:14,019 INFO L225 Difference]: With dead ends: 245 [2018-10-10 15:12:14,019 INFO L226 Difference]: Without dead ends: 245 [2018-10-10 15:12:14,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-10-10 15:12:14,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-10 15:12:14,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-10-10 15:12:14,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-10 15:12:14,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-10-10 15:12:14,023 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 239 [2018-10-10 15:12:14,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:14,023 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-10-10 15:12:14,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-10 15:12:14,023 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-10-10 15:12:14,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-10 15:12:14,024 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:14,024 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] [2018-10-10 15:12:14,025 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:14,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:14,025 INFO L82 PathProgramCache]: Analyzing trace with hash -903182476, now seen corresponding path program 49 times [2018-10-10 15:12:14,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:15,423 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:15,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:15,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-10 15:12:15,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-10 15:12:15,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-10 15:12:15,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1329, Invalid=1427, Unknown=0, NotChecked=0, Total=2756 [2018-10-10 15:12:15,425 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 53 states. [2018-10-10 15:12:17,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:17,580 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-10-10 15:12:17,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-10 15:12:17,580 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 242 [2018-10-10 15:12:17,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:17,581 INFO L225 Difference]: With dead ends: 248 [2018-10-10 15:12:17,581 INFO L226 Difference]: Without dead ends: 248 [2018-10-10 15:12:17,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-10-10 15:12:17,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-10 15:12:17,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 246. [2018-10-10 15:12:17,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-10-10 15:12:17,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-10-10 15:12:17,585 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 242 [2018-10-10 15:12:17,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:17,586 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-10-10 15:12:17,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-10 15:12:17,586 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-10-10 15:12:17,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-10 15:12:17,587 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:17,587 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] [2018-10-10 15:12:17,588 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:17,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:17,588 INFO L82 PathProgramCache]: Analyzing trace with hash -929187690, now seen corresponding path program 50 times [2018-10-10 15:12:17,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:18,945 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:18,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:18,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-10 15:12:18,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-10 15:12:18,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-10 15:12:18,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1381, Invalid=1481, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 15:12:18,947 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 54 states. [2018-10-10 15:12:21,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:21,042 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-10-10 15:12:21,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-10 15:12:21,043 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 245 [2018-10-10 15:12:21,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:21,044 INFO L225 Difference]: With dead ends: 251 [2018-10-10 15:12:21,045 INFO L226 Difference]: Without dead ends: 251 [2018-10-10 15:12:21,045 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:21,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-10 15:12:21,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2018-10-10 15:12:21,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-10 15:12:21,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-10-10 15:12:21,048 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 245 [2018-10-10 15:12:21,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:21,049 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-10-10 15:12:21,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-10 15:12:21,049 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-10-10 15:12:21,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-10 15:12:21,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:21,051 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] [2018-10-10 15:12:21,051 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:21,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:21,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1738562612, now seen corresponding path program 51 times [2018-10-10 15:12:21,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:22,640 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:22,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:22,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-10 15:12:22,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-10 15:12:22,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-10 15:12:22,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1434, Invalid=1536, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 15:12:22,642 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 55 states. [2018-10-10 15:12:24,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:24,559 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2018-10-10 15:12:24,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-10 15:12:24,560 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 248 [2018-10-10 15:12:24,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:24,561 INFO L225 Difference]: With dead ends: 254 [2018-10-10 15:12:24,561 INFO L226 Difference]: Without dead ends: 254 [2018-10-10 15:12:24,562 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:24,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-10 15:12:24,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2018-10-10 15:12:24,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-10-10 15:12:24,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2018-10-10 15:12:24,564 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 248 [2018-10-10 15:12:24,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:24,565 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2018-10-10 15:12:24,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-10 15:12:24,565 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2018-10-10 15:12:24,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-10-10 15:12:24,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:24,566 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] [2018-10-10 15:12:24,567 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:24,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:24,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1682002986, now seen corresponding path program 52 times [2018-10-10 15:12:24,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:26,411 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:26,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:26,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-10 15:12:26,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-10 15:12:26,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-10 15:12:26,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1488, Invalid=1592, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 15:12:26,413 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 56 states. [2018-10-10 15:12:28,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:28,440 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-10-10 15:12:28,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-10 15:12:28,441 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 251 [2018-10-10 15:12:28,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:28,442 INFO L225 Difference]: With dead ends: 257 [2018-10-10 15:12:28,442 INFO L226 Difference]: Without dead ends: 257 [2018-10-10 15:12:28,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-10-10 15:12:28,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-10-10 15:12:28,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2018-10-10 15:12:28,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-10 15:12:28,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-10-10 15:12:28,446 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 251 [2018-10-10 15:12:28,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:28,447 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-10-10 15:12:28,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-10 15:12:28,447 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-10-10 15:12:28,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-10 15:12:28,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:28,448 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] [2018-10-10 15:12:28,449 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:28,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:28,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1357668108, now seen corresponding path program 53 times [2018-10-10 15:12:28,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:28,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4187 trivial. 0 not checked. [2018-10-10 15:12:28,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:12:28,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 15:12:28,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:12:28,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:12:28,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:12:28,837 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 10 states. [2018-10-10 15:12:30,261 WARN L178 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-10 15:12:30,678 WARN L178 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-10-10 15:12:31,118 WARN L178 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-10 15:12:31,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:31,129 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-10-10 15:12:31,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 15:12:31,130 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 254 [2018-10-10 15:12:31,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:31,130 INFO L225 Difference]: With dead ends: 253 [2018-10-10 15:12:31,130 INFO L226 Difference]: Without dead ends: 0 [2018-10-10 15:12:31,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:12:31,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-10 15:12:31,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-10 15:12:31,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-10 15:12:31,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-10 15:12:31,131 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 254 [2018-10-10 15:12:31,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:31,132 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-10 15:12:31,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:12:31,132 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-10 15:12:31,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-10 15:12:31,137 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 03:12:31 BoogieIcfgContainer [2018-10-10 15:12:31,139 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 15:12:31,140 INFO L168 Benchmark]: Toolchain (without parser) took 98221.15 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 551.0 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 582.8 MB. Max. memory is 7.1 GB. [2018-10-10 15:12:31,141 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 15:12:31,141 INFO L168 Benchmark]: Boogie Preprocessor took 79.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 15:12:31,141 INFO L168 Benchmark]: RCFGBuilder took 957.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-10 15:12:31,142 INFO L168 Benchmark]: TraceAbstraction took 97177.64 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 551.0 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 18.2 kB). Peak memory consumption was 551.0 MB. Max. memory is 7.1 GB. [2018-10-10 15:12:31,145 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 79.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 957.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 97177.64 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 551.0 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 18.2 kB). Peak memory consumption was 551.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 167]: 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, 100 locations, 1 error locations. SAFE Result, 97.1s OverallTime, 54 OverallIterations, 53 TraceHistogramMax, 52.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4941 SDtfs, 10047 SDslu, 92495 SDs, 0 SdLazy, 9911 SolverSat, 1507 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2984 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 2876 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24810 ImplicationChecksByTransitivity, 76.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=255occurred in iteration=53, 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.2s AutomataMinimizationTime, 54 MinimizatonAttempts, 106 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 41.1s InterpolantComputationTime, 9423 NumberOfCodeBlocks, 9423 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 9369 ConstructedInterpolants, 0 QuantifiedInterpolants, 5742965 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 54 InterpolantComputations, 2 PerfectInterpolantSequences, 4187/75843 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_20.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-10_15-12-31-165.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_20.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-10_15-12-31-165.csv Received shutdown request...