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/960521-1_1_false-valid-free.i_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 15:17:06,747 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 15:17:06,750 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 15:17:06,765 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 15:17:06,766 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 15:17:06,768 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 15:17:06,769 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 15:17:06,771 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 15:17:06,774 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 15:17:06,776 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 15:17:06,778 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 15:17:06,778 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 15:17:06,779 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 15:17:06,782 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 15:17:06,789 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 15:17:06,790 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 15:17:06,794 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 15:17:06,796 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 15:17:06,802 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 15:17:06,805 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 15:17:06,809 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 15:17:06,810 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 15:17:06,814 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 15:17:06,814 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 15:17:06,814 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 15:17:06,815 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 15:17:06,820 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 15:17:06,821 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 15:17:06,821 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 15:17:06,824 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 15:17:06,824 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 15:17:06,826 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 15:17:06,826 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 15:17:06,826 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 15:17:06,827 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 15:17:06,831 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 15:17:06,831 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:17:06,847 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 15:17:06,848 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 15:17:06,848 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 15:17:06,849 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 15:17:06,852 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 15:17:06,852 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 15:17:06,853 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 15:17:06,853 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 15:17:06,853 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 15:17:06,853 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 15:17:06,853 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 15:17:06,854 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 15:17:06,854 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 15:17:06,855 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 15:17:06,855 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 15:17:06,923 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 15:17:06,941 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 15:17:06,946 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 15:17:06,948 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 15:17:06,949 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 15:17:06,950 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/960521-1_1_false-valid-free.i_11.bpl [2018-10-10 15:17:06,950 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/960521-1_1_false-valid-free.i_11.bpl' [2018-10-10 15:17:07,030 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 15:17:07,032 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-10 15:17:07,032 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 15:17:07,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 15:17:07,033 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 15:17:07,060 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:07" (1/1) ... [2018-10-10 15:17:07,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:07" (1/1) ... [2018-10-10 15:17:07,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:07" (1/1) ... [2018-10-10 15:17:07,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:07" (1/1) ... [2018-10-10 15:17:07,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:07" (1/1) ... [2018-10-10 15:17:07,087 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:07" (1/1) ... [2018-10-10 15:17:07,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:07" (1/1) ... [2018-10-10 15:17:07,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 15:17:07,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 15:17:07,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 15:17:07,096 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 15:17:07,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:07" (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:17:07,162 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 15:17:07,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 15:17:07,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 15:17:07,664 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 15:17:07,665 INFO L202 PluginConnector]: Adding new model 960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:17:07 BoogieIcfgContainer [2018-10-10 15:17:07,665 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 15:17:07,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 15:17:07,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 15:17:07,670 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 15:17:07,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:07" (1/2) ... [2018-10-10 15:17:07,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77058aa9 and model type 960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 03:17:07, skipping insertion in model container [2018-10-10 15:17:07,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:17:07" (2/2) ... [2018-10-10 15:17:07,673 INFO L112 eAbstractionObserver]: Analyzing ICFG 960521-1_1_false-valid-free.i_11.bpl [2018-10-10 15:17:07,684 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 15:17:07,693 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 15:17:07,711 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 15:17:07,741 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 15:17:07,742 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 15:17:07,742 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 15:17:07,743 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 15:17:07,743 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 15:17:07,743 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 15:17:07,743 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 15:17:07,743 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 15:17:07,743 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 15:17:07,763 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-10-10 15:17:07,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-10 15:17:07,776 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:07,777 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] [2018-10-10 15:17:07,779 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:07,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:07,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1460050407, now seen corresponding path program 1 times [2018-10-10 15:17:07,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:08,936 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:17:08,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:17:08,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-10 15:17:08,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 15:17:08,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 15:17:08,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:17:08,968 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 14 states. [2018-10-10 15:17:09,537 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-10 15:17:11,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:11,130 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2018-10-10 15:17:11,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 15:17:11,132 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2018-10-10 15:17:11,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:11,148 INFO L225 Difference]: With dead ends: 133 [2018-10-10 15:17:11,148 INFO L226 Difference]: Without dead ends: 133 [2018-10-10 15:17:11,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=213, Invalid=599, Unknown=0, NotChecked=0, Total=812 [2018-10-10 15:17:11,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-10 15:17:11,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2018-10-10 15:17:11,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-10 15:17:11,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2018-10-10 15:17:11,199 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 54 [2018-10-10 15:17:11,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:11,200 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2018-10-10 15:17:11,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 15:17:11,200 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-10-10 15:17:11,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-10 15:17:11,203 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:11,204 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:11,204 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:11,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:11,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1706373082, now seen corresponding path program 1 times [2018-10-10 15:17:11,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:11,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-10 15:17:11,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:17:11,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-10 15:17:11,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 15:17:11,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 15:17:11,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:17:11,753 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 14 states. [2018-10-10 15:17:12,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:12,841 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2018-10-10 15:17:12,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 15:17:12,842 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2018-10-10 15:17:12,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:12,845 INFO L225 Difference]: With dead ends: 121 [2018-10-10 15:17:12,845 INFO L226 Difference]: Without dead ends: 121 [2018-10-10 15:17:12,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2018-10-10 15:17:12,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-10 15:17:12,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 71. [2018-10-10 15:17:12,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-10 15:17:12,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-10-10 15:17:12,855 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 60 [2018-10-10 15:17:12,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:12,855 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-10-10 15:17:12,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 15:17:12,856 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-10-10 15:17:12,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-10 15:17:12,857 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:12,857 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:12,858 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:12,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:12,858 INFO L82 PathProgramCache]: Analyzing trace with hash 630589741, now seen corresponding path program 1 times [2018-10-10 15:17:12,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:12,999 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:12,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:13,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-10 15:17:13,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 15:17:13,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 15:17:13,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:17:13,001 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 6 states. [2018-10-10 15:17:13,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:13,117 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2018-10-10 15:17:13,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 15:17:13,120 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-10-10 15:17:13,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:13,124 INFO L225 Difference]: With dead ends: 126 [2018-10-10 15:17:13,124 INFO L226 Difference]: Without dead ends: 76 [2018-10-10 15:17:13,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-10-10 15:17:13,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-10 15:17:13,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2018-10-10 15:17:13,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-10 15:17:13,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-10-10 15:17:13,136 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 66 [2018-10-10 15:17:13,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:13,137 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-10-10 15:17:13,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 15:17:13,137 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-10-10 15:17:13,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-10 15:17:13,141 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:13,141 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:13,141 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:13,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:13,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1215056544, now seen corresponding path program 1 times [2018-10-10 15:17:13,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:13,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:13,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:13,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 15:17:13,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 15:17:13,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 15:17:13,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-10-10 15:17:13,640 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 19 states. [2018-10-10 15:17:15,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:15,197 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2018-10-10 15:17:15,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-10 15:17:15,198 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 72 [2018-10-10 15:17:15,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:15,199 INFO L225 Difference]: With dead ends: 98 [2018-10-10 15:17:15,200 INFO L226 Difference]: Without dead ends: 98 [2018-10-10 15:17:15,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=425, Invalid=1381, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 15:17:15,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-10 15:17:15,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2018-10-10 15:17:15,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-10 15:17:15,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-10-10 15:17:15,207 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 72 [2018-10-10 15:17:15,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:15,208 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-10-10 15:17:15,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 15:17:15,208 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-10-10 15:17:15,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-10 15:17:15,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:15,210 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:15,210 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:15,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:15,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1734120346, now seen corresponding path program 2 times [2018-10-10 15:17:15,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:15,340 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:15,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:15,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 15:17:15,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:17:15,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:17:15,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:17:15,343 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 10 states. [2018-10-10 15:17:15,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:15,956 INFO L93 Difference]: Finished difference Result 156 states and 157 transitions. [2018-10-10 15:17:15,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 15:17:15,957 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2018-10-10 15:17:15,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:15,958 INFO L225 Difference]: With dead ends: 156 [2018-10-10 15:17:15,959 INFO L226 Difference]: Without dead ends: 94 [2018-10-10 15:17:15,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:17:15,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-10 15:17:15,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-10-10 15:17:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-10 15:17:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-10-10 15:17:15,966 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 84 [2018-10-10 15:17:15,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:15,967 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-10-10 15:17:15,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:17:15,967 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-10-10 15:17:15,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-10 15:17:15,968 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:15,969 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:15,969 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:15,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:15,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1739237607, now seen corresponding path program 3 times [2018-10-10 15:17:15,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:16,495 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:16,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:16,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 15:17:16,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 15:17:16,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 15:17:16,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:17:16,498 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 24 states. [2018-10-10 15:17:18,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:18,542 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2018-10-10 15:17:18,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 15:17:18,543 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 90 [2018-10-10 15:17:18,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:18,544 INFO L225 Difference]: With dead ends: 116 [2018-10-10 15:17:18,544 INFO L226 Difference]: Without dead ends: 116 [2018-10-10 15:17:18,545 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=561, Invalid=2195, Unknown=0, NotChecked=0, Total=2756 [2018-10-10 15:17:18,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-10 15:17:18,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2018-10-10 15:17:18,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-10 15:17:18,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-10-10 15:17:18,552 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 90 [2018-10-10 15:17:18,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:18,552 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-10-10 15:17:18,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 15:17:18,552 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-10-10 15:17:18,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-10 15:17:18,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:18,554 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:18,555 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:18,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:18,555 INFO L82 PathProgramCache]: Analyzing trace with hash 860392287, now seen corresponding path program 4 times [2018-10-10 15:17:18,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 28 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:19,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:19,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 15:17:19,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 15:17:19,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 15:17:19,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:17:19,439 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 14 states. [2018-10-10 15:17:19,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:19,829 INFO L93 Difference]: Finished difference Result 186 states and 187 transitions. [2018-10-10 15:17:19,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 15:17:19,829 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 102 [2018-10-10 15:17:19,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:19,831 INFO L225 Difference]: With dead ends: 186 [2018-10-10 15:17:19,831 INFO L226 Difference]: Without dead ends: 112 [2018-10-10 15:17:19,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2018-10-10 15:17:19,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-10-10 15:17:19,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2018-10-10 15:17:19,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-10 15:17:19,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-10-10 15:17:19,837 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 102 [2018-10-10 15:17:19,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:19,838 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-10-10 15:17:19,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 15:17:19,838 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-10-10 15:17:19,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-10 15:17:19,840 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:19,840 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:19,840 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:19,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:19,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1808380078, now seen corresponding path program 5 times [2018-10-10 15:17:19,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:20,496 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 24 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:20,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:20,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 15:17:20,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 15:17:20,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 15:17:20,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:17:20,499 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 28 states. [2018-10-10 15:17:22,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:22,931 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2018-10-10 15:17:22,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-10 15:17:22,932 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 108 [2018-10-10 15:17:22,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:22,932 INFO L225 Difference]: With dead ends: 134 [2018-10-10 15:17:22,933 INFO L226 Difference]: Without dead ends: 134 [2018-10-10 15:17:22,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=706, Invalid=3076, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 15:17:22,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-10 15:17:22,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 121. [2018-10-10 15:17:22,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-10 15:17:22,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-10-10 15:17:22,939 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 108 [2018-10-10 15:17:22,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:22,939 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-10-10 15:17:22,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 15:17:22,940 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-10-10 15:17:22,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-10 15:17:22,941 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:22,942 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:22,942 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:22,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:22,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1755444760, now seen corresponding path program 6 times [2018-10-10 15:17:22,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:23,272 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 58 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:23,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:23,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 15:17:23,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 15:17:23,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 15:17:23,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:17:23,274 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 18 states. [2018-10-10 15:17:23,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:23,749 INFO L93 Difference]: Finished difference Result 216 states and 217 transitions. [2018-10-10 15:17:23,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 15:17:23,749 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 120 [2018-10-10 15:17:23,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:23,751 INFO L225 Difference]: With dead ends: 216 [2018-10-10 15:17:23,751 INFO L226 Difference]: Without dead ends: 130 [2018-10-10 15:17:23,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=1039, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:17:23,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-10 15:17:23,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2018-10-10 15:17:23,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-10 15:17:23,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-10-10 15:17:23,758 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 120 [2018-10-10 15:17:23,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:23,758 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-10-10 15:17:23,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 15:17:23,758 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-10-10 15:17:23,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-10 15:17:23,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:23,760 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:23,761 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:23,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:23,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1233109835, now seen corresponding path program 7 times [2018-10-10 15:17:23,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:24,483 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 44 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:24,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:24,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 15:17:24,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 15:17:24,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 15:17:24,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2018-10-10 15:17:24,485 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 32 states. [2018-10-10 15:17:25,777 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-10-10 15:17:27,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:27,493 INFO L93 Difference]: Finished difference Result 152 states and 153 transitions. [2018-10-10 15:17:27,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-10 15:17:27,493 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 126 [2018-10-10 15:17:27,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:27,494 INFO L225 Difference]: With dead ends: 152 [2018-10-10 15:17:27,495 INFO L226 Difference]: Without dead ends: 152 [2018-10-10 15:17:27,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=867, Invalid=4103, Unknown=0, NotChecked=0, Total=4970 [2018-10-10 15:17:27,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-10 15:17:27,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 139. [2018-10-10 15:17:27,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-10 15:17:27,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-10-10 15:17:27,500 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 126 [2018-10-10 15:17:27,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:27,501 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-10-10 15:17:27,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 15:17:27,501 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-10-10 15:17:27,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-10 15:17:27,503 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:27,503 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:27,503 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:27,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:27,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1372077201, now seen corresponding path program 8 times [2018-10-10 15:17:27,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:28,203 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 100 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:28,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:28,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 15:17:28,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 15:17:28,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 15:17:28,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:17:28,204 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 22 states. [2018-10-10 15:17:28,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:28,733 INFO L93 Difference]: Finished difference Result 246 states and 247 transitions. [2018-10-10 15:17:28,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 15:17:28,734 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 138 [2018-10-10 15:17:28,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:28,735 INFO L225 Difference]: With dead ends: 246 [2018-10-10 15:17:28,735 INFO L226 Difference]: Without dead ends: 148 [2018-10-10 15:17:28,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=334, Invalid=1646, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 15:17:28,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-10 15:17:28,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 145. [2018-10-10 15:17:28,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-10 15:17:28,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-10-10 15:17:28,740 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 138 [2018-10-10 15:17:28,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:28,740 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-10-10 15:17:28,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 15:17:28,740 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-10-10 15:17:28,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-10 15:17:28,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:28,742 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:28,742 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:28,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:28,743 INFO L82 PathProgramCache]: Analyzing trace with hash -23182588, now seen corresponding path program 9 times [2018-10-10 15:17:28,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:29,480 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 70 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:29,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:29,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 15:17:29,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 15:17:29,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 15:17:29,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1147, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:17:29,482 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 36 states. [2018-10-10 15:17:30,985 WARN L178 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-10-10 15:17:33,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:33,918 INFO L93 Difference]: Finished difference Result 170 states and 171 transitions. [2018-10-10 15:17:33,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 15:17:33,918 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 144 [2018-10-10 15:17:33,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:33,920 INFO L225 Difference]: With dead ends: 170 [2018-10-10 15:17:33,920 INFO L226 Difference]: Without dead ends: 170 [2018-10-10 15:17:33,923 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1455 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1044, Invalid=5276, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 15:17:33,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-10 15:17:33,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2018-10-10 15:17:33,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-10 15:17:33,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-10-10 15:17:33,927 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 144 [2018-10-10 15:17:33,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:33,927 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-10-10 15:17:33,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 15:17:33,927 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-10-10 15:17:33,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-10 15:17:33,928 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:33,928 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:33,929 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:33,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:33,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1496322358, now seen corresponding path program 10 times [2018-10-10 15:17:33,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:34,363 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 154 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:34,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:34,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 15:17:34,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 15:17:34,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 15:17:34,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:17:34,365 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 26 states. [2018-10-10 15:17:35,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:35,859 INFO L93 Difference]: Finished difference Result 276 states and 277 transitions. [2018-10-10 15:17:35,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 15:17:35,860 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 156 [2018-10-10 15:17:35,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:35,863 INFO L225 Difference]: With dead ends: 276 [2018-10-10 15:17:35,863 INFO L226 Difference]: Without dead ends: 166 [2018-10-10 15:17:35,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=471, Invalid=2391, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 15:17:35,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-10 15:17:35,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2018-10-10 15:17:35,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-10 15:17:35,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-10-10 15:17:35,870 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 156 [2018-10-10 15:17:35,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:35,871 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-10-10 15:17:35,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 15:17:35,871 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-10-10 15:17:35,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-10 15:17:35,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:35,872 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:35,872 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:35,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:35,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1811570301, now seen corresponding path program 11 times [2018-10-10 15:17:35,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:36,780 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 102 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:36,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:36,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 15:17:36,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 15:17:36,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 15:17:36,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1556, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:17:36,782 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 42 states. [2018-10-10 15:17:39,205 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-10-10 15:17:41,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:41,948 INFO L93 Difference]: Finished difference Result 188 states and 189 transitions. [2018-10-10 15:17:41,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-10 15:17:41,949 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 162 [2018-10-10 15:17:41,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:41,951 INFO L225 Difference]: With dead ends: 188 [2018-10-10 15:17:41,951 INFO L226 Difference]: Without dead ends: 188 [2018-10-10 15:17:41,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2068 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1686, Invalid=7244, Unknown=0, NotChecked=0, Total=8930 [2018-10-10 15:17:41,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-10 15:17:41,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2018-10-10 15:17:41,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-10 15:17:41,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-10-10 15:17:41,958 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 162 [2018-10-10 15:17:41,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:41,958 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-10-10 15:17:41,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 15:17:41,959 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-10-10 15:17:41,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-10 15:17:41,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:41,960 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:41,960 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:41,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:41,960 INFO L82 PathProgramCache]: Analyzing trace with hash 2009701571, now seen corresponding path program 12 times [2018-10-10 15:17:41,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:42,550 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 220 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:42,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:42,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 15:17:42,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 15:17:42,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 15:17:42,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:17:42,551 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 30 states. [2018-10-10 15:17:43,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:43,723 INFO L93 Difference]: Finished difference Result 306 states and 307 transitions. [2018-10-10 15:17:43,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 15:17:43,724 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 174 [2018-10-10 15:17:43,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:43,725 INFO L225 Difference]: With dead ends: 306 [2018-10-10 15:17:43,725 INFO L226 Difference]: Without dead ends: 184 [2018-10-10 15:17:43,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=632, Invalid=3274, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 15:17:43,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-10 15:17:43,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2018-10-10 15:17:43,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-10 15:17:43,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-10-10 15:17:43,730 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 174 [2018-10-10 15:17:43,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:43,731 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-10-10 15:17:43,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 15:17:43,731 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-10-10 15:17:43,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-10 15:17:43,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:43,732 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:43,732 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:43,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:43,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1258773066, now seen corresponding path program 13 times [2018-10-10 15:17:43,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:44,892 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 140 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:44,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:44,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 15:17:44,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 15:17:44,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 15:17:44,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1883, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 15:17:44,895 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 46 states. [2018-10-10 15:17:48,203 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2018-10-10 15:17:48,419 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-10 15:17:48,877 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2018-10-10 15:17:50,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:50,390 INFO L93 Difference]: Finished difference Result 206 states and 207 transitions. [2018-10-10 15:17:50,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-10 15:17:50,391 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 180 [2018-10-10 15:17:50,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:50,393 INFO L225 Difference]: With dead ends: 206 [2018-10-10 15:17:50,393 INFO L226 Difference]: Without dead ends: 206 [2018-10-10 15:17:50,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2473 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1880, Invalid=8626, Unknown=0, NotChecked=0, Total=10506 [2018-10-10 15:17:50,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-10 15:17:50,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 193. [2018-10-10 15:17:50,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-10 15:17:50,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-10-10 15:17:50,402 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 180 [2018-10-10 15:17:50,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:50,402 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-10-10 15:17:50,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 15:17:50,403 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-10-10 15:17:50,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-10 15:17:50,404 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:50,404 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:50,405 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:50,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:50,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1514023300, now seen corresponding path program 14 times [2018-10-10 15:17:50,406 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:51,072 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 298 proven. 218 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:51,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:51,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 15:17:51,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 15:17:51,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 15:17:51,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=957, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:17:51,074 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 34 states. [2018-10-10 15:17:52,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:52,015 INFO L93 Difference]: Finished difference Result 336 states and 337 transitions. [2018-10-10 15:17:52,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-10 15:17:52,015 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 192 [2018-10-10 15:17:52,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:52,017 INFO L225 Difference]: With dead ends: 336 [2018-10-10 15:17:52,018 INFO L226 Difference]: Without dead ends: 202 [2018-10-10 15:17:52,018 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1247 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=817, Invalid=4295, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 15:17:52,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-10 15:17:52,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2018-10-10 15:17:52,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-10 15:17:52,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-10-10 15:17:52,023 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 192 [2018-10-10 15:17:52,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:52,023 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-10-10 15:17:52,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 15:17:52,023 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-10-10 15:17:52,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-10 15:17:52,024 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:52,024 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:52,025 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:52,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:52,025 INFO L82 PathProgramCache]: Analyzing trace with hash 553232559, now seen corresponding path program 15 times [2018-10-10 15:17:52,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:53,180 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 184 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:53,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:53,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-10 15:17:53,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-10 15:17:53,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-10 15:17:53,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=2212, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 15:17:53,181 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 50 states. [2018-10-10 15:17:56,144 WARN L178 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2018-10-10 15:17:57,479 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2018-10-10 15:17:58,635 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2018-10-10 15:18:00,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:00,445 INFO L93 Difference]: Finished difference Result 224 states and 225 transitions. [2018-10-10 15:18:00,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-10 15:18:00,455 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 198 [2018-10-10 15:18:00,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:00,457 INFO L225 Difference]: With dead ends: 224 [2018-10-10 15:18:00,457 INFO L226 Difference]: Without dead ends: 224 [2018-10-10 15:18:00,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3183 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=2435, Invalid=10675, Unknown=0, NotChecked=0, Total=13110 [2018-10-10 15:18:00,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-10-10 15:18:00,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 211. [2018-10-10 15:18:00,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-10 15:18:00,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-10-10 15:18:00,462 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 198 [2018-10-10 15:18:00,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:00,463 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-10-10 15:18:00,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-10 15:18:00,463 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-10-10 15:18:00,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-10 15:18:00,464 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:00,464 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:00,464 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:00,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:00,465 INFO L82 PathProgramCache]: Analyzing trace with hash 465644533, now seen corresponding path program 16 times [2018-10-10 15:18:00,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:01,060 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 388 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:01,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:01,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 15:18:01,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 15:18:01,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 15:18:01,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1203, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 15:18:01,061 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 38 states. [2018-10-10 15:18:02,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:02,506 INFO L93 Difference]: Finished difference Result 366 states and 367 transitions. [2018-10-10 15:18:02,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-10 15:18:02,506 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 210 [2018-10-10 15:18:02,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:02,508 INFO L225 Difference]: With dead ends: 366 [2018-10-10 15:18:02,508 INFO L226 Difference]: Without dead ends: 220 [2018-10-10 15:18:02,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1613 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1026, Invalid=5454, Unknown=0, NotChecked=0, Total=6480 [2018-10-10 15:18:02,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-10 15:18:02,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2018-10-10 15:18:02,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-10 15:18:02,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-10-10 15:18:02,513 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 210 [2018-10-10 15:18:02,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:02,514 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-10-10 15:18:02,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 15:18:02,514 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-10-10 15:18:02,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-10 15:18:02,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:02,515 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:02,516 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:02,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:02,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1806043288, now seen corresponding path program 17 times [2018-10-10 15:18:02,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:03,285 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 272 proven. 98 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked. [2018-10-10 15:18:03,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:03,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 15:18:03,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 15:18:03,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 15:18:03,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:18:03,286 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 24 states. [2018-10-10 15:18:06,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:06,288 INFO L93 Difference]: Finished difference Result 215 states and 216 transitions. [2018-10-10 15:18:06,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 15:18:06,289 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 216 [2018-10-10 15:18:06,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:06,290 INFO L225 Difference]: With dead ends: 215 [2018-10-10 15:18:06,290 INFO L226 Difference]: Without dead ends: 0 [2018-10-10 15:18:06,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=849, Invalid=2457, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 15:18:06,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-10 15:18:06,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-10 15:18:06,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-10 15:18:06,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-10 15:18:06,292 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 216 [2018-10-10 15:18:06,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:06,292 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-10 15:18:06,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 15:18:06,292 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-10 15:18:06,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-10 15:18:06,297 INFO L202 PluginConnector]: Adding new model 960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 03:18:06 BoogieIcfgContainer [2018-10-10 15:18:06,298 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 15:18:06,299 INFO L168 Benchmark]: Toolchain (without parser) took 59268.04 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 512.2 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -115.0 MB). Peak memory consumption was 397.3 MB. Max. memory is 7.1 GB. [2018-10-10 15:18:06,300 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 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:18:06,301 INFO L168 Benchmark]: Boogie Preprocessor took 62.32 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:18:06,301 INFO L168 Benchmark]: RCFGBuilder took 569.68 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:18:06,302 INFO L168 Benchmark]: TraceAbstraction took 58631.66 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 512.2 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -146.7 MB). Peak memory consumption was 365.5 MB. Max. memory is 7.1 GB. [2018-10-10 15:18:06,306 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.25 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 62.32 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 569.68 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 58631.66 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 512.2 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -146.7 MB). Peak memory consumption was 365.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 134]: 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, 68 locations, 1 error locations. SAFE Result, 58.5s OverallTime, 20 OverallIterations, 10 TraceHistogramMax, 44.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1410 SDtfs, 12261 SDslu, 16485 SDs, 0 SdLazy, 13076 SolverSat, 1411 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1162 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 1101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17768 ImplicationChecksByTransitivity, 40.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=19, 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.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 204 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 2652 NumberOfCodeBlocks, 2652 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2632 ConstructedInterpolants, 0 QuantifiedInterpolants, 2781235 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 2451/4718 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/960521-1_1_false-valid-free.i_11.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-10_15-18-06-317.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_11.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-10_15-18-06-317.csv Received shutdown request...