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 -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:06:10,856 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:06:10,858 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:06:10,871 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:06:10,871 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:06:10,872 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:06:10,874 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:06:10,876 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:06:10,877 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:06:10,878 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:06:10,879 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:06:10,880 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:06:10,881 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:06:10,882 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:06:10,883 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:06:10,884 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:06:10,884 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:06:10,886 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:06:10,889 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:06:10,890 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:06:10,891 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:06:10,893 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:06:10,895 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:06:10,895 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:06:10,896 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:06:10,900 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:06:10,901 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:06:10,906 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:06:10,908 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:06:10,909 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:06:10,909 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:06:10,910 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:06:10,910 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:06:10,910 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:06:10,911 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:06:10,915 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:06:10,916 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:06:10,933 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:06:10,933 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:06:10,936 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:06:10,937 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:06:10,938 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:06:10,938 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:06:10,938 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:06:10,941 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:06:10,995 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:06:11,009 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:06:11,013 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:06:11,014 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:06:11,015 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:06:11,015 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl [2018-09-26 08:06:11,016 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl' [2018-09-26 08:06:11,091 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:06:11,095 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:06:11,096 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:06:11,096 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:06:11,098 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:06:11,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:11" (1/1) ... [2018-09-26 08:06:11,139 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:11" (1/1) ... [2018-09-26 08:06:11,145 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 08:06:11,145 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 08:06:11,145 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 08:06:11,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:06:11,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:06:11,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:06:11,150 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:06:11,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:11" (1/1) ... [2018-09-26 08:06:11,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:11" (1/1) ... [2018-09-26 08:06:11,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:11" (1/1) ... [2018-09-26 08:06:11,174 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:11" (1/1) ... [2018-09-26 08:06:11,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:11" (1/1) ... [2018-09-26 08:06:11,208 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:11" (1/1) ... [2018-09-26 08:06:11,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:11" (1/1) ... [2018-09-26 08:06:11,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:06:11,219 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:06:11,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:06:11,220 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:06:11,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:11" (1/1) ... [2018-09-26 08:06:11,329 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-26 08:06:11,330 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-26 08:06:11,330 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-26 08:06:11,686 INFO L343 CfgBuilder]: Using library mode [2018-09-26 08:06:11,687 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:06:11 BoogieIcfgContainer [2018-09-26 08:06:11,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:06:11,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:06:11,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:06:11,692 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:06:11,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:11" (1/2) ... [2018-09-26 08:06:11,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7276b962 and model type threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:06:11, skipping insertion in model container [2018-09-26 08:06:11,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:06:11" (2/2) ... [2018-09-26 08:06:11,697 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out.bpl [2018-09-26 08:06:11,707 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:06:11,717 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-09-26 08:06:11,767 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:06:11,768 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:06:11,769 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:06:11,769 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:06:11,769 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:06:11,769 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:06:11,770 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:06:11,770 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:06:11,770 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:06:11,791 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-09-26 08:06:11,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:06:11,801 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:11,803 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:11,805 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:11,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:11,812 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-09-26 08:06:11,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:11,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:11,940 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:11,941 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 08:06:11,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:06:11,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:06:11,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:11,964 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-09-26 08:06:12,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:12,636 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-09-26 08:06:12,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:06:12,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-26 08:06:12,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:12,667 INFO L225 Difference]: With dead ends: 163 [2018-09-26 08:06:12,668 INFO L226 Difference]: Without dead ends: 158 [2018-09-26 08:06:12,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:12,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-26 08:06:12,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-09-26 08:06:12,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 08:06:12,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-09-26 08:06:12,747 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-09-26 08:06:12,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:12,747 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-09-26 08:06:12,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:06:12,749 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-09-26 08:06:12,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:06:12,750 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:12,750 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:12,751 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:12,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:12,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-09-26 08:06:12,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:12,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:12,770 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:12,770 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 08:06:12,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:06:12,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:06:12,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:12,774 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-09-26 08:06:13,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:13,172 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-09-26 08:06:13,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:06:13,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-26 08:06:13,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:13,176 INFO L225 Difference]: With dead ends: 188 [2018-09-26 08:06:13,176 INFO L226 Difference]: Without dead ends: 183 [2018-09-26 08:06:13,177 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:13,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-26 08:06:13,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-09-26 08:06:13,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-26 08:06:13,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-09-26 08:06:13,227 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-09-26 08:06:13,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:13,230 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-09-26 08:06:13,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:06:13,230 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-09-26 08:06:13,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:06:13,232 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:13,232 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:13,235 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:13,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:13,235 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-09-26 08:06:13,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:13,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:13,290 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:13,290 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:13,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:13,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:13,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:13,292 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-09-26 08:06:13,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:13,673 INFO L93 Difference]: Finished difference Result 361 states and 808 transitions. [2018-09-26 08:06:13,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:06:13,674 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-26 08:06:13,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:13,681 INFO L225 Difference]: With dead ends: 361 [2018-09-26 08:06:13,681 INFO L226 Difference]: Without dead ends: 349 [2018-09-26 08:06:13,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:13,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-09-26 08:06:13,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 174. [2018-09-26 08:06:13,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-09-26 08:06:13,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 387 transitions. [2018-09-26 08:06:13,726 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 387 transitions. Word has length 9 [2018-09-26 08:06:13,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:13,727 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 387 transitions. [2018-09-26 08:06:13,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:13,727 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 387 transitions. [2018-09-26 08:06:13,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:06:13,728 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:13,729 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:13,730 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:13,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:13,730 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-09-26 08:06:13,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:13,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:13,752 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:13,753 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:13,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:13,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:13,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:13,755 INFO L87 Difference]: Start difference. First operand 174 states and 387 transitions. Second operand 7 states. [2018-09-26 08:06:14,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:14,073 INFO L93 Difference]: Finished difference Result 307 states and 694 transitions. [2018-09-26 08:06:14,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:06:14,074 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-26 08:06:14,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:14,076 INFO L225 Difference]: With dead ends: 307 [2018-09-26 08:06:14,076 INFO L226 Difference]: Without dead ends: 302 [2018-09-26 08:06:14,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:06:14,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-09-26 08:06:14,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 203. [2018-09-26 08:06:14,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-26 08:06:14,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-09-26 08:06:14,135 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-09-26 08:06:14,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:14,136 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-09-26 08:06:14,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:14,136 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-09-26 08:06:14,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:14,141 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:14,142 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:14,142 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:14,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:14,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-09-26 08:06:14,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:14,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:14,168 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:14,168 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:14,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:14,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:14,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:14,170 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 8 states. [2018-09-26 08:06:15,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:15,048 INFO L93 Difference]: Finished difference Result 741 states and 1656 transitions. [2018-09-26 08:06:15,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:06:15,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 08:06:15,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:15,055 INFO L225 Difference]: With dead ends: 741 [2018-09-26 08:06:15,055 INFO L226 Difference]: Without dead ends: 733 [2018-09-26 08:06:15,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:06:15,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-09-26 08:06:15,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 315. [2018-09-26 08:06:15,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-09-26 08:06:15,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 743 transitions. [2018-09-26 08:06:15,154 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 743 transitions. Word has length 12 [2018-09-26 08:06:15,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:15,155 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 743 transitions. [2018-09-26 08:06:15,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:15,155 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 743 transitions. [2018-09-26 08:06:15,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:15,158 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:15,158 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:15,163 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:15,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:15,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-09-26 08:06:15,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:15,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:15,184 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:15,184 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:15,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:15,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:15,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:15,185 INFO L87 Difference]: Start difference. First operand 315 states and 743 transitions. Second operand 8 states. [2018-09-26 08:06:16,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:16,022 INFO L93 Difference]: Finished difference Result 797 states and 1784 transitions. [2018-09-26 08:06:16,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:06:16,023 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 08:06:16,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:16,030 INFO L225 Difference]: With dead ends: 797 [2018-09-26 08:06:16,030 INFO L226 Difference]: Without dead ends: 789 [2018-09-26 08:06:16,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:06:16,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-09-26 08:06:16,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 319. [2018-09-26 08:06:16,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-09-26 08:06:16,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 751 transitions. [2018-09-26 08:06:16,133 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 751 transitions. Word has length 12 [2018-09-26 08:06:16,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:16,134 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 751 transitions. [2018-09-26 08:06:16,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:16,134 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 751 transitions. [2018-09-26 08:06:16,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:16,136 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:16,136 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:16,137 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:16,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:16,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-09-26 08:06:16,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:16,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:16,172 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:16,172 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:16,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:16,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:16,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:16,174 INFO L87 Difference]: Start difference. First operand 319 states and 751 transitions. Second operand 8 states. [2018-09-26 08:06:17,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:17,038 INFO L93 Difference]: Finished difference Result 684 states and 1538 transitions. [2018-09-26 08:06:17,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:06:17,039 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 08:06:17,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:17,044 INFO L225 Difference]: With dead ends: 684 [2018-09-26 08:06:17,044 INFO L226 Difference]: Without dead ends: 676 [2018-09-26 08:06:17,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:06:17,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-09-26 08:06:17,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 330. [2018-09-26 08:06:17,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-09-26 08:06:17,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 778 transitions. [2018-09-26 08:06:17,144 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 778 transitions. Word has length 12 [2018-09-26 08:06:17,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:17,145 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 778 transitions. [2018-09-26 08:06:17,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:17,145 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 778 transitions. [2018-09-26 08:06:17,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:17,146 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:17,146 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:17,148 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:17,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:17,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-09-26 08:06:17,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:17,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:17,171 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:17,172 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:17,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:17,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:17,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:17,173 INFO L87 Difference]: Start difference. First operand 330 states and 778 transitions. Second operand 8 states. [2018-09-26 08:06:17,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:17,789 INFO L93 Difference]: Finished difference Result 605 states and 1360 transitions. [2018-09-26 08:06:17,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:06:17,790 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 08:06:17,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:17,795 INFO L225 Difference]: With dead ends: 605 [2018-09-26 08:06:17,795 INFO L226 Difference]: Without dead ends: 597 [2018-09-26 08:06:17,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:06:17,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-09-26 08:06:17,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 337. [2018-09-26 08:06:17,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-09-26 08:06:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 794 transitions. [2018-09-26 08:06:17,907 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 794 transitions. Word has length 12 [2018-09-26 08:06:17,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:17,908 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 794 transitions. [2018-09-26 08:06:17,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:17,908 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 794 transitions. [2018-09-26 08:06:17,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:17,912 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:17,912 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:17,913 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:17,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:17,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1088621469, now seen corresponding path program 1 times [2018-09-26 08:06:17,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:17,932 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:17,932 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:17,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:17,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:17,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:17,933 INFO L87 Difference]: Start difference. First operand 337 states and 794 transitions. Second operand 8 states. [2018-09-26 08:06:18,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:18,838 INFO L93 Difference]: Finished difference Result 935 states and 2104 transitions. [2018-09-26 08:06:18,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:06:18,839 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 08:06:18,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:18,847 INFO L225 Difference]: With dead ends: 935 [2018-09-26 08:06:18,847 INFO L226 Difference]: Without dead ends: 927 [2018-09-26 08:06:18,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:06:18,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-09-26 08:06:18,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 343. [2018-09-26 08:06:18,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-09-26 08:06:18,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 808 transitions. [2018-09-26 08:06:18,985 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 808 transitions. Word has length 12 [2018-09-26 08:06:18,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:18,993 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 808 transitions. [2018-09-26 08:06:18,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:18,993 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 808 transitions. [2018-09-26 08:06:18,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:18,994 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:18,994 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:18,995 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:18,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:18,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1085821115, now seen corresponding path program 1 times [2018-09-26 08:06:18,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:19,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:19,012 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:19,012 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:19,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:19,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:19,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:19,014 INFO L87 Difference]: Start difference. First operand 343 states and 808 transitions. Second operand 8 states. [2018-09-26 08:06:19,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:19,946 INFO L93 Difference]: Finished difference Result 923 states and 2061 transitions. [2018-09-26 08:06:19,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:06:19,946 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 08:06:19,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:19,953 INFO L225 Difference]: With dead ends: 923 [2018-09-26 08:06:19,954 INFO L226 Difference]: Without dead ends: 915 [2018-09-26 08:06:19,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:06:19,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-09-26 08:06:20,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 354. [2018-09-26 08:06:20,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-09-26 08:06:20,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 835 transitions. [2018-09-26 08:06:20,122 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 835 transitions. Word has length 12 [2018-09-26 08:06:20,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:20,122 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 835 transitions. [2018-09-26 08:06:20,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:20,123 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 835 transitions. [2018-09-26 08:06:20,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:20,124 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:20,124 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:20,125 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:20,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:20,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1085923260, now seen corresponding path program 1 times [2018-09-26 08:06:20,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:20,143 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:20,143 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:20,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:20,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:20,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:20,145 INFO L87 Difference]: Start difference. First operand 354 states and 835 transitions. Second operand 8 states. [2018-09-26 08:06:20,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:20,938 INFO L93 Difference]: Finished difference Result 837 states and 1868 transitions. [2018-09-26 08:06:20,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:06:20,938 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 08:06:20,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:20,944 INFO L225 Difference]: With dead ends: 837 [2018-09-26 08:06:20,944 INFO L226 Difference]: Without dead ends: 829 [2018-09-26 08:06:20,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:06:20,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-09-26 08:06:21,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 339. [2018-09-26 08:06:21,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-09-26 08:06:21,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 800 transitions. [2018-09-26 08:06:21,090 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 800 transitions. Word has length 12 [2018-09-26 08:06:21,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:21,091 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 800 transitions. [2018-09-26 08:06:21,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:21,091 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 800 transitions. [2018-09-26 08:06:21,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:21,092 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:21,093 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:21,093 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:21,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:21,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1383194877, now seen corresponding path program 1 times [2018-09-26 08:06:21,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:21,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:21,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:21,105 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:21,105 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:21,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:21,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:21,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:21,106 INFO L87 Difference]: Start difference. First operand 339 states and 800 transitions. Second operand 8 states. [2018-09-26 08:06:22,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:22,081 INFO L93 Difference]: Finished difference Result 996 states and 2227 transitions. [2018-09-26 08:06:22,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:06:22,081 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 08:06:22,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:22,088 INFO L225 Difference]: With dead ends: 996 [2018-09-26 08:06:22,088 INFO L226 Difference]: Without dead ends: 988 [2018-09-26 08:06:22,090 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:06:22,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-09-26 08:06:22,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 381. [2018-09-26 08:06:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-26 08:06:22,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-09-26 08:06:22,267 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-09-26 08:06:22,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:22,269 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-09-26 08:06:22,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:22,269 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-09-26 08:06:22,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:22,274 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:22,274 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:22,274 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:22,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:22,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1383297022, now seen corresponding path program 1 times [2018-09-26 08:06:22,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:22,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:22,294 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:22,294 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:22,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:22,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:22,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:22,295 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-09-26 08:06:23,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:23,244 INFO L93 Difference]: Finished difference Result 913 states and 2034 transitions. [2018-09-26 08:06:23,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:06:23,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 08:06:23,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:23,252 INFO L225 Difference]: With dead ends: 913 [2018-09-26 08:06:23,252 INFO L226 Difference]: Without dead ends: 905 [2018-09-26 08:06:23,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:06:23,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-09-26 08:06:23,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 371. [2018-09-26 08:06:23,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-09-26 08:06:23,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 890 transitions. [2018-09-26 08:06:23,455 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 890 transitions. Word has length 12 [2018-09-26 08:06:23,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:23,456 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 890 transitions. [2018-09-26 08:06:23,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:23,456 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 890 transitions. [2018-09-26 08:06:23,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:23,457 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:23,457 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:23,457 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:23,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:23,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1392211258, now seen corresponding path program 1 times [2018-09-26 08:06:23,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:23,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:23,481 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:23,481 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:23,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:23,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:23,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:23,483 INFO L87 Difference]: Start difference. First operand 371 states and 890 transitions. Second operand 8 states. [2018-09-26 08:06:24,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:24,397 INFO L93 Difference]: Finished difference Result 886 states and 2009 transitions. [2018-09-26 08:06:24,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:06:24,398 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 08:06:24,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:24,404 INFO L225 Difference]: With dead ends: 886 [2018-09-26 08:06:24,404 INFO L226 Difference]: Without dead ends: 878 [2018-09-26 08:06:24,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:06:24,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2018-09-26 08:06:24,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 372. [2018-09-26 08:06:24,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-09-26 08:06:24,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 891 transitions. [2018-09-26 08:06:24,674 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 891 transitions. Word has length 12 [2018-09-26 08:06:24,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:24,674 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 891 transitions. [2018-09-26 08:06:24,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:24,674 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 891 transitions. [2018-09-26 08:06:24,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:24,675 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:24,675 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:24,676 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:24,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:24,676 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-09-26 08:06:24,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:24,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:24,693 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:24,693 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:24,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:24,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:24,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:24,694 INFO L87 Difference]: Start difference. First operand 372 states and 891 transitions. Second operand 9 states. [2018-09-26 08:06:25,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:25,672 INFO L93 Difference]: Finished difference Result 801 states and 1838 transitions. [2018-09-26 08:06:25,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:06:25,673 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 08:06:25,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:25,680 INFO L225 Difference]: With dead ends: 801 [2018-09-26 08:06:25,680 INFO L226 Difference]: Without dead ends: 793 [2018-09-26 08:06:25,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:06:25,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-09-26 08:06:25,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 393. [2018-09-26 08:06:25,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-09-26 08:06:25,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 949 transitions. [2018-09-26 08:06:25,931 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 949 transitions. Word has length 12 [2018-09-26 08:06:25,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:25,931 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 949 transitions. [2018-09-26 08:06:25,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:25,931 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 949 transitions. [2018-09-26 08:06:25,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:25,932 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:25,932 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:25,933 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:25,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:25,933 INFO L82 PathProgramCache]: Analyzing trace with hash 192619318, now seen corresponding path program 1 times [2018-09-26 08:06:25,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:25,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:25,947 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:25,947 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:25,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:25,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:25,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:25,948 INFO L87 Difference]: Start difference. First operand 393 states and 949 transitions. Second operand 9 states. [2018-09-26 08:06:27,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:27,155 INFO L93 Difference]: Finished difference Result 962 states and 2211 transitions. [2018-09-26 08:06:27,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:06:27,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 08:06:27,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:27,162 INFO L225 Difference]: With dead ends: 962 [2018-09-26 08:06:27,162 INFO L226 Difference]: Without dead ends: 954 [2018-09-26 08:06:27,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:06:27,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-09-26 08:06:27,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 409. [2018-09-26 08:06:27,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-09-26 08:06:27,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 997 transitions. [2018-09-26 08:06:27,429 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 997 transitions. Word has length 12 [2018-09-26 08:06:27,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:27,429 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 997 transitions. [2018-09-26 08:06:27,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:27,429 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 997 transitions. [2018-09-26 08:06:27,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:27,430 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:27,431 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:27,431 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:27,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:27,432 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-09-26 08:06:27,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:27,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:27,446 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:27,446 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:27,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:27,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:27,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:27,447 INFO L87 Difference]: Start difference. First operand 409 states and 997 transitions. Second operand 9 states. [2018-09-26 08:06:28,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:28,749 INFO L93 Difference]: Finished difference Result 1000 states and 2329 transitions. [2018-09-26 08:06:28,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:06:28,750 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 08:06:28,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:28,757 INFO L225 Difference]: With dead ends: 1000 [2018-09-26 08:06:28,758 INFO L226 Difference]: Without dead ends: 992 [2018-09-26 08:06:28,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:06:28,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-09-26 08:06:29,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 430. [2018-09-26 08:06:29,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-09-26 08:06:29,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1052 transitions. [2018-09-26 08:06:29,138 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1052 transitions. Word has length 12 [2018-09-26 08:06:29,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:29,139 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 1052 transitions. [2018-09-26 08:06:29,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:29,139 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1052 transitions. [2018-09-26 08:06:29,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:29,140 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:29,140 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:29,141 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:29,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:29,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1320238459, now seen corresponding path program 1 times [2018-09-26 08:06:29,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:29,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:29,154 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:29,154 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:29,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:29,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:29,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:29,155 INFO L87 Difference]: Start difference. First operand 430 states and 1052 transitions. Second operand 9 states. [2018-09-26 08:06:30,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:30,615 INFO L93 Difference]: Finished difference Result 1065 states and 2466 transitions. [2018-09-26 08:06:30,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:06:30,615 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 08:06:30,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:30,622 INFO L225 Difference]: With dead ends: 1065 [2018-09-26 08:06:30,622 INFO L226 Difference]: Without dead ends: 1057 [2018-09-26 08:06:30,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:06:30,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2018-09-26 08:06:30,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 471. [2018-09-26 08:06:30,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-09-26 08:06:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1168 transitions. [2018-09-26 08:06:30,962 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1168 transitions. Word has length 12 [2018-09-26 08:06:30,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:30,962 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 1168 transitions. [2018-09-26 08:06:30,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1168 transitions. [2018-09-26 08:06:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:30,963 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:30,963 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:30,964 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:30,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:30,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1320340604, now seen corresponding path program 1 times [2018-09-26 08:06:30,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:30,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:30,976 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:30,977 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:30,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:30,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:30,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:30,978 INFO L87 Difference]: Start difference. First operand 471 states and 1168 transitions. Second operand 9 states. [2018-09-26 08:06:32,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:32,668 INFO L93 Difference]: Finished difference Result 1227 states and 2851 transitions. [2018-09-26 08:06:32,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:06:32,669 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 08:06:32,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:32,676 INFO L225 Difference]: With dead ends: 1227 [2018-09-26 08:06:32,676 INFO L226 Difference]: Without dead ends: 1219 [2018-09-26 08:06:32,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=365, Invalid=967, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:06:32,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-09-26 08:06:33,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 438. [2018-09-26 08:06:33,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-09-26 08:06:33,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1072 transitions. [2018-09-26 08:06:33,011 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1072 transitions. Word has length 12 [2018-09-26 08:06:33,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:33,012 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 1072 transitions. [2018-09-26 08:06:33,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:33,012 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1072 transitions. [2018-09-26 08:06:33,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:33,013 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:33,013 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:33,014 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:33,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:33,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-09-26 08:06:33,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:33,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:33,025 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:33,025 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:33,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:33,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:33,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:33,026 INFO L87 Difference]: Start difference. First operand 438 states and 1072 transitions. Second operand 9 states. [2018-09-26 08:06:34,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:34,495 INFO L93 Difference]: Finished difference Result 1076 states and 2511 transitions. [2018-09-26 08:06:34,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:06:34,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 08:06:34,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:34,503 INFO L225 Difference]: With dead ends: 1076 [2018-09-26 08:06:34,504 INFO L226 Difference]: Without dead ends: 1068 [2018-09-26 08:06:34,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:06:34,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2018-09-26 08:06:34,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 445. [2018-09-26 08:06:34,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-09-26 08:06:34,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1088 transitions. [2018-09-26 08:06:34,815 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1088 transitions. Word has length 12 [2018-09-26 08:06:34,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:34,815 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 1088 transitions. [2018-09-26 08:06:34,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:34,815 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1088 transitions. [2018-09-26 08:06:34,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:34,816 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:34,817 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:34,817 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:34,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:34,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1838990990, now seen corresponding path program 1 times [2018-09-26 08:06:34,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:34,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:34,828 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:34,828 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:34,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:34,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:34,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:34,829 INFO L87 Difference]: Start difference. First operand 445 states and 1088 transitions. Second operand 9 states. [2018-09-26 08:06:36,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:36,186 INFO L93 Difference]: Finished difference Result 1111 states and 2606 transitions. [2018-09-26 08:06:36,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:36,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 08:06:36,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:36,193 INFO L225 Difference]: With dead ends: 1111 [2018-09-26 08:06:36,194 INFO L226 Difference]: Without dead ends: 1103 [2018-09-26 08:06:36,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:06:36,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2018-09-26 08:06:36,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 520. [2018-09-26 08:06:36,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-09-26 08:06:36,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1295 transitions. [2018-09-26 08:06:36,685 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1295 transitions. Word has length 12 [2018-09-26 08:06:36,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:36,685 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 1295 transitions. [2018-09-26 08:06:36,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:36,685 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1295 transitions. [2018-09-26 08:06:36,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:36,686 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:36,686 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:36,687 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:36,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:36,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1838888845, now seen corresponding path program 1 times [2018-09-26 08:06:36,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:36,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:36,698 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:36,698 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:36,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:36,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:36,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:36,699 INFO L87 Difference]: Start difference. First operand 520 states and 1295 transitions. Second operand 9 states. [2018-09-26 08:06:37,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:37,894 INFO L93 Difference]: Finished difference Result 1304 states and 3059 transitions. [2018-09-26 08:06:37,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:06:37,895 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 08:06:37,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:37,903 INFO L225 Difference]: With dead ends: 1304 [2018-09-26 08:06:37,904 INFO L226 Difference]: Without dead ends: 1296 [2018-09-26 08:06:37,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:06:37,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-09-26 08:06:38,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 487. [2018-09-26 08:06:38,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-09-26 08:06:38,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1199 transitions. [2018-09-26 08:06:38,384 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1199 transitions. Word has length 12 [2018-09-26 08:06:38,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:38,385 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 1199 transitions. [2018-09-26 08:06:38,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:38,385 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1199 transitions. [2018-09-26 08:06:38,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:38,386 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:38,386 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:38,386 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:38,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:38,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1731038698, now seen corresponding path program 1 times [2018-09-26 08:06:38,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:38,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:38,396 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:38,397 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:38,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:38,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:38,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:38,399 INFO L87 Difference]: Start difference. First operand 487 states and 1199 transitions. Second operand 9 states. [2018-09-26 08:06:39,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:39,808 INFO L93 Difference]: Finished difference Result 1370 states and 3217 transitions. [2018-09-26 08:06:39,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:06:39,808 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 08:06:39,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:39,816 INFO L225 Difference]: With dead ends: 1370 [2018-09-26 08:06:39,817 INFO L226 Difference]: Without dead ends: 1362 [2018-09-26 08:06:39,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:06:39,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2018-09-26 08:06:40,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 479. [2018-09-26 08:06:40,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-09-26 08:06:40,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1179 transitions. [2018-09-26 08:06:40,278 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1179 transitions. Word has length 12 [2018-09-26 08:06:40,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:40,278 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 1179 transitions. [2018-09-26 08:06:40,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:40,278 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1179 transitions. [2018-09-26 08:06:40,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:40,279 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:40,279 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:40,280 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:40,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:40,280 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-09-26 08:06:40,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:40,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:40,289 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:40,289 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:40,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:40,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:40,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:40,290 INFO L87 Difference]: Start difference. First operand 479 states and 1179 transitions. Second operand 9 states. [2018-09-26 08:06:41,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:41,562 INFO L93 Difference]: Finished difference Result 1298 states and 3068 transitions. [2018-09-26 08:06:41,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:06:41,562 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 08:06:41,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:41,567 INFO L225 Difference]: With dead ends: 1298 [2018-09-26 08:06:41,568 INFO L226 Difference]: Without dead ends: 1290 [2018-09-26 08:06:41,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:06:41,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-09-26 08:06:42,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 602. [2018-09-26 08:06:42,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-09-26 08:06:42,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-09-26 08:06:42,072 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-09-26 08:06:42,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:42,072 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-09-26 08:06:42,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:42,072 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-09-26 08:06:42,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:42,073 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:42,073 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:42,074 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:42,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:42,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1080362888, now seen corresponding path program 1 times [2018-09-26 08:06:42,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:42,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:42,080 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:42,081 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 08:06:42,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:06:42,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:06:42,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:06:42,082 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-09-26 08:06:42,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:42,663 INFO L93 Difference]: Finished difference Result 1242 states and 3091 transitions. [2018-09-26 08:06:42,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:06:42,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-26 08:06:42,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:42,666 INFO L225 Difference]: With dead ends: 1242 [2018-09-26 08:06:42,666 INFO L226 Difference]: Without dead ends: 673 [2018-09-26 08:06:42,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:42,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-09-26 08:06:43,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 612. [2018-09-26 08:06:43,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-09-26 08:06:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1463 transitions. [2018-09-26 08:06:43,211 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1463 transitions. Word has length 13 [2018-09-26 08:06:43,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:43,212 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 1463 transitions. [2018-09-26 08:06:43,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:06:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1463 transitions. [2018-09-26 08:06:43,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:43,213 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:43,213 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:43,214 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:43,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:43,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1652407871, now seen corresponding path program 1 times [2018-09-26 08:06:43,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:43,232 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:43,232 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:43,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:43,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:43,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:43,233 INFO L87 Difference]: Start difference. First operand 612 states and 1463 transitions. Second operand 9 states. [2018-09-26 08:06:44,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:44,218 INFO L93 Difference]: Finished difference Result 854 states and 1987 transitions. [2018-09-26 08:06:44,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:06:44,219 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-09-26 08:06:44,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:44,222 INFO L225 Difference]: With dead ends: 854 [2018-09-26 08:06:44,222 INFO L226 Difference]: Without dead ends: 849 [2018-09-26 08:06:44,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:06:44,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-09-26 08:06:44,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 690. [2018-09-26 08:06:44,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-26 08:06:44,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1639 transitions. [2018-09-26 08:06:44,884 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1639 transitions. Word has length 13 [2018-09-26 08:06:44,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:44,884 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1639 transitions. [2018-09-26 08:06:44,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:44,884 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1639 transitions. [2018-09-26 08:06:44,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:44,885 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:44,885 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:44,886 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:44,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:44,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1456173380, now seen corresponding path program 1 times [2018-09-26 08:06:44,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:44,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:44,893 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:44,893 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 08:06:44,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:06:44,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:06:44,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:06:44,894 INFO L87 Difference]: Start difference. First operand 690 states and 1639 transitions. Second operand 5 states. [2018-09-26 08:06:45,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:45,533 INFO L93 Difference]: Finished difference Result 1308 states and 3113 transitions. [2018-09-26 08:06:45,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:06:45,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-26 08:06:45,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:45,535 INFO L225 Difference]: With dead ends: 1308 [2018-09-26 08:06:45,535 INFO L226 Difference]: Without dead ends: 709 [2018-09-26 08:06:45,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:45,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-09-26 08:06:46,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 690. [2018-09-26 08:06:46,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-26 08:06:46,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-09-26 08:06:46,173 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-09-26 08:06:46,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:46,174 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-09-26 08:06:46,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:06:46,174 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-09-26 08:06:46,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:06:46,174 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:46,175 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:46,175 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:46,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:46,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1952744875, now seen corresponding path program 1 times [2018-09-26 08:06:46,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:46,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:46,184 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:46,184 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:06:46,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:46,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:46,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:46,185 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 9 states. [2018-09-26 08:06:47,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:47,570 INFO L93 Difference]: Finished difference Result 979 states and 2143 transitions. [2018-09-26 08:06:47,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:06:47,570 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-26 08:06:47,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:47,574 INFO L225 Difference]: With dead ends: 979 [2018-09-26 08:06:47,574 INFO L226 Difference]: Without dead ends: 971 [2018-09-26 08:06:47,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:06:47,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2018-09-26 08:06:48,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 725. [2018-09-26 08:06:48,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2018-09-26 08:06:48,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1649 transitions. [2018-09-26 08:06:48,282 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1649 transitions. Word has length 16 [2018-09-26 08:06:48,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:48,282 INFO L480 AbstractCegarLoop]: Abstraction has 725 states and 1649 transitions. [2018-09-26 08:06:48,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:48,282 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1649 transitions. [2018-09-26 08:06:48,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:06:48,283 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:48,283 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:48,283 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:48,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:48,284 INFO L82 PathProgramCache]: Analyzing trace with hash -51223093, now seen corresponding path program 1 times [2018-09-26 08:06:48,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:48,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:48,294 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:48,295 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:06:48,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:48,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:48,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:48,295 INFO L87 Difference]: Start difference. First operand 725 states and 1649 transitions. Second operand 9 states. [2018-09-26 08:06:49,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:49,672 INFO L93 Difference]: Finished difference Result 1244 states and 2740 transitions. [2018-09-26 08:06:49,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:06:49,672 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-26 08:06:49,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:49,675 INFO L225 Difference]: With dead ends: 1244 [2018-09-26 08:06:49,675 INFO L226 Difference]: Without dead ends: 1236 [2018-09-26 08:06:49,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=248, Invalid=942, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:06:49,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2018-09-26 08:06:50,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 729. [2018-09-26 08:06:50,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2018-09-26 08:06:50,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1657 transitions. [2018-09-26 08:06:50,423 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1657 transitions. Word has length 16 [2018-09-26 08:06:50,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:50,423 INFO L480 AbstractCegarLoop]: Abstraction has 729 states and 1657 transitions. [2018-09-26 08:06:50,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:50,423 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1657 transitions. [2018-09-26 08:06:50,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:06:50,424 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:50,424 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:50,425 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:50,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:50,425 INFO L82 PathProgramCache]: Analyzing trace with hash -666637335, now seen corresponding path program 1 times [2018-09-26 08:06:50,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:50,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:50,435 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:50,436 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:06:50,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:50,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:50,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:50,436 INFO L87 Difference]: Start difference. First operand 729 states and 1657 transitions. Second operand 9 states. [2018-09-26 08:06:51,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:51,734 INFO L93 Difference]: Finished difference Result 1187 states and 2621 transitions. [2018-09-26 08:06:51,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:06:51,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-26 08:06:51,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:51,737 INFO L225 Difference]: With dead ends: 1187 [2018-09-26 08:06:51,737 INFO L226 Difference]: Without dead ends: 1179 [2018-09-26 08:06:51,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:06:51,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2018-09-26 08:06:52,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 753. [2018-09-26 08:06:52,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-09-26 08:06:52,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1711 transitions. [2018-09-26 08:06:52,577 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1711 transitions. Word has length 16 [2018-09-26 08:06:52,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:52,578 INFO L480 AbstractCegarLoop]: Abstraction has 753 states and 1711 transitions. [2018-09-26 08:06:52,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:52,578 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1711 transitions. [2018-09-26 08:06:52,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:06:52,578 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:52,578 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:52,579 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:52,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:52,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1147109874, now seen corresponding path program 1 times [2018-09-26 08:06:52,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:52,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:52,589 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:52,589 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:06:52,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:52,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:52,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:52,590 INFO L87 Difference]: Start difference. First operand 753 states and 1711 transitions. Second operand 9 states. [2018-09-26 08:06:54,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:54,015 INFO L93 Difference]: Finished difference Result 1221 states and 2662 transitions. [2018-09-26 08:06:54,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:06:54,015 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-26 08:06:54,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:54,019 INFO L225 Difference]: With dead ends: 1221 [2018-09-26 08:06:54,019 INFO L226 Difference]: Without dead ends: 1213 [2018-09-26 08:06:54,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=211, Invalid=781, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:06:54,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2018-09-26 08:06:54,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 741. [2018-09-26 08:06:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-09-26 08:06:54,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1684 transitions. [2018-09-26 08:06:54,789 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1684 transitions. Word has length 16 [2018-09-26 08:06:54,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:54,789 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 1684 transitions. [2018-09-26 08:06:54,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:54,789 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1684 transitions. [2018-09-26 08:06:54,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:06:54,790 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:54,790 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:54,791 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:54,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:54,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1762524116, now seen corresponding path program 1 times [2018-09-26 08:06:54,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:54,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:54,802 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:54,802 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:06:54,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:54,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:54,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:54,803 INFO L87 Difference]: Start difference. First operand 741 states and 1684 transitions. Second operand 9 states. [2018-09-26 08:06:56,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:56,318 INFO L93 Difference]: Finished difference Result 1356 states and 2971 transitions. [2018-09-26 08:06:56,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:06:56,318 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-26 08:06:56,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:56,322 INFO L225 Difference]: With dead ends: 1356 [2018-09-26 08:06:56,322 INFO L226 Difference]: Without dead ends: 1348 [2018-09-26 08:06:56,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:06:56,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2018-09-26 08:06:57,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 737. [2018-09-26 08:06:57,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2018-09-26 08:06:57,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1676 transitions. [2018-09-26 08:06:57,054 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1676 transitions. Word has length 16 [2018-09-26 08:06:57,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:57,054 INFO L480 AbstractCegarLoop]: Abstraction has 737 states and 1676 transitions. [2018-09-26 08:06:57,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:57,054 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1676 transitions. [2018-09-26 08:06:57,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:06:57,055 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:57,055 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:57,056 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:57,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:57,056 INFO L82 PathProgramCache]: Analyzing trace with hash 352691054, now seen corresponding path program 1 times [2018-09-26 08:06:57,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:57,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:57,067 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:57,067 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:06:57,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:57,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:57,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:57,069 INFO L87 Difference]: Start difference. First operand 737 states and 1676 transitions. Second operand 9 states. [2018-09-26 08:06:58,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:58,584 INFO L93 Difference]: Finished difference Result 1200 states and 2616 transitions. [2018-09-26 08:06:58,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:06:58,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-26 08:06:58,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:58,588 INFO L225 Difference]: With dead ends: 1200 [2018-09-26 08:06:58,588 INFO L226 Difference]: Without dead ends: 1192 [2018-09-26 08:06:58,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:06:58,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2018-09-26 08:06:59,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 645. [2018-09-26 08:06:59,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2018-09-26 08:06:59,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1456 transitions. [2018-09-26 08:06:59,319 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1456 transitions. Word has length 16 [2018-09-26 08:06:59,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:59,319 INFO L480 AbstractCegarLoop]: Abstraction has 645 states and 1456 transitions. [2018-09-26 08:06:59,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:59,319 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1456 transitions. [2018-09-26 08:06:59,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:06:59,320 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:59,320 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:59,321 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:59,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:59,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1212722005, now seen corresponding path program 1 times [2018-09-26 08:06:59,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:59,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:59,331 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:59,331 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:06:59,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:59,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:59,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:59,332 INFO L87 Difference]: Start difference. First operand 645 states and 1456 transitions. Second operand 9 states. [2018-09-26 08:07:00,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:00,593 INFO L93 Difference]: Finished difference Result 978 states and 2118 transitions. [2018-09-26 08:07:00,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:07:00,593 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-26 08:07:00,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:00,595 INFO L225 Difference]: With dead ends: 978 [2018-09-26 08:07:00,595 INFO L226 Difference]: Without dead ends: 970 [2018-09-26 08:07:00,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:07:00,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2018-09-26 08:07:01,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 655. [2018-09-26 08:07:01,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2018-09-26 08:07:01,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1483 transitions. [2018-09-26 08:07:01,242 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1483 transitions. Word has length 16 [2018-09-26 08:07:01,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:01,242 INFO L480 AbstractCegarLoop]: Abstraction has 655 states and 1483 transitions. [2018-09-26 08:07:01,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:01,242 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1483 transitions. [2018-09-26 08:07:01,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:01,243 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:01,243 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:01,243 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:01,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:01,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1212619860, now seen corresponding path program 1 times [2018-09-26 08:07:01,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:01,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:01,253 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:01,253 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:01,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:07:01,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:07:01,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:07:01,254 INFO L87 Difference]: Start difference. First operand 655 states and 1483 transitions. Second operand 9 states. [2018-09-26 08:07:02,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:02,379 INFO L93 Difference]: Finished difference Result 920 states and 1979 transitions. [2018-09-26 08:07:02,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:07:02,379 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-26 08:07:02,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:02,381 INFO L225 Difference]: With dead ends: 920 [2018-09-26 08:07:02,381 INFO L226 Difference]: Without dead ends: 912 [2018-09-26 08:07:02,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:07:02,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2018-09-26 08:07:03,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 651. [2018-09-26 08:07:03,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-09-26 08:07:03,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1473 transitions. [2018-09-26 08:07:03,035 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1473 transitions. Word has length 16 [2018-09-26 08:07:03,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:03,035 INFO L480 AbstractCegarLoop]: Abstraction has 651 states and 1473 transitions. [2018-09-26 08:07:03,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:03,036 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1473 transitions. [2018-09-26 08:07:03,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:03,036 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:03,036 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:03,036 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:03,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:03,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1203705624, now seen corresponding path program 1 times [2018-09-26 08:07:03,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:03,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:03,045 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:03,045 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:03,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:07:03,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:07:03,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:07:03,046 INFO L87 Difference]: Start difference. First operand 651 states and 1473 transitions. Second operand 9 states. [2018-09-26 08:07:04,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:04,092 INFO L93 Difference]: Finished difference Result 859 states and 1857 transitions. [2018-09-26 08:07:04,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:07:04,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-26 08:07:04,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:04,094 INFO L225 Difference]: With dead ends: 859 [2018-09-26 08:07:04,094 INFO L226 Difference]: Without dead ends: 851 [2018-09-26 08:07:04,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:07:04,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-09-26 08:07:04,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 664. [2018-09-26 08:07:04,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-09-26 08:07:04,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1495 transitions. [2018-09-26 08:07:04,759 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1495 transitions. Word has length 16 [2018-09-26 08:07:04,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:04,760 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 1495 transitions. [2018-09-26 08:07:04,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:04,760 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1495 transitions. [2018-09-26 08:07:04,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:04,760 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:04,760 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:04,761 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:04,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:04,761 INFO L82 PathProgramCache]: Analyzing trace with hash -345007351, now seen corresponding path program 1 times [2018-09-26 08:07:04,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:04,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:07:04,769 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:04,769 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:04,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:04,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:04,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:04,770 INFO L87 Difference]: Start difference. First operand 664 states and 1495 transitions. Second operand 8 states. [2018-09-26 08:07:06,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:06,043 INFO L93 Difference]: Finished difference Result 1152 states and 2505 transitions. [2018-09-26 08:07:06,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:07:06,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:07:06,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:06,045 INFO L225 Difference]: With dead ends: 1152 [2018-09-26 08:07:06,045 INFO L226 Difference]: Without dead ends: 1144 [2018-09-26 08:07:06,046 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:07:06,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2018-09-26 08:07:06,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 847. [2018-09-26 08:07:06,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2018-09-26 08:07:06,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1923 transitions. [2018-09-26 08:07:06,848 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1923 transitions. Word has length 16 [2018-09-26 08:07:06,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:06,848 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 1923 transitions. [2018-09-26 08:07:06,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:06,849 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1923 transitions. [2018-09-26 08:07:06,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:06,849 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:06,850 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:06,850 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:06,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:06,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521947, now seen corresponding path program 1 times [2018-09-26 08:07:06,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:06,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:07:06,858 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:06,858 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:06,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:06,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:06,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:06,859 INFO L87 Difference]: Start difference. First operand 847 states and 1923 transitions. Second operand 8 states. [2018-09-26 08:07:08,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:08,358 INFO L93 Difference]: Finished difference Result 1279 states and 2776 transitions. [2018-09-26 08:07:08,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:07:08,358 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:07:08,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:08,360 INFO L225 Difference]: With dead ends: 1279 [2018-09-26 08:07:08,360 INFO L226 Difference]: Without dead ends: 1271 [2018-09-26 08:07:08,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:07:08,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2018-09-26 08:07:09,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 855. [2018-09-26 08:07:09,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2018-09-26 08:07:09,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1939 transitions. [2018-09-26 08:07:09,192 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1939 transitions. Word has length 16 [2018-09-26 08:07:09,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:09,193 INFO L480 AbstractCegarLoop]: Abstraction has 855 states and 1939 transitions. [2018-09-26 08:07:09,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:09,193 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1939 transitions. [2018-09-26 08:07:09,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:09,193 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:09,193 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:09,193 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:09,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:09,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521668, now seen corresponding path program 1 times [2018-09-26 08:07:09,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:09,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:07:09,199 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:09,199 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:09,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:09,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:09,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:09,200 INFO L87 Difference]: Start difference. First operand 855 states and 1939 transitions. Second operand 8 states. [2018-09-26 08:07:10,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:10,710 INFO L93 Difference]: Finished difference Result 1342 states and 2933 transitions. [2018-09-26 08:07:10,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:07:10,711 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:07:10,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:10,712 INFO L225 Difference]: With dead ends: 1342 [2018-09-26 08:07:10,712 INFO L226 Difference]: Without dead ends: 1334 [2018-09-26 08:07:10,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:07:10,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2018-09-26 08:07:11,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 916. [2018-09-26 08:07:11,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-09-26 08:07:11,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 2080 transitions. [2018-09-26 08:07:11,592 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 2080 transitions. Word has length 16 [2018-09-26 08:07:11,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:11,592 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 2080 transitions. [2018-09-26 08:07:11,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:11,593 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 2080 transitions. [2018-09-26 08:07:11,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:11,593 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:11,593 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:11,593 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:11,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:11,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1133346772, now seen corresponding path program 1 times [2018-09-26 08:07:11,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:11,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:07:11,602 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:11,602 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:11,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:11,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:11,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:11,603 INFO L87 Difference]: Start difference. First operand 916 states and 2080 transitions. Second operand 8 states. [2018-09-26 08:07:13,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:13,064 INFO L93 Difference]: Finished difference Result 1371 states and 2977 transitions. [2018-09-26 08:07:13,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:07:13,064 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:07:13,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:13,066 INFO L225 Difference]: With dead ends: 1371 [2018-09-26 08:07:13,066 INFO L226 Difference]: Without dead ends: 1363 [2018-09-26 08:07:13,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:07:13,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2018-09-26 08:07:14,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 937. [2018-09-26 08:07:14,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2018-09-26 08:07:14,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 2125 transitions. [2018-09-26 08:07:14,064 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 2125 transitions. Word has length 16 [2018-09-26 08:07:14,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:14,064 INFO L480 AbstractCegarLoop]: Abstraction has 937 states and 2125 transitions. [2018-09-26 08:07:14,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:14,065 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 2125 transitions. [2018-09-26 08:07:14,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:14,065 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:14,065 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:14,065 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:14,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:14,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1133347051, now seen corresponding path program 1 times [2018-09-26 08:07:14,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:14,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:07:14,071 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:14,071 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:14,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:14,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:14,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:14,072 INFO L87 Difference]: Start difference. First operand 937 states and 2125 transitions. Second operand 8 states. [2018-09-26 08:07:15,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:15,818 INFO L93 Difference]: Finished difference Result 1543 states and 3361 transitions. [2018-09-26 08:07:15,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:07:15,818 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:07:15,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:15,820 INFO L225 Difference]: With dead ends: 1543 [2018-09-26 08:07:15,820 INFO L226 Difference]: Without dead ends: 1535 [2018-09-26 08:07:15,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:07:15,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2018-09-26 08:07:16,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 920. [2018-09-26 08:07:16,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2018-09-26 08:07:16,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 2088 transitions. [2018-09-26 08:07:16,739 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 2088 transitions. Word has length 16 [2018-09-26 08:07:16,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:16,739 INFO L480 AbstractCegarLoop]: Abstraction has 920 states and 2088 transitions. [2018-09-26 08:07:16,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:16,740 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 2088 transitions. [2018-09-26 08:07:16,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:16,740 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:16,741 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:16,741 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:16,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:16,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1137226608, now seen corresponding path program 1 times [2018-09-26 08:07:16,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:16,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:07:16,752 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:16,752 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:16,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:16,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:16,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:16,753 INFO L87 Difference]: Start difference. First operand 920 states and 2088 transitions. Second operand 8 states. [2018-09-26 08:07:18,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:18,480 INFO L93 Difference]: Finished difference Result 1402 states and 3065 transitions. [2018-09-26 08:07:18,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:07:18,480 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:07:18,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:18,482 INFO L225 Difference]: With dead ends: 1402 [2018-09-26 08:07:18,482 INFO L226 Difference]: Without dead ends: 1394 [2018-09-26 08:07:18,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:07:18,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2018-09-26 08:07:19,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 933. [2018-09-26 08:07:19,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-09-26 08:07:19,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 2117 transitions. [2018-09-26 08:07:19,425 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 2117 transitions. Word has length 16 [2018-09-26 08:07:19,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:19,425 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 2117 transitions. [2018-09-26 08:07:19,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:19,425 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 2117 transitions. [2018-09-26 08:07:19,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:19,426 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:19,426 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:19,426 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:19,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:19,426 INFO L82 PathProgramCache]: Analyzing trace with hash 918935888, now seen corresponding path program 1 times [2018-09-26 08:07:19,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:19,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:07:19,433 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:19,433 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:19,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:19,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:19,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:19,434 INFO L87 Difference]: Start difference. First operand 933 states and 2117 transitions. Second operand 8 states. [2018-09-26 08:07:20,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:20,773 INFO L93 Difference]: Finished difference Result 1226 states and 2691 transitions. [2018-09-26 08:07:20,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:07:20,774 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:07:20,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:20,775 INFO L225 Difference]: With dead ends: 1226 [2018-09-26 08:07:20,775 INFO L226 Difference]: Without dead ends: 1218 [2018-09-26 08:07:20,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:07:20,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2018-09-26 08:07:21,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 916. [2018-09-26 08:07:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-09-26 08:07:21,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 2074 transitions. [2018-09-26 08:07:21,724 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 2074 transitions. Word has length 16 [2018-09-26 08:07:21,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:21,724 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 2074 transitions. [2018-09-26 08:07:21,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:21,724 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 2074 transitions. [2018-09-26 08:07:21,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:21,725 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:21,725 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:21,726 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:21,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:21,726 INFO L82 PathProgramCache]: Analyzing trace with hash 918936167, now seen corresponding path program 1 times [2018-09-26 08:07:21,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:21,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:07:21,732 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:21,732 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:21,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:21,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:21,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:21,733 INFO L87 Difference]: Start difference. First operand 916 states and 2074 transitions. Second operand 8 states. [2018-09-26 08:07:23,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:23,450 INFO L93 Difference]: Finished difference Result 1398 states and 3075 transitions. [2018-09-26 08:07:23,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:07:23,450 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:07:23,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:23,452 INFO L225 Difference]: With dead ends: 1398 [2018-09-26 08:07:23,452 INFO L226 Difference]: Without dead ends: 1390 [2018-09-26 08:07:23,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:07:23,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2018-09-26 08:07:24,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 899. [2018-09-26 08:07:24,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-09-26 08:07:24,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 2037 transitions. [2018-09-26 08:07:24,386 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 2037 transitions. Word has length 16 [2018-09-26 08:07:24,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:24,386 INFO L480 AbstractCegarLoop]: Abstraction has 899 states and 2037 transitions. [2018-09-26 08:07:24,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:24,386 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 2037 transitions. [2018-09-26 08:07:24,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:24,387 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:24,387 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:24,387 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:24,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:24,387 INFO L82 PathProgramCache]: Analyzing trace with hash 922815724, now seen corresponding path program 1 times [2018-09-26 08:07:24,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:24,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:07:24,393 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:24,393 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:24,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:24,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:24,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:24,393 INFO L87 Difference]: Start difference. First operand 899 states and 2037 transitions. Second operand 8 states. [2018-09-26 08:07:26,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:26,144 INFO L93 Difference]: Finished difference Result 1445 states and 3179 transitions. [2018-09-26 08:07:26,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:07:26,145 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:07:26,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:26,146 INFO L225 Difference]: With dead ends: 1445 [2018-09-26 08:07:26,147 INFO L226 Difference]: Without dead ends: 1437 [2018-09-26 08:07:26,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:07:26,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2018-09-26 08:07:27,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 895. [2018-09-26 08:07:27,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-09-26 08:07:27,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 2029 transitions. [2018-09-26 08:07:27,091 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 2029 transitions. Word has length 16 [2018-09-26 08:07:27,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:27,092 INFO L480 AbstractCegarLoop]: Abstraction has 895 states and 2029 transitions. [2018-09-26 08:07:27,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:27,092 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 2029 transitions. [2018-09-26 08:07:27,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:27,092 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:27,092 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:27,093 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:27,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:27,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1012397261, now seen corresponding path program 1 times [2018-09-26 08:07:27,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:27,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:07:27,101 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:27,101 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:27,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:27,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:27,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:27,102 INFO L87 Difference]: Start difference. First operand 895 states and 2029 transitions. Second operand 8 states. [2018-09-26 08:07:28,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:28,557 INFO L93 Difference]: Finished difference Result 1158 states and 2543 transitions. [2018-09-26 08:07:28,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:07:28,558 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:07:28,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:28,559 INFO L225 Difference]: With dead ends: 1158 [2018-09-26 08:07:28,559 INFO L226 Difference]: Without dead ends: 1150 [2018-09-26 08:07:28,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:07:28,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2018-09-26 08:07:29,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 856. [2018-09-26 08:07:29,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-09-26 08:07:29,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1928 transitions. [2018-09-26 08:07:29,475 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1928 transitions. Word has length 16 [2018-09-26 08:07:29,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:29,476 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 1928 transitions. [2018-09-26 08:07:29,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:29,476 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1928 transitions. [2018-09-26 08:07:29,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:07:29,476 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:29,476 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:29,476 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:29,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:29,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1223690942, now seen corresponding path program 1 times [2018-09-26 08:07:29,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:29,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:29,493 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:29,493 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:07:29,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:07:29,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:07:29,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:07:29,494 INFO L87 Difference]: Start difference. First operand 856 states and 1928 transitions. Second operand 11 states. [2018-09-26 08:07:31,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:31,834 INFO L93 Difference]: Finished difference Result 1562 states and 3408 transitions. [2018-09-26 08:07:31,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:07:31,834 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2018-09-26 08:07:31,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:31,836 INFO L225 Difference]: With dead ends: 1562 [2018-09-26 08:07:31,836 INFO L226 Difference]: Without dead ends: 1554 [2018-09-26 08:07:31,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=373, Invalid=959, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:07:31,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2018-09-26 08:07:33,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1302. [2018-09-26 08:07:33,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1302 states. [2018-09-26 08:07:33,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 2930 transitions. [2018-09-26 08:07:33,509 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 2930 transitions. Word has length 17 [2018-09-26 08:07:33,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:33,509 INFO L480 AbstractCegarLoop]: Abstraction has 1302 states and 2930 transitions. [2018-09-26 08:07:33,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:07:33,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 2930 transitions. [2018-09-26 08:07:33,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:07:33,510 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:33,510 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:33,511 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:33,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:33,511 INFO L82 PathProgramCache]: Analyzing trace with hash 532189918, now seen corresponding path program 1 times [2018-09-26 08:07:33,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:33,524 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:33,525 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:07:33,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:07:33,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:07:33,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:07:33,525 INFO L87 Difference]: Start difference. First operand 1302 states and 2930 transitions. Second operand 11 states. [2018-09-26 08:07:36,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:36,549 INFO L93 Difference]: Finished difference Result 2066 states and 4562 transitions. [2018-09-26 08:07:36,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:07:36,549 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-26 08:07:36,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:36,552 INFO L225 Difference]: With dead ends: 2066 [2018-09-26 08:07:36,552 INFO L226 Difference]: Without dead ends: 2058 [2018-09-26 08:07:36,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=168, Invalid=762, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:07:36,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2018-09-26 08:07:38,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 1536. [2018-09-26 08:07:38,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1536 states. [2018-09-26 08:07:38,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 3466 transitions. [2018-09-26 08:07:38,734 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 3466 transitions. Word has length 20 [2018-09-26 08:07:38,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:38,734 INFO L480 AbstractCegarLoop]: Abstraction has 1536 states and 3466 transitions. [2018-09-26 08:07:38,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:07:38,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 3466 transitions. [2018-09-26 08:07:38,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:07:38,735 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:38,735 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:38,736 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:38,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:38,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1283316220, now seen corresponding path program 1 times [2018-09-26 08:07:38,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:38,749 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:38,749 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:38,749 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:07:38,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:07:38,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:07:38,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:07:38,750 INFO L87 Difference]: Start difference. First operand 1536 states and 3466 transitions. Second operand 11 states. [2018-09-26 08:07:42,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:42,308 INFO L93 Difference]: Finished difference Result 2629 states and 5838 transitions. [2018-09-26 08:07:42,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:07:42,308 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-26 08:07:42,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:42,312 INFO L225 Difference]: With dead ends: 2629 [2018-09-26 08:07:42,312 INFO L226 Difference]: Without dead ends: 2621 [2018-09-26 08:07:42,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=279, Invalid=1527, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:07:42,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2621 states. [2018-09-26 08:07:45,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2621 to 2078. [2018-09-26 08:07:45,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2078 states. [2018-09-26 08:07:45,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 2078 states and 4754 transitions. [2018-09-26 08:07:45,046 INFO L78 Accepts]: Start accepts. Automaton has 2078 states and 4754 transitions. Word has length 20 [2018-09-26 08:07:45,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:45,046 INFO L480 AbstractCegarLoop]: Abstraction has 2078 states and 4754 transitions. [2018-09-26 08:07:45,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:07:45,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 4754 transitions. [2018-09-26 08:07:45,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:07:45,048 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:45,048 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:45,048 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:45,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:45,049 INFO L82 PathProgramCache]: Analyzing trace with hash -214966810, now seen corresponding path program 1 times [2018-09-26 08:07:45,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:45,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:45,061 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:45,061 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:07:45,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:07:45,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:07:45,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:07:45,062 INFO L87 Difference]: Start difference. First operand 2078 states and 4754 transitions. Second operand 11 states. [2018-09-26 08:07:50,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:50,441 INFO L93 Difference]: Finished difference Result 4196 states and 9626 transitions. [2018-09-26 08:07:50,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:07:50,442 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-26 08:07:50,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:50,446 INFO L225 Difference]: With dead ends: 4196 [2018-09-26 08:07:50,446 INFO L226 Difference]: Without dead ends: 4188 [2018-09-26 08:07:50,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=322, Invalid=1570, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:07:50,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4188 states. [2018-09-26 08:07:53,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4188 to 2494. [2018-09-26 08:07:53,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2494 states. [2018-09-26 08:07:53,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2494 states to 2494 states and 5846 transitions. [2018-09-26 08:07:53,350 INFO L78 Accepts]: Start accepts. Automaton has 2494 states and 5846 transitions. Word has length 20 [2018-09-26 08:07:53,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:53,350 INFO L480 AbstractCegarLoop]: Abstraction has 2494 states and 5846 transitions. [2018-09-26 08:07:53,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:07:53,350 INFO L276 IsEmpty]: Start isEmpty. Operand 2494 states and 5846 transitions. [2018-09-26 08:07:53,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:07:53,352 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:53,352 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:53,352 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:53,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:53,352 INFO L82 PathProgramCache]: Analyzing trace with hash 523391216, now seen corresponding path program 1 times [2018-09-26 08:07:53,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:53,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:53,365 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:53,366 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:07:53,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:07:53,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:07:53,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:07:53,366 INFO L87 Difference]: Start difference. First operand 2494 states and 5846 transitions. Second operand 11 states. [2018-09-26 08:07:58,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:58,580 INFO L93 Difference]: Finished difference Result 4092 states and 9349 transitions. [2018-09-26 08:07:58,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:07:58,580 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-26 08:07:58,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:58,586 INFO L225 Difference]: With dead ends: 4092 [2018-09-26 08:07:58,587 INFO L226 Difference]: Without dead ends: 4084 [2018-09-26 08:07:58,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=450, Invalid=2306, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:07:58,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4084 states. [2018-09-26 08:08:01,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4084 to 2506. [2018-09-26 08:08:01,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2018-09-26 08:08:01,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 5876 transitions. [2018-09-26 08:08:01,585 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 5876 transitions. Word has length 20 [2018-09-26 08:08:01,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:01,585 INFO L480 AbstractCegarLoop]: Abstraction has 2506 states and 5876 transitions. [2018-09-26 08:08:01,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:08:01,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 5876 transitions. [2018-09-26 08:08:01,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:08:01,587 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:01,587 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:01,587 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:01,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:01,588 INFO L82 PathProgramCache]: Analyzing trace with hash 520590862, now seen corresponding path program 1 times [2018-09-26 08:08:01,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:01,597 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:01,597 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:01,597 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:08:01,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:08:01,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:08:01,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:08:01,598 INFO L87 Difference]: Start difference. First operand 2506 states and 5876 transitions. Second operand 11 states. [2018-09-26 08:08:07,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:07,019 INFO L93 Difference]: Finished difference Result 4084 states and 9319 transitions. [2018-09-26 08:08:07,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:08:07,019 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-26 08:08:07,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:07,024 INFO L225 Difference]: With dead ends: 4084 [2018-09-26 08:08:07,024 INFO L226 Difference]: Without dead ends: 4076 [2018-09-26 08:08:07,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=354, Invalid=1716, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:08:07,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4076 states. [2018-09-26 08:08:10,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4076 to 2630. [2018-09-26 08:08:10,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2018-09-26 08:08:10,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 6208 transitions. [2018-09-26 08:08:10,084 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 6208 transitions. Word has length 20 [2018-09-26 08:08:10,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:10,084 INFO L480 AbstractCegarLoop]: Abstraction has 2630 states and 6208 transitions. [2018-09-26 08:08:10,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:08:10,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 6208 transitions. [2018-09-26 08:08:10,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:08:10,086 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:10,086 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:10,086 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:10,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:10,086 INFO L82 PathProgramCache]: Analyzing trace with hash 520693007, now seen corresponding path program 1 times [2018-09-26 08:08:10,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:10,095 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:10,096 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:10,096 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:08:10,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:08:10,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:08:10,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:08:10,097 INFO L87 Difference]: Start difference. First operand 2630 states and 6208 transitions. Second operand 11 states. [2018-09-26 08:08:15,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:15,164 INFO L93 Difference]: Finished difference Result 3737 states and 8511 transitions. [2018-09-26 08:08:15,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:08:15,164 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-26 08:08:15,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:15,169 INFO L225 Difference]: With dead ends: 3737 [2018-09-26 08:08:15,169 INFO L226 Difference]: Without dead ends: 3729 [2018-09-26 08:08:15,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=224, Invalid=966, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:08:15,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3729 states. [2018-09-26 08:08:18,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3729 to 2684. [2018-09-26 08:08:18,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2684 states. [2018-09-26 08:08:18,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 6332 transitions. [2018-09-26 08:08:18,352 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 6332 transitions. Word has length 20 [2018-09-26 08:08:18,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:18,353 INFO L480 AbstractCegarLoop]: Abstraction has 2684 states and 6332 transitions. [2018-09-26 08:08:18,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:08:18,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 6332 transitions. [2018-09-26 08:08:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:08:18,355 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:18,355 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:18,355 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:18,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:18,355 INFO L82 PathProgramCache]: Analyzing trace with hash 759878049, now seen corresponding path program 1 times [2018-09-26 08:08:18,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:18,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:18,368 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:18,368 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:08:18,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:08:18,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:08:18,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:08:18,368 INFO L87 Difference]: Start difference. First operand 2684 states and 6332 transitions. Second operand 11 states. [2018-09-26 08:08:22,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:22,643 INFO L93 Difference]: Finished difference Result 3287 states and 7584 transitions. [2018-09-26 08:08:22,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:08:22,644 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-26 08:08:22,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:22,648 INFO L225 Difference]: With dead ends: 3287 [2018-09-26 08:08:22,648 INFO L226 Difference]: Without dead ends: 3279 [2018-09-26 08:08:22,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:08:22,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2018-09-26 08:08:25,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 2762. [2018-09-26 08:08:25,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2762 states. [2018-09-26 08:08:25,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 6495 transitions. [2018-09-26 08:08:25,985 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 6495 transitions. Word has length 20 [2018-09-26 08:08:25,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:25,985 INFO L480 AbstractCegarLoop]: Abstraction has 2762 states and 6495 transitions. [2018-09-26 08:08:25,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:08:25,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 6495 transitions. [2018-09-26 08:08:25,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:08:25,987 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:25,987 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:25,987 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:25,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:25,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1511004351, now seen corresponding path program 1 times [2018-09-26 08:08:25,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:26,000 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:26,000 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:26,000 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:08:26,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:08:26,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:08:26,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:08:26,001 INFO L87 Difference]: Start difference. First operand 2762 states and 6495 transitions. Second operand 11 states. [2018-09-26 08:08:31,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:31,112 INFO L93 Difference]: Finished difference Result 3559 states and 8170 transitions. [2018-09-26 08:08:31,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:08:31,112 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-26 08:08:31,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:31,121 INFO L225 Difference]: With dead ends: 3559 [2018-09-26 08:08:31,121 INFO L226 Difference]: Without dead ends: 3551 [2018-09-26 08:08:31,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=172, Invalid=820, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:08:31,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3551 states. [2018-09-26 08:08:34,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3551 to 2944. [2018-09-26 08:08:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2944 states. [2018-09-26 08:08:34,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 6904 transitions. [2018-09-26 08:08:34,717 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 6904 transitions. Word has length 20 [2018-09-26 08:08:34,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:34,718 INFO L480 AbstractCegarLoop]: Abstraction has 2944 states and 6904 transitions. [2018-09-26 08:08:34,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:08:34,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 6904 transitions. [2018-09-26 08:08:34,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:08:34,719 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:34,719 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:34,719 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:34,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:34,720 INFO L82 PathProgramCache]: Analyzing trace with hash 12721321, now seen corresponding path program 1 times [2018-09-26 08:08:34,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:34,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:34,729 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:34,729 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:08:34,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:08:34,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:08:34,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:08:34,730 INFO L87 Difference]: Start difference. First operand 2944 states and 6904 transitions. Second operand 11 states. [2018-09-26 08:08:40,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:40,053 INFO L93 Difference]: Finished difference Result 3950 states and 9027 transitions. [2018-09-26 08:08:40,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:08:40,053 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-26 08:08:40,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:40,060 INFO L225 Difference]: With dead ends: 3950 [2018-09-26 08:08:40,060 INFO L226 Difference]: Without dead ends: 3942 [2018-09-26 08:08:40,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=258, Invalid=1382, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:08:40,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3942 states. [2018-09-26 08:08:43,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3942 to 3054. [2018-09-26 08:08:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3054 states. [2018-09-26 08:08:43,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3054 states to 3054 states and 7161 transitions. [2018-09-26 08:08:43,745 INFO L78 Accepts]: Start accepts. Automaton has 3054 states and 7161 transitions. Word has length 20 [2018-09-26 08:08:43,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:43,745 INFO L480 AbstractCegarLoop]: Abstraction has 3054 states and 7161 transitions. [2018-09-26 08:08:43,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:08:43,745 INFO L276 IsEmpty]: Start isEmpty. Operand 3054 states and 7161 transitions. [2018-09-26 08:08:43,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:08:43,746 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:43,747 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] [2018-09-26 08:08:43,747 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:43,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:43,747 INFO L82 PathProgramCache]: Analyzing trace with hash 751079347, now seen corresponding path program 1 times [2018-09-26 08:08:43,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:43,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:43,759 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:43,759 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:08:43,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:08:43,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:08:43,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:08:43,760 INFO L87 Difference]: Start difference. First operand 3054 states and 7161 transitions. Second operand 11 states. [2018-09-26 08:08:48,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:48,548 INFO L93 Difference]: Finished difference Result 3761 states and 8627 transitions. [2018-09-26 08:08:48,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:08:48,548 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-26 08:08:48,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:48,552 INFO L225 Difference]: With dead ends: 3761 [2018-09-26 08:08:48,552 INFO L226 Difference]: Without dead ends: 3753 [2018-09-26 08:08:48,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=262, Invalid=1298, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:08:48,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3753 states. [2018-09-26 08:08:52,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3753 to 3054. [2018-09-26 08:08:52,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3054 states. [2018-09-26 08:08:52,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3054 states to 3054 states and 7161 transitions. [2018-09-26 08:08:52,202 INFO L78 Accepts]: Start accepts. Automaton has 3054 states and 7161 transitions. Word has length 20 [2018-09-26 08:08:52,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:52,202 INFO L480 AbstractCegarLoop]: Abstraction has 3054 states and 7161 transitions. [2018-09-26 08:08:52,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:08:52,202 INFO L276 IsEmpty]: Start isEmpty. Operand 3054 states and 7161 transitions. [2018-09-26 08:08:52,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:08:52,204 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:52,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] [2018-09-26 08:08:52,204 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:52,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:52,204 INFO L82 PathProgramCache]: Analyzing trace with hash 748278993, now seen corresponding path program 1 times [2018-09-26 08:08:52,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:52,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:52,215 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:52,215 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:08:52,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:08:52,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:08:52,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:08:52,216 INFO L87 Difference]: Start difference. First operand 3054 states and 7161 transitions. Second operand 11 states. [2018-09-26 08:08:57,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:57,031 INFO L93 Difference]: Finished difference Result 3732 states and 8563 transitions. [2018-09-26 08:08:57,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:08:57,031 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-26 08:08:57,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:57,036 INFO L225 Difference]: With dead ends: 3732 [2018-09-26 08:08:57,036 INFO L226 Difference]: Without dead ends: 3724 [2018-09-26 08:08:57,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=216, Invalid=974, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:08:57,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2018-09-26 08:09:00,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3026. [2018-09-26 08:09:00,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3026 states. [2018-09-26 08:09:00,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3026 states to 3026 states and 7081 transitions. [2018-09-26 08:09:00,740 INFO L78 Accepts]: Start accepts. Automaton has 3026 states and 7081 transitions. Word has length 20 [2018-09-26 08:09:00,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:00,740 INFO L480 AbstractCegarLoop]: Abstraction has 3026 states and 7081 transitions. [2018-09-26 08:09:00,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:09:00,740 INFO L276 IsEmpty]: Start isEmpty. Operand 3026 states and 7081 transitions. [2018-09-26 08:09:00,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:09:00,742 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:00,742 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:00,742 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:00,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:00,742 INFO L82 PathProgramCache]: Analyzing trace with hash 748381138, now seen corresponding path program 1 times [2018-09-26 08:09:00,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:00,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:00,752 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:00,752 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:09:00,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:09:00,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:09:00,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:09:00,752 INFO L87 Difference]: Start difference. First operand 3026 states and 7081 transitions. Second operand 11 states. [2018-09-26 08:09:05,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:05,470 INFO L93 Difference]: Finished difference Result 3407 states and 7825 transitions. [2018-09-26 08:09:05,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:09:05,471 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-26 08:09:05,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:05,474 INFO L225 Difference]: With dead ends: 3407 [2018-09-26 08:09:05,474 INFO L226 Difference]: Without dead ends: 3399 [2018-09-26 08:09:05,475 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:09:05,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2018-09-26 08:09:09,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 3008. [2018-09-26 08:09:09,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2018-09-26 08:09:09,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 7021 transitions. [2018-09-26 08:09:09,111 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 7021 transitions. Word has length 20 [2018-09-26 08:09:09,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:09,111 INFO L480 AbstractCegarLoop]: Abstraction has 3008 states and 7021 transitions. [2018-09-26 08:09:09,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:09:09,112 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 7021 transitions. [2018-09-26 08:09:09,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:09:09,113 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:09,113 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:09,113 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:09,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:09,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1524516609, now seen corresponding path program 1 times [2018-09-26 08:09:09,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:09,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:09,124 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:09,124 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:09:09,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:09:09,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:09:09,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:09:09,125 INFO L87 Difference]: Start difference. First operand 3008 states and 7021 transitions. Second operand 11 states. [2018-09-26 08:09:14,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:14,503 INFO L93 Difference]: Finished difference Result 3906 states and 8949 transitions. [2018-09-26 08:09:14,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:09:14,504 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-26 08:09:14,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:14,509 INFO L225 Difference]: With dead ends: 3906 [2018-09-26 08:09:14,509 INFO L226 Difference]: Without dead ends: 3898 [2018-09-26 08:09:14,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=179, Invalid=877, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:09:14,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3898 states. [2018-09-26 08:09:18,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3898 to 3115. [2018-09-26 08:09:18,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2018-09-26 08:09:18,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 7274 transitions. [2018-09-26 08:09:18,472 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 7274 transitions. Word has length 20 [2018-09-26 08:09:18,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:18,473 INFO L480 AbstractCegarLoop]: Abstraction has 3115 states and 7274 transitions. [2018-09-26 08:09:18,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:09:18,473 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 7274 transitions. [2018-09-26 08:09:18,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:09:18,475 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:18,475 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:18,476 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:18,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:18,476 INFO L82 PathProgramCache]: Analyzing trace with hash 26233579, now seen corresponding path program 1 times [2018-09-26 08:09:18,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:18,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:18,486 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:18,486 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:09:18,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:09:18,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:09:18,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:09:18,486 INFO L87 Difference]: Start difference. First operand 3115 states and 7274 transitions. Second operand 11 states. [2018-09-26 08:09:24,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:24,240 INFO L93 Difference]: Finished difference Result 4110 states and 9407 transitions. [2018-09-26 08:09:24,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:09:24,240 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-26 08:09:24,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:24,245 INFO L225 Difference]: With dead ends: 4110 [2018-09-26 08:09:24,245 INFO L226 Difference]: Without dead ends: 4102 [2018-09-26 08:09:24,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=193, Invalid=929, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:09:24,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2018-09-26 08:09:28,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 3126. [2018-09-26 08:09:28,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2018-09-26 08:09:28,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 7289 transitions. [2018-09-26 08:09:28,252 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 7289 transitions. Word has length 20 [2018-09-26 08:09:28,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:28,252 INFO L480 AbstractCegarLoop]: Abstraction has 3126 states and 7289 transitions. [2018-09-26 08:09:28,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:09:28,252 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 7289 transitions. [2018-09-26 08:09:28,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:09:28,254 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:28,255 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] [2018-09-26 08:09:28,255 INFO L423 AbstractCegarLoop]: === Iteration 62 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:28,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:28,255 INFO L82 PathProgramCache]: Analyzing trace with hash 764591605, now seen corresponding path program 1 times [2018-09-26 08:09:28,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:28,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:28,269 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:28,270 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:09:28,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:09:28,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:09:28,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:09:28,270 INFO L87 Difference]: Start difference. First operand 3126 states and 7289 transitions. Second operand 11 states. [2018-09-26 08:09:33,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:33,887 INFO L93 Difference]: Finished difference Result 4192 states and 9618 transitions. [2018-09-26 08:09:33,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:09:33,888 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-26 08:09:33,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:33,892 INFO L225 Difference]: With dead ends: 4192 [2018-09-26 08:09:33,892 INFO L226 Difference]: Without dead ends: 4184 [2018-09-26 08:09:33,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:09:33,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4184 states. [2018-09-26 08:09:37,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4184 to 3137. [2018-09-26 08:09:37,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2018-09-26 08:09:37,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 7311 transitions. [2018-09-26 08:09:37,882 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 7311 transitions. Word has length 20 [2018-09-26 08:09:37,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:37,882 INFO L480 AbstractCegarLoop]: Abstraction has 3137 states and 7311 transitions. [2018-09-26 08:09:37,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:09:37,882 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 7311 transitions. [2018-09-26 08:09:37,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:09:37,884 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:37,884 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] [2018-09-26 08:09:37,884 INFO L423 AbstractCegarLoop]: === Iteration 63 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:37,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:37,884 INFO L82 PathProgramCache]: Analyzing trace with hash 761791251, now seen corresponding path program 1 times [2018-09-26 08:09:37,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:37,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:37,895 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:37,895 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:09:37,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:09:37,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:09:37,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:09:37,896 INFO L87 Difference]: Start difference. First operand 3137 states and 7311 transitions. Second operand 11 states. [2018-09-26 08:09:43,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:43,519 INFO L93 Difference]: Finished difference Result 4267 states and 9777 transitions. [2018-09-26 08:09:43,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:09:43,519 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-26 08:09:43,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:43,524 INFO L225 Difference]: With dead ends: 4267 [2018-09-26 08:09:43,525 INFO L226 Difference]: Without dead ends: 4259 [2018-09-26 08:09:43,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=149, Invalid=781, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:09:43,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4259 states. [2018-09-26 08:09:47,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4259 to 3231. [2018-09-26 08:09:47,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3231 states. [2018-09-26 08:09:47,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3231 states to 3231 states and 7541 transitions. [2018-09-26 08:09:47,622 INFO L78 Accepts]: Start accepts. Automaton has 3231 states and 7541 transitions. Word has length 20 [2018-09-26 08:09:47,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:47,622 INFO L480 AbstractCegarLoop]: Abstraction has 3231 states and 7541 transitions. [2018-09-26 08:09:47,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:09:47,622 INFO L276 IsEmpty]: Start isEmpty. Operand 3231 states and 7541 transitions. [2018-09-26 08:09:47,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:09:47,624 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:47,624 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:47,624 INFO L423 AbstractCegarLoop]: === Iteration 64 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:47,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:47,624 INFO L82 PathProgramCache]: Analyzing trace with hash 761893396, now seen corresponding path program 1 times [2018-09-26 08:09:47,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:47,633 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:47,634 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:47,634 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:09:47,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:09:47,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:09:47,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:09:47,635 INFO L87 Difference]: Start difference. First operand 3231 states and 7541 transitions. Second operand 11 states. [2018-09-26 08:09:53,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:53,014 INFO L93 Difference]: Finished difference Result 3973 states and 9077 transitions. [2018-09-26 08:09:53,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:09:53,015 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-26 08:09:53,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:53,019 INFO L225 Difference]: With dead ends: 3973 [2018-09-26 08:09:53,019 INFO L226 Difference]: Without dead ends: 3965 [2018-09-26 08:09:53,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:09:53,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2018-09-26 08:09:57,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3229. [2018-09-26 08:09:57,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3229 states. [2018-09-26 08:09:57,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 3229 states and 7508 transitions. [2018-09-26 08:09:57,162 INFO L78 Accepts]: Start accepts. Automaton has 3229 states and 7508 transitions. Word has length 20 [2018-09-26 08:09:57,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:57,163 INFO L480 AbstractCegarLoop]: Abstraction has 3229 states and 7508 transitions. [2018-09-26 08:09:57,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:09:57,163 INFO L276 IsEmpty]: Start isEmpty. Operand 3229 states and 7508 transitions. [2018-09-26 08:09:57,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:09:57,165 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:57,165 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:57,166 INFO L423 AbstractCegarLoop]: === Iteration 65 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:57,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:57,166 INFO L82 PathProgramCache]: Analyzing trace with hash -290904542, now seen corresponding path program 1 times [2018-09-26 08:09:57,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:57,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:57,175 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:57,175 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:09:57,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:09:57,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:09:57,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:09:57,176 INFO L87 Difference]: Start difference. First operand 3229 states and 7508 transitions. Second operand 11 states. [2018-09-26 08:10:02,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:02,940 INFO L93 Difference]: Finished difference Result 4093 states and 9363 transitions. [2018-09-26 08:10:02,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:10:02,941 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-26 08:10:02,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:02,945 INFO L225 Difference]: With dead ends: 4093 [2018-09-26 08:10:02,945 INFO L226 Difference]: Without dead ends: 4085 [2018-09-26 08:10:02,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=160, Invalid=770, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:10:02,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4085 states. [2018-09-26 08:10:07,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4085 to 3212. [2018-09-26 08:10:07,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3212 states. [2018-09-26 08:10:07,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 7460 transitions. [2018-09-26 08:10:07,009 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 7460 transitions. Word has length 20 [2018-09-26 08:10:07,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:07,010 INFO L480 AbstractCegarLoop]: Abstraction has 3212 states and 7460 transitions. [2018-09-26 08:10:07,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:10:07,010 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 7460 transitions. [2018-09-26 08:10:07,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:10:07,012 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:07,012 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] [2018-09-26 08:10:07,012 INFO L423 AbstractCegarLoop]: === Iteration 66 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:07,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:07,012 INFO L82 PathProgramCache]: Analyzing trace with hash 447453484, now seen corresponding path program 1 times [2018-09-26 08:10:07,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:07,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:07,022 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:10:07,022 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-26 08:10:07,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:10:07,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:10:07,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:10:07,022 INFO L87 Difference]: Start difference. First operand 3212 states and 7460 transitions. Second operand 11 states. [2018-09-26 08:10:13,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:13,484 INFO L93 Difference]: Finished difference Result 4634 states and 10636 transitions. [2018-09-26 08:10:13,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:10:13,484 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-26 08:10:13,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:13,491 INFO L225 Difference]: With dead ends: 4634 [2018-09-26 08:10:13,491 INFO L226 Difference]: Without dead ends: 4626 [2018-09-26 08:10:13,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=148, Invalid=722, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:10:13,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4626 states. [2018-09-26 08:10:17,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4626 to 3219. [2018-09-26 08:10:17,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3219 states. [2018-09-26 08:10:17,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 7474 transitions. [2018-09-26 08:10:17,734 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 7474 transitions. Word has length 20 [2018-09-26 08:10:17,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:17,735 INFO L480 AbstractCegarLoop]: Abstraction has 3219 states and 7474 transitions. [2018-09-26 08:10:17,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:10:17,735 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 7474 transitions. [2018-09-26 08:10:17,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:10:17,737 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:17,737 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] [2018-09-26 08:10:17,737 INFO L423 AbstractCegarLoop]: === Iteration 67 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:17,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:17,738 INFO L82 PathProgramCache]: Analyzing trace with hash 444653130, now seen corresponding path program 1 times [2018-09-26 08:10:17,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:17,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:17,750 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:17,751 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:10:17,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:10:17,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:10:17,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:10:17,752 INFO L87 Difference]: Start difference. First operand 3219 states and 7474 transitions. Second operand 11 states. [2018-09-26 08:10:24,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:24,548 INFO L93 Difference]: Finished difference Result 4729 states and 10838 transitions. [2018-09-26 08:10:24,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:10:24,548 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-26 08:10:24,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:24,554 INFO L225 Difference]: With dead ends: 4729 [2018-09-26 08:10:24,554 INFO L226 Difference]: Without dead ends: 4721 [2018-09-26 08:10:24,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:10:24,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4721 states. Received shutdown request... [2018-09-26 08:10:28,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4721 to 3305. [2018-09-26 08:10:28,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3305 states. [2018-09-26 08:10:28,903 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 08:10:28,909 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 08:10:28,909 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:10:28 BoogieIcfgContainer [2018-09-26 08:10:28,910 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:10:28,911 INFO L168 Benchmark]: Toolchain (without parser) took 257818.27 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -248.8 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-26 08:10:28,913 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 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-09-26 08:10:28,913 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.87 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-09-26 08:10:28,913 INFO L168 Benchmark]: Boogie Preprocessor took 69.56 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-09-26 08:10:28,914 INFO L168 Benchmark]: RCFGBuilder took 467.90 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-26 08:10:28,914 INFO L168 Benchmark]: TraceAbstraction took 257221.40 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -259.4 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-26 08:10:28,918 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.15 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 Procedure Inliner took 52.87 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 69.56 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 467.90 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 257221.40 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -259.4 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 154). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 222]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 222). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 205]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 205). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 277]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 277). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 364]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 364). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 284]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 284). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 240]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 240). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 54). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 264]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 264). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 250]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 250). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 247]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 247). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 294]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 294). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 229]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 229). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 332]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 332). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 257.1s OverallTime, 67 OverallIterations, 2 TraceHistogramMax, 159.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19474 SDtfs, 49527 SDslu, 67489 SDs, 0 SdLazy, 142971 SolverSat, 9997 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1899 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 1708 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11046 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3231occurred in iteration=63, 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: 96.1s AutomataMinimizationTime, 67 MinimizatonAttempts, 37443 StatesRemovedByMinimization, 66 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1032 NumberOfCodeBlocks, 1032 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 965 ConstructedInterpolants, 0 QuantifiedInterpolants, 62375 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 67 InterpolantComputations, 27 PerfectInterpolantSequences, 33/134 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-10-28-932.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-10-28-932.csv Completed graceful shutdown