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_product.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:06:24,762 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:06:24,764 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:06:24,778 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:06:24,778 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:06:24,780 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:06:24,781 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:06:24,784 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:06:24,786 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:06:24,787 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:06:24,790 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:06:24,790 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:06:24,791 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:06:24,792 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:06:24,796 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:06:24,797 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:06:24,798 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:06:24,803 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:06:24,812 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:06:24,817 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:06:24,818 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:06:24,819 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:06:24,824 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:06:24,825 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:06:24,825 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:06:24,826 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:06:24,830 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:06:24,834 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:06:24,835 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:06:24,838 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:06:24,838 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:06:24,839 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:06:24,839 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:06:24,840 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:06:24,841 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:06:24,842 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:06:24,842 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:24,859 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:06:24,859 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:06:24,861 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:06:24,861 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:06:24,861 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:06:24,861 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:06:24,862 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:06:24,862 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:06:24,909 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:06:24,925 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:06:24,932 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:06:24,934 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:06:24,934 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:06:24,935 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl [2018-09-26 08:06:24,936 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl' [2018-09-26 08:06:25,011 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:06:25,015 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:06:25,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:06:25,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:06:25,016 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:06:25,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:24" (1/1) ... [2018-09-26 08:06:25,054 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:24" (1/1) ... [2018-09-26 08:06:25,060 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 08:06:25,060 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 08:06:25,060 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 08:06:25,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:06:25,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:06:25,064 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:06:25,064 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:06:25,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:24" (1/1) ... [2018-09-26 08:06:25,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:24" (1/1) ... [2018-09-26 08:06:25,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:24" (1/1) ... [2018-09-26 08:06:25,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:24" (1/1) ... [2018-09-26 08:06:25,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:24" (1/1) ... [2018-09-26 08:06:25,087 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:24" (1/1) ... [2018-09-26 08:06:25,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:24" (1/1) ... [2018-09-26 08:06:25,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:06:25,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:06:25,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:06:25,093 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:06:25,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:24" (1/1) ... [2018-09-26 08:06:25,192 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-26 08:06:25,193 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-26 08:06:25,193 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-26 08:06:25,395 INFO L343 CfgBuilder]: Using library mode [2018-09-26 08:06:25,396 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:06:25 BoogieIcfgContainer [2018-09-26 08:06:25,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:06:25,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:06:25,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:06:25,401 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:06:25,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:24" (1/2) ... [2018-09-26 08:06:25,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f356a0e and model type threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:06:25, skipping insertion in model container [2018-09-26 08:06:25,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:06:25" (2/2) ... [2018-09-26 08:06:25,406 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product.bpl [2018-09-26 08:06:25,416 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:06:25,425 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-09-26 08:06:25,475 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:06:25,476 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:06:25,477 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:06:25,477 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:06:25,477 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:06:25,477 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:06:25,478 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:06:25,478 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:06:25,478 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:06:25,500 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-09-26 08:06:25,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 08:06:25,512 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:25,515 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-26 08:06:25,516 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:25,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:25,527 INFO L82 PathProgramCache]: Analyzing trace with hash 28755683, now seen corresponding path program 1 times [2018-09-26 08:06:25,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:25,632 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,635 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:25,636 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:06:25,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:06:25,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:06:25,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:06:25,662 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2018-09-26 08:06:25,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:25,920 INFO L93 Difference]: Finished difference Result 49 states and 85 transitions. [2018-09-26 08:06:25,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:06:25,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-26 08:06:25,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:25,953 INFO L225 Difference]: With dead ends: 49 [2018-09-26 08:06:25,954 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 08:06:25,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:25,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 08:06:26,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2018-09-26 08:06:26,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-26 08:06:26,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2018-09-26 08:06:26,020 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 5 [2018-09-26 08:06:26,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:26,020 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2018-09-26 08:06:26,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:06:26,020 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2018-09-26 08:06:26,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 08:06:26,021 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:26,021 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-26 08:06:26,022 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:26,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:26,022 INFO L82 PathProgramCache]: Analyzing trace with hash 28971747, now seen corresponding path program 1 times [2018-09-26 08:06:26,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:26,047 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:26,047 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:26,048 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:06:26,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:06:26,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:06:26,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:06:26,051 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 5 states. [2018-09-26 08:06:26,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:26,226 INFO L93 Difference]: Finished difference Result 57 states and 99 transitions. [2018-09-26 08:06:26,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:06:26,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-26 08:06:26,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:26,228 INFO L225 Difference]: With dead ends: 57 [2018-09-26 08:06:26,228 INFO L226 Difference]: Without dead ends: 55 [2018-09-26 08:06:26,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:26,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-26 08:06:26,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2018-09-26 08:06:26,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-26 08:06:26,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 63 transitions. [2018-09-26 08:06:26,242 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 63 transitions. Word has length 5 [2018-09-26 08:06:26,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:26,243 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 63 transitions. [2018-09-26 08:06:26,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:06:26,243 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 63 transitions. [2018-09-26 08:06:26,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:06:26,244 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:26,244 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:26,245 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:26,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:26,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1864688358, now seen corresponding path program 1 times [2018-09-26 08:06:26,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:26,316 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:26,317 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:26,317 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:26,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:26,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:26,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:26,319 INFO L87 Difference]: Start difference. First operand 38 states and 63 transitions. Second operand 7 states. [2018-09-26 08:06:26,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:26,628 INFO L93 Difference]: Finished difference Result 84 states and 147 transitions. [2018-09-26 08:06:26,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:06:26,629 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-09-26 08:06:26,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:26,633 INFO L225 Difference]: With dead ends: 84 [2018-09-26 08:06:26,633 INFO L226 Difference]: Without dead ends: 82 [2018-09-26 08:06:26,636 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:06:26,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-26 08:06:26,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2018-09-26 08:06:26,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 08:06:26,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions. [2018-09-26 08:06:26,681 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 86 transitions. Word has length 7 [2018-09-26 08:06:26,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:26,682 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 86 transitions. [2018-09-26 08:06:26,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:26,682 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 86 transitions. [2018-09-26 08:06:26,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:06:26,683 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:26,684 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-09-26 08:06:26,684 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:26,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:26,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1865765160, now seen corresponding path program 1 times [2018-09-26 08:06:26,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:26,744 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:06:26,744 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:26,744 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:06:26,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:26,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:26,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:26,746 INFO L87 Difference]: Start difference. First operand 51 states and 86 transitions. Second operand 7 states. [2018-09-26 08:06:26,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:26,934 INFO L93 Difference]: Finished difference Result 102 states and 180 transitions. [2018-09-26 08:06:26,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:06:26,935 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-09-26 08:06:26,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:26,937 INFO L225 Difference]: With dead ends: 102 [2018-09-26 08:06:26,937 INFO L226 Difference]: Without dead ends: 100 [2018-09-26 08:06:26,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:06:26,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-26 08:06:26,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 65. [2018-09-26 08:06:26,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:06:26,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 111 transitions. [2018-09-26 08:06:26,960 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 111 transitions. Word has length 7 [2018-09-26 08:06:26,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:26,961 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 111 transitions. [2018-09-26 08:06:26,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:26,962 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 111 transitions. [2018-09-26 08:06:26,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:06:26,963 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:26,963 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:26,964 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:26,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:26,964 INFO L82 PathProgramCache]: Analyzing trace with hash 964893579, now seen corresponding path program 1 times [2018-09-26 08:06:26,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:27,006 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:06:27,006 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:27,006 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:27,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:27,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:27,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:27,008 INFO L87 Difference]: Start difference. First operand 65 states and 111 transitions. Second operand 9 states. [2018-09-26 08:06:27,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:27,226 INFO L93 Difference]: Finished difference Result 113 states and 199 transitions. [2018-09-26 08:06:27,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:06:27,227 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-26 08:06:27,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:27,229 INFO L225 Difference]: With dead ends: 113 [2018-09-26 08:06:27,229 INFO L226 Difference]: Without dead ends: 112 [2018-09-26 08:06:27,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:27,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-09-26 08:06:27,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 74. [2018-09-26 08:06:27,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-26 08:06:27,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 128 transitions. [2018-09-26 08:06:27,267 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 128 transitions. Word has length 9 [2018-09-26 08:06:27,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:27,267 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 128 transitions. [2018-09-26 08:06:27,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:27,270 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 128 transitions. [2018-09-26 08:06:27,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:06:27,271 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:27,271 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:27,272 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:27,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:27,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1999237099, now seen corresponding path program 1 times [2018-09-26 08:06:27,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:27,323 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:06:27,323 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:27,324 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:27,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:27,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:27,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:27,325 INFO L87 Difference]: Start difference. First operand 74 states and 128 transitions. Second operand 9 states. [2018-09-26 08:06:27,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:27,657 INFO L93 Difference]: Finished difference Result 133 states and 236 transitions. [2018-09-26 08:06:27,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:06:27,658 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-26 08:06:27,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:27,659 INFO L225 Difference]: With dead ends: 133 [2018-09-26 08:06:27,659 INFO L226 Difference]: Without dead ends: 132 [2018-09-26 08:06:27,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:06:27,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-09-26 08:06:27,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 83. [2018-09-26 08:06:27,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-26 08:06:27,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 145 transitions. [2018-09-26 08:06:27,686 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 145 transitions. Word has length 9 [2018-09-26 08:06:27,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:27,686 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 145 transitions. [2018-09-26 08:06:27,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:27,687 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 145 transitions. [2018-09-26 08:06:27,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:06:27,688 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:27,688 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-09-26 08:06:27,689 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:27,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:27,689 INFO L82 PathProgramCache]: Analyzing trace with hash 2000313901, now seen corresponding path program 2 times [2018-09-26 08:06:27,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:27,699 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 08:06:27,699 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:27,699 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:06:27,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:06:27,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:06:27,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:06:27,701 INFO L87 Difference]: Start difference. First operand 83 states and 145 transitions. Second operand 4 states. [2018-09-26 08:06:27,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:27,737 INFO L93 Difference]: Finished difference Result 119 states and 205 transitions. [2018-09-26 08:06:27,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:06:27,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-09-26 08:06:27,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:27,739 INFO L225 Difference]: With dead ends: 119 [2018-09-26 08:06:27,740 INFO L226 Difference]: Without dead ends: 76 [2018-09-26 08:06:27,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:06:27,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-26 08:06:27,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-09-26 08:06:27,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-26 08:06:27,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 124 transitions. [2018-09-26 08:06:27,772 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 124 transitions. Word has length 9 [2018-09-26 08:06:27,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:27,774 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 124 transitions. [2018-09-26 08:06:27,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:06:27,774 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 124 transitions. [2018-09-26 08:06:27,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:06:27,777 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:27,778 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-09-26 08:06:27,778 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:27,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:27,779 INFO L82 PathProgramCache]: Analyzing trace with hash -855455763, now seen corresponding path program 1 times [2018-09-26 08:06:27,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:27,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:06:27,795 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:27,796 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:06:27,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:06:27,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:06:27,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:06:27,797 INFO L87 Difference]: Start difference. First operand 76 states and 124 transitions. Second operand 4 states. [2018-09-26 08:06:27,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:27,827 INFO L93 Difference]: Finished difference Result 111 states and 178 transitions. [2018-09-26 08:06:27,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:06:27,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-09-26 08:06:27,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:27,828 INFO L225 Difference]: With dead ends: 111 [2018-09-26 08:06:27,829 INFO L226 Difference]: Without dead ends: 65 [2018-09-26 08:06:27,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:06:27,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-26 08:06:27,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-09-26 08:06:27,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:06:27,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 96 transitions. [2018-09-26 08:06:27,847 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 96 transitions. Word has length 9 [2018-09-26 08:06:27,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:27,847 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 96 transitions. [2018-09-26 08:06:27,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:06:27,848 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 96 transitions. [2018-09-26 08:06:27,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:06:27,849 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:27,849 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:27,849 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:27,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:27,850 INFO L82 PathProgramCache]: Analyzing trace with hash 101966393, now seen corresponding path program 1 times [2018-09-26 08:06:27,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:27,897 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:27,898 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:27,898 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:27,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:27,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:27,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:27,903 INFO L87 Difference]: Start difference. First operand 65 states and 96 transitions. Second operand 8 states. [2018-09-26 08:06:28,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:28,053 INFO L93 Difference]: Finished difference Result 97 states and 143 transitions. [2018-09-26 08:06:28,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:06:28,054 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-09-26 08:06:28,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:28,055 INFO L225 Difference]: With dead ends: 97 [2018-09-26 08:06:28,055 INFO L226 Difference]: Without dead ends: 96 [2018-09-26 08:06:28,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:06:28,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-09-26 08:06:28,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 81. [2018-09-26 08:06:28,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-26 08:06:28,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 126 transitions. [2018-09-26 08:06:28,099 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 126 transitions. Word has length 10 [2018-09-26 08:06:28,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:28,099 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 126 transitions. [2018-09-26 08:06:28,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:28,100 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 126 transitions. [2018-09-26 08:06:28,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:06:28,103 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:28,103 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:28,106 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:28,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:28,106 INFO L82 PathProgramCache]: Analyzing trace with hash 103259259, now seen corresponding path program 1 times [2018-09-26 08:06:28,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:28,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:28,145 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:28,145 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:28,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:28,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:28,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:28,146 INFO L87 Difference]: Start difference. First operand 81 states and 126 transitions. Second operand 8 states. [2018-09-26 08:06:28,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:28,299 INFO L93 Difference]: Finished difference Result 104 states and 152 transitions. [2018-09-26 08:06:28,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:06:28,299 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-09-26 08:06:28,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:28,300 INFO L225 Difference]: With dead ends: 104 [2018-09-26 08:06:28,301 INFO L226 Difference]: Without dead ends: 102 [2018-09-26 08:06:28,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:06:28,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-09-26 08:06:28,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 85. [2018-09-26 08:06:28,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 08:06:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 134 transitions. [2018-09-26 08:06:28,329 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 134 transitions. Word has length 10 [2018-09-26 08:06:28,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:28,329 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 134 transitions. [2018-09-26 08:06:28,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:28,330 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 134 transitions. [2018-09-26 08:06:28,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:06:28,331 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:28,331 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:28,334 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:28,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:28,334 INFO L82 PathProgramCache]: Analyzing trace with hash -176034144, now seen corresponding path program 1 times [2018-09-26 08:06:28,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:28,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:28,365 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:28,366 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:28,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:28,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:28,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:28,368 INFO L87 Difference]: Start difference. First operand 85 states and 134 transitions. Second operand 8 states. [2018-09-26 08:06:28,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:28,462 INFO L93 Difference]: Finished difference Result 91 states and 143 transitions. [2018-09-26 08:06:28,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:06:28,463 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-09-26 08:06:28,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:28,464 INFO L225 Difference]: With dead ends: 91 [2018-09-26 08:06:28,464 INFO L226 Difference]: Without dead ends: 90 [2018-09-26 08:06:28,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:06:28,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-26 08:06:28,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2018-09-26 08:06:28,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-09-26 08:06:28,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 132 transitions. [2018-09-26 08:06:28,490 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 132 transitions. Word has length 10 [2018-09-26 08:06:28,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:28,490 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 132 transitions. [2018-09-26 08:06:28,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:28,491 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 132 transitions. [2018-09-26 08:06:28,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:06:28,491 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:28,492 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:28,492 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:28,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:28,493 INFO L82 PathProgramCache]: Analyzing trace with hash -176034432, now seen corresponding path program 1 times [2018-09-26 08:06:28,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:28,512 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:28,513 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:28,513 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:28,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:28,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:28,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:28,515 INFO L87 Difference]: Start difference. First operand 84 states and 132 transitions. Second operand 7 states. [2018-09-26 08:06:28,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:28,645 INFO L93 Difference]: Finished difference Result 108 states and 159 transitions. [2018-09-26 08:06:28,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:06:28,646 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-09-26 08:06:28,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:28,647 INFO L225 Difference]: With dead ends: 108 [2018-09-26 08:06:28,647 INFO L226 Difference]: Without dead ends: 106 [2018-09-26 08:06:28,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:06:28,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-26 08:06:28,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2018-09-26 08:06:28,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-26 08:06:28,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 149 transitions. [2018-09-26 08:06:28,682 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 149 transitions. Word has length 10 [2018-09-26 08:06:28,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:28,682 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 149 transitions. [2018-09-26 08:06:28,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:28,682 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 149 transitions. [2018-09-26 08:06:28,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:06:28,686 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:28,687 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:28,687 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:28,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:28,688 INFO L82 PathProgramCache]: Analyzing trace with hash -184622601, now seen corresponding path program 1 times [2018-09-26 08:06:28,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:28,725 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:28,726 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:28,726 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:28,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:28,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:28,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:28,728 INFO L87 Difference]: Start difference. First operand 95 states and 149 transitions. Second operand 8 states. [2018-09-26 08:06:28,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:28,884 INFO L93 Difference]: Finished difference Result 116 states and 171 transitions. [2018-09-26 08:06:28,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:06:28,884 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-09-26 08:06:28,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:28,886 INFO L225 Difference]: With dead ends: 116 [2018-09-26 08:06:28,886 INFO L226 Difference]: Without dead ends: 115 [2018-09-26 08:06:28,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:06:28,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-26 08:06:28,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 100. [2018-09-26 08:06:28,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-26 08:06:28,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 158 transitions. [2018-09-26 08:06:28,921 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 158 transitions. Word has length 10 [2018-09-26 08:06:28,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:28,921 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 158 transitions. [2018-09-26 08:06:28,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:28,921 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 158 transitions. [2018-09-26 08:06:28,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:06:28,929 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:28,929 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:28,930 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:28,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:28,930 INFO L82 PathProgramCache]: Analyzing trace with hash -184621319, now seen corresponding path program 1 times [2018-09-26 08:06:28,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:28,967 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:28,967 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:28,967 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:28,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:28,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:28,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:28,969 INFO L87 Difference]: Start difference. First operand 100 states and 158 transitions. Second operand 8 states. [2018-09-26 08:06:29,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:29,124 INFO L93 Difference]: Finished difference Result 116 states and 171 transitions. [2018-09-26 08:06:29,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:06:29,124 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-09-26 08:06:29,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:29,125 INFO L225 Difference]: With dead ends: 116 [2018-09-26 08:06:29,125 INFO L226 Difference]: Without dead ends: 114 [2018-09-26 08:06:29,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:29,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-09-26 08:06:29,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 100. [2018-09-26 08:06:29,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-26 08:06:29,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 158 transitions. [2018-09-26 08:06:29,156 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 158 transitions. Word has length 10 [2018-09-26 08:06:29,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:29,157 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 158 transitions. [2018-09-26 08:06:29,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:29,157 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 158 transitions. [2018-09-26 08:06:29,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:06:29,158 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:29,158 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:29,158 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:29,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:29,159 INFO L82 PathProgramCache]: Analyzing trace with hash -973282432, now seen corresponding path program 1 times [2018-09-26 08:06:29,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:29,196 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:29,196 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:29,196 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:29,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:29,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:29,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:29,198 INFO L87 Difference]: Start difference. First operand 100 states and 158 transitions. Second operand 8 states. [2018-09-26 08:06:29,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:29,352 INFO L93 Difference]: Finished difference Result 124 states and 186 transitions. [2018-09-26 08:06:29,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:06:29,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-09-26 08:06:29,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:29,354 INFO L225 Difference]: With dead ends: 124 [2018-09-26 08:06:29,354 INFO L226 Difference]: Without dead ends: 123 [2018-09-26 08:06:29,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:06:29,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-26 08:06:29,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2018-09-26 08:06:29,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-26 08:06:29,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 167 transitions. [2018-09-26 08:06:29,394 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 167 transitions. Word has length 10 [2018-09-26 08:06:29,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:29,394 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 167 transitions. [2018-09-26 08:06:29,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:29,395 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 167 transitions. [2018-09-26 08:06:29,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:06:29,395 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:29,395 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:29,396 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:29,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:29,396 INFO L82 PathProgramCache]: Analyzing trace with hash -973281662, now seen corresponding path program 1 times [2018-09-26 08:06:29,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:29,423 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,423 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:29,424 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:29,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:29,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:29,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:29,425 INFO L87 Difference]: Start difference. First operand 105 states and 167 transitions. Second operand 8 states. [2018-09-26 08:06:29,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:29,590 INFO L93 Difference]: Finished difference Result 124 states and 186 transitions. [2018-09-26 08:06:29,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:06:29,591 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-09-26 08:06:29,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:29,593 INFO L225 Difference]: With dead ends: 124 [2018-09-26 08:06:29,593 INFO L226 Difference]: Without dead ends: 122 [2018-09-26 08:06:29,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:29,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-09-26 08:06:29,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2018-09-26 08:06:29,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-09-26 08:06:29,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 172 transitions. [2018-09-26 08:06:29,642 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 172 transitions. Word has length 10 [2018-09-26 08:06:29,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:29,642 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 172 transitions. [2018-09-26 08:06:29,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:29,644 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 172 transitions. [2018-09-26 08:06:29,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:06:29,645 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:29,645 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:29,646 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:29,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:29,647 INFO L82 PathProgramCache]: Analyzing trace with hash -981870601, now seen corresponding path program 1 times [2018-09-26 08:06:29,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:29,662 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:29,663 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:29,663 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:29,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:29,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:29,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:29,664 INFO L87 Difference]: Start difference. First operand 108 states and 172 transitions. Second operand 7 states. [2018-09-26 08:06:29,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:29,801 INFO L93 Difference]: Finished difference Result 129 states and 195 transitions. [2018-09-26 08:06:29,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:06:29,802 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-09-26 08:06:29,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:29,804 INFO L225 Difference]: With dead ends: 129 [2018-09-26 08:06:29,804 INFO L226 Difference]: Without dead ends: 127 [2018-09-26 08:06:29,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:06:29,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-26 08:06:29,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2018-09-26 08:06:29,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-26 08:06:29,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 189 transitions. [2018-09-26 08:06:29,848 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 189 transitions. Word has length 10 [2018-09-26 08:06:29,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:29,848 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 189 transitions. [2018-09-26 08:06:29,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:29,848 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 189 transitions. [2018-09-26 08:06:29,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:06:29,849 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:29,849 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:29,853 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:29,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:29,853 INFO L82 PathProgramCache]: Analyzing trace with hash -981870889, now seen corresponding path program 1 times [2018-09-26 08:06:29,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:29,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:29,875 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:29,876 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:29,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:29,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:29,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:29,877 INFO L87 Difference]: Start difference. First operand 119 states and 189 transitions. Second operand 8 states. [2018-09-26 08:06:30,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:30,023 INFO L93 Difference]: Finished difference Result 129 states and 206 transitions. [2018-09-26 08:06:30,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:06:30,023 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-09-26 08:06:30,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:30,024 INFO L225 Difference]: With dead ends: 129 [2018-09-26 08:06:30,024 INFO L226 Difference]: Without dead ends: 128 [2018-09-26 08:06:30,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:06:30,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-09-26 08:06:30,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 121. [2018-09-26 08:06:30,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-26 08:06:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 193 transitions. [2018-09-26 08:06:30,066 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 193 transitions. Word has length 10 [2018-09-26 08:06:30,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:30,066 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 193 transitions. [2018-09-26 08:06:30,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:30,067 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 193 transitions. [2018-09-26 08:06:30,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:06:30,067 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:30,067 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:30,068 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:30,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:30,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1101306322, now seen corresponding path program 1 times [2018-09-26 08:06:30,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:30,102 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:30,103 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:30,103 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:30,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:30,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:30,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:30,104 INFO L87 Difference]: Start difference. First operand 121 states and 193 transitions. Second operand 8 states. [2018-09-26 08:06:30,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:30,258 INFO L93 Difference]: Finished difference Result 137 states and 209 transitions. [2018-09-26 08:06:30,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:06:30,258 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-09-26 08:06:30,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:30,259 INFO L225 Difference]: With dead ends: 137 [2018-09-26 08:06:30,259 INFO L226 Difference]: Without dead ends: 136 [2018-09-26 08:06:30,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:06:30,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-09-26 08:06:30,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 129. [2018-09-26 08:06:30,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-26 08:06:30,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 206 transitions. [2018-09-26 08:06:30,301 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 206 transitions. Word has length 10 [2018-09-26 08:06:30,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:30,301 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 206 transitions. [2018-09-26 08:06:30,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:30,302 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 206 transitions. [2018-09-26 08:06:30,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:06:30,302 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:30,302 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:30,303 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:30,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:30,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1102106644, now seen corresponding path program 1 times [2018-09-26 08:06:30,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:30,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:30,323 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:30,323 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:30,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:30,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:30,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:30,324 INFO L87 Difference]: Start difference. First operand 129 states and 206 transitions. Second operand 8 states. [2018-09-26 08:06:30,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:30,468 INFO L93 Difference]: Finished difference Result 147 states and 223 transitions. [2018-09-26 08:06:30,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:06:30,468 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-09-26 08:06:30,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:30,469 INFO L225 Difference]: With dead ends: 147 [2018-09-26 08:06:30,469 INFO L226 Difference]: Without dead ends: 145 [2018-09-26 08:06:30,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:06:30,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-09-26 08:06:30,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 129. [2018-09-26 08:06:30,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-26 08:06:30,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 206 transitions. [2018-09-26 08:06:30,517 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 206 transitions. Word has length 10 [2018-09-26 08:06:30,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:30,517 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 206 transitions. [2018-09-26 08:06:30,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:30,518 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 206 transitions. [2018-09-26 08:06:30,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:30,518 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:30,518 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:30,519 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:30,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:30,519 INFO L82 PathProgramCache]: Analyzing trace with hash 240543358, now seen corresponding path program 1 times [2018-09-26 08:06:30,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:30,548 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:30,548 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:30,549 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:06:30,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:06:30,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:06:30,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:06:30,550 INFO L87 Difference]: Start difference. First operand 129 states and 206 transitions. Second operand 10 states. [2018-09-26 08:06:30,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:30,777 INFO L93 Difference]: Finished difference Result 151 states and 226 transitions. [2018-09-26 08:06:30,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:06:30,778 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2018-09-26 08:06:30,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:30,779 INFO L225 Difference]: With dead ends: 151 [2018-09-26 08:06:30,779 INFO L226 Difference]: Without dead ends: 150 [2018-09-26 08:06:30,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:06:30,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-09-26 08:06:30,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 121. [2018-09-26 08:06:30,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-26 08:06:30,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 192 transitions. [2018-09-26 08:06:30,826 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 192 transitions. Word has length 12 [2018-09-26 08:06:30,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:30,826 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 192 transitions. [2018-09-26 08:06:30,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:06:30,828 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 192 transitions. [2018-09-26 08:06:30,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:30,829 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:30,829 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:30,830 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:30,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:30,830 INFO L82 PathProgramCache]: Analyzing trace with hash 447688542, now seen corresponding path program 1 times [2018-09-26 08:06:30,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:30,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:30,865 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:30,865 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-26 08:06:30,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:06:30,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:06:30,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:06:30,867 INFO L87 Difference]: Start difference. First operand 121 states and 192 transitions. Second operand 10 states. [2018-09-26 08:06:31,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:31,048 INFO L93 Difference]: Finished difference Result 149 states and 233 transitions. [2018-09-26 08:06:31,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:06:31,049 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2018-09-26 08:06:31,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:31,051 INFO L225 Difference]: With dead ends: 149 [2018-09-26 08:06:31,052 INFO L226 Difference]: Without dead ends: 147 [2018-09-26 08:06:31,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:06:31,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-26 08:06:31,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 136. [2018-09-26 08:06:31,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-09-26 08:06:31,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 216 transitions. [2018-09-26 08:06:31,110 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 216 transitions. Word has length 12 [2018-09-26 08:06:31,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:31,111 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 216 transitions. [2018-09-26 08:06:31,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:06:31,111 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 216 transitions. [2018-09-26 08:06:31,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:31,114 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:31,114 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:31,115 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:31,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:31,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1316178012, now seen corresponding path program 1 times [2018-09-26 08:06:31,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:31,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:31,140 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:31,140 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:31,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:31,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:31,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:31,141 INFO L87 Difference]: Start difference. First operand 136 states and 216 transitions. Second operand 9 states. [2018-09-26 08:06:31,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:31,264 INFO L93 Difference]: Finished difference Result 145 states and 230 transitions. [2018-09-26 08:06:31,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:06:31,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 08:06:31,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:31,266 INFO L225 Difference]: With dead ends: 145 [2018-09-26 08:06:31,266 INFO L226 Difference]: Without dead ends: 144 [2018-09-26 08:06:31,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:06:31,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-09-26 08:06:31,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-09-26 08:06:31,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-09-26 08:06:31,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 229 transitions. [2018-09-26 08:06:31,322 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 229 transitions. Word has length 12 [2018-09-26 08:06:31,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:31,322 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 229 transitions. [2018-09-26 08:06:31,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:31,322 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 229 transitions. [2018-09-26 08:06:31,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:31,323 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:31,323 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:31,323 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:31,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:31,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1525011273, now seen corresponding path program 1 times [2018-09-26 08:06:31,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:31,354 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:31,354 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:31,354 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:06:31,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:06:31,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:06:31,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:06:31,355 INFO L87 Difference]: Start difference. First operand 144 states and 229 transitions. Second operand 10 states. [2018-09-26 08:06:31,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:31,610 INFO L93 Difference]: Finished difference Result 168 states and 253 transitions. [2018-09-26 08:06:31,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:06:31,610 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2018-09-26 08:06:31,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:31,611 INFO L225 Difference]: With dead ends: 168 [2018-09-26 08:06:31,612 INFO L226 Difference]: Without dead ends: 167 [2018-09-26 08:06:31,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:06:31,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-09-26 08:06:31,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 137. [2018-09-26 08:06:31,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-26 08:06:31,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 217 transitions. [2018-09-26 08:06:31,672 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 217 transitions. Word has length 12 [2018-09-26 08:06:31,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:31,672 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 217 transitions. [2018-09-26 08:06:31,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:06:31,673 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 217 transitions. [2018-09-26 08:06:31,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:31,673 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:31,673 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:31,674 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:31,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:31,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1139034733, now seen corresponding path program 1 times [2018-09-26 08:06:31,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:31,701 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:31,701 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:31,701 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:06:31,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:31,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:31,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:31,702 INFO L87 Difference]: Start difference. First operand 137 states and 217 transitions. Second operand 9 states. [2018-09-26 08:06:31,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:31,843 INFO L93 Difference]: Finished difference Result 164 states and 254 transitions. [2018-09-26 08:06:31,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:06:31,844 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-09-26 08:06:31,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:31,845 INFO L225 Difference]: With dead ends: 164 [2018-09-26 08:06:31,845 INFO L226 Difference]: Without dead ends: 163 [2018-09-26 08:06:31,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:31,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-09-26 08:06:31,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2018-09-26 08:06:31,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-26 08:06:31,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 241 transitions. [2018-09-26 08:06:31,911 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 241 transitions. Word has length 13 [2018-09-26 08:06:31,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:31,911 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 241 transitions. [2018-09-26 08:06:31,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:31,911 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 241 transitions. [2018-09-26 08:06:31,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:31,912 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:31,912 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:31,913 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:31,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:31,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1000080215, now seen corresponding path program 1 times [2018-09-26 08:06:31,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:31,934 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:31,934 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:31,935 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:06:31,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:31,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:31,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:31,936 INFO L87 Difference]: Start difference. First operand 151 states and 241 transitions. Second operand 9 states. [2018-09-26 08:06:32,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:32,160 INFO L93 Difference]: Finished difference Result 217 states and 338 transitions. [2018-09-26 08:06:32,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:06:32,160 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-09-26 08:06:32,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:32,162 INFO L225 Difference]: With dead ends: 217 [2018-09-26 08:06:32,162 INFO L226 Difference]: Without dead ends: 215 [2018-09-26 08:06:32,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:06:32,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-26 08:06:32,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 163. [2018-09-26 08:06:32,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-09-26 08:06:32,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 260 transitions. [2018-09-26 08:06:32,232 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 260 transitions. Word has length 13 [2018-09-26 08:06:32,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:32,232 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 260 transitions. [2018-09-26 08:06:32,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:32,232 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 260 transitions. [2018-09-26 08:06:32,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:32,233 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:32,233 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:32,233 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:32,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:32,234 INFO L82 PathProgramCache]: Analyzing trace with hash -86604803, now seen corresponding path program 1 times [2018-09-26 08:06:32,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:32,257 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:06:32,258 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:32,258 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:06:32,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:32,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:32,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:32,259 INFO L87 Difference]: Start difference. First operand 163 states and 260 transitions. Second operand 9 states. [2018-09-26 08:06:32,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:32,468 INFO L93 Difference]: Finished difference Result 208 states and 319 transitions. [2018-09-26 08:06:32,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:06:32,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-09-26 08:06:32,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:32,470 INFO L225 Difference]: With dead ends: 208 [2018-09-26 08:06:32,470 INFO L226 Difference]: Without dead ends: 207 [2018-09-26 08:06:32,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:06:32,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-09-26 08:06:32,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 173. [2018-09-26 08:06:32,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-26 08:06:32,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 277 transitions. [2018-09-26 08:06:32,539 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 277 transitions. Word has length 13 [2018-09-26 08:06:32,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:32,539 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 277 transitions. [2018-09-26 08:06:32,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:32,539 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 277 transitions. [2018-09-26 08:06:32,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:32,540 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:32,540 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:32,541 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:32,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:32,541 INFO L82 PathProgramCache]: Analyzing trace with hash -86605091, now seen corresponding path program 1 times [2018-09-26 08:06:32,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:32,552 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:06:32,552 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:32,553 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:32,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:32,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:32,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:32,554 INFO L87 Difference]: Start difference. First operand 173 states and 277 transitions. Second operand 7 states. [2018-09-26 08:06:32,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:32,729 INFO L93 Difference]: Finished difference Result 229 states and 357 transitions. [2018-09-26 08:06:32,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:06:32,729 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-09-26 08:06:32,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:32,731 INFO L225 Difference]: With dead ends: 229 [2018-09-26 08:06:32,731 INFO L226 Difference]: Without dead ends: 227 [2018-09-26 08:06:32,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:06:32,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-09-26 08:06:32,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 203. [2018-09-26 08:06:32,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-26 08:06:32,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 329 transitions. [2018-09-26 08:06:32,830 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 329 transitions. Word has length 13 [2018-09-26 08:06:32,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:32,831 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 329 transitions. [2018-09-26 08:06:32,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:32,831 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 329 transitions. [2018-09-26 08:06:32,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:32,832 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:32,832 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:32,832 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:32,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:32,833 INFO L82 PathProgramCache]: Analyzing trace with hash -86603521, now seen corresponding path program 1 times [2018-09-26 08:06:32,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:32,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:32,852 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:32,852 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:32,853 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:32,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:32,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:32,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:32,854 INFO L87 Difference]: Start difference. First operand 203 states and 329 transitions. Second operand 8 states. [2018-09-26 08:06:33,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:33,155 INFO L93 Difference]: Finished difference Result 254 states and 401 transitions. [2018-09-26 08:06:33,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:06:33,155 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-09-26 08:06:33,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:33,157 INFO L225 Difference]: With dead ends: 254 [2018-09-26 08:06:33,157 INFO L226 Difference]: Without dead ends: 252 [2018-09-26 08:06:33,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:06:33,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-09-26 08:06:33,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 206. [2018-09-26 08:06:33,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-09-26 08:06:33,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 334 transitions. [2018-09-26 08:06:33,238 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 334 transitions. Word has length 13 [2018-09-26 08:06:33,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:33,238 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 334 transitions. [2018-09-26 08:06:33,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:33,238 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 334 transitions. [2018-09-26 08:06:33,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:33,239 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:33,239 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:33,239 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:33,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:33,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1761298927, now seen corresponding path program 2 times [2018-09-26 08:06:33,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:33,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:33,257 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:33,257 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:06:33,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:33,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:33,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:33,258 INFO L87 Difference]: Start difference. First operand 206 states and 334 transitions. Second operand 9 states. [2018-09-26 08:06:33,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:33,399 INFO L93 Difference]: Finished difference Result 220 states and 345 transitions. [2018-09-26 08:06:33,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:06:33,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-09-26 08:06:33,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:33,401 INFO L225 Difference]: With dead ends: 220 [2018-09-26 08:06:33,401 INFO L226 Difference]: Without dead ends: 219 [2018-09-26 08:06:33,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:33,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-09-26 08:06:33,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 203. [2018-09-26 08:06:33,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-26 08:06:33,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 328 transitions. [2018-09-26 08:06:33,479 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 328 transitions. Word has length 13 [2018-09-26 08:06:33,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:33,479 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 328 transitions. [2018-09-26 08:06:33,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:33,480 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 328 transitions. [2018-09-26 08:06:33,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:33,480 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:33,480 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:33,481 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:33,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:33,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1761298639, now seen corresponding path program 2 times [2018-09-26 08:06:33,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:33,492 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:06:33,493 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:33,493 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:33,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:33,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:33,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:33,494 INFO L87 Difference]: Start difference. First operand 203 states and 328 transitions. Second operand 7 states. [2018-09-26 08:06:33,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:33,661 INFO L93 Difference]: Finished difference Result 227 states and 353 transitions. [2018-09-26 08:06:33,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:33,661 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-09-26 08:06:33,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:33,663 INFO L225 Difference]: With dead ends: 227 [2018-09-26 08:06:33,663 INFO L226 Difference]: Without dead ends: 225 [2018-09-26 08:06:33,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:06:33,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-09-26 08:06:33,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 201. [2018-09-26 08:06:33,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-26 08:06:33,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 323 transitions. [2018-09-26 08:06:33,739 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 323 transitions. Word has length 13 [2018-09-26 08:06:33,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:33,739 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 323 transitions. [2018-09-26 08:06:33,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:33,739 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 323 transitions. [2018-09-26 08:06:33,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:33,740 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:33,740 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:33,741 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:33,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:33,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1799471129, now seen corresponding path program 1 times [2018-09-26 08:06:33,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:33,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:33,761 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:33,761 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:06:33,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:33,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:33,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:33,762 INFO L87 Difference]: Start difference. First operand 201 states and 323 transitions. Second operand 9 states. [2018-09-26 08:06:34,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:34,022 INFO L93 Difference]: Finished difference Result 244 states and 382 transitions. [2018-09-26 08:06:34,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:06:34,022 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-09-26 08:06:34,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:34,024 INFO L225 Difference]: With dead ends: 244 [2018-09-26 08:06:34,024 INFO L226 Difference]: Without dead ends: 242 [2018-09-26 08:06:34,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:06:34,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-09-26 08:06:34,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 198. [2018-09-26 08:06:34,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-09-26 08:06:34,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 318 transitions. [2018-09-26 08:06:34,109 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 318 transitions. Word has length 13 [2018-09-26 08:06:34,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:34,110 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 318 transitions. [2018-09-26 08:06:34,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:34,110 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 318 transitions. [2018-09-26 08:06:34,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:34,111 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:34,111 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:34,111 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:34,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:34,112 INFO L82 PathProgramCache]: Analyzing trace with hash 267374077, now seen corresponding path program 1 times [2018-09-26 08:06:34,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:34,128 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:06:34,129 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:34,129 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:34,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:34,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:34,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:34,130 INFO L87 Difference]: Start difference. First operand 198 states and 318 transitions. Second operand 7 states. [2018-09-26 08:06:34,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:34,305 INFO L93 Difference]: Finished difference Result 222 states and 342 transitions. [2018-09-26 08:06:34,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:34,305 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-09-26 08:06:34,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:34,307 INFO L225 Difference]: With dead ends: 222 [2018-09-26 08:06:34,307 INFO L226 Difference]: Without dead ends: 220 [2018-09-26 08:06:34,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:06:34,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-09-26 08:06:34,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 194. [2018-09-26 08:06:34,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-09-26 08:06:34,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 311 transitions. [2018-09-26 08:06:34,394 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 311 transitions. Word has length 13 [2018-09-26 08:06:34,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:34,394 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 311 transitions. [2018-09-26 08:06:34,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:34,394 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 311 transitions. [2018-09-26 08:06:34,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:34,395 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:34,395 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:34,396 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:34,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:34,396 INFO L82 PathProgramCache]: Analyzing trace with hash 267373789, now seen corresponding path program 1 times [2018-09-26 08:06:34,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:34,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:34,417 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:34,417 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:06:34,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:34,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:34,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:34,418 INFO L87 Difference]: Start difference. First operand 194 states and 311 transitions. Second operand 9 states. [2018-09-26 08:06:34,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:34,567 INFO L93 Difference]: Finished difference Result 219 states and 343 transitions. [2018-09-26 08:06:34,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:06:34,567 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-09-26 08:06:34,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:34,569 INFO L225 Difference]: With dead ends: 219 [2018-09-26 08:06:34,569 INFO L226 Difference]: Without dead ends: 218 [2018-09-26 08:06:34,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:34,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-09-26 08:06:34,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 200. [2018-09-26 08:06:34,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-09-26 08:06:34,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 322 transitions. [2018-09-26 08:06:34,650 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 322 transitions. Word has length 13 [2018-09-26 08:06:34,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:34,650 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 322 transitions. [2018-09-26 08:06:34,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:34,650 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 322 transitions. [2018-09-26 08:06:34,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:34,651 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:34,651 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:34,651 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:34,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:34,652 INFO L82 PathProgramCache]: Analyzing trace with hash 290277111, now seen corresponding path program 1 times [2018-09-26 08:06:34,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:34,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:34,676 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:34,676 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:06:34,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:34,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:34,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:34,677 INFO L87 Difference]: Start difference. First operand 200 states and 322 transitions. Second operand 9 states. [2018-09-26 08:06:34,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:34,927 INFO L93 Difference]: Finished difference Result 251 states and 394 transitions. [2018-09-26 08:06:34,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:06:34,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-09-26 08:06:34,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:34,929 INFO L225 Difference]: With dead ends: 251 [2018-09-26 08:06:34,929 INFO L226 Difference]: Without dead ends: 249 [2018-09-26 08:06:34,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:06:34,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-09-26 08:06:35,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 214. [2018-09-26 08:06:35,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-09-26 08:06:35,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 345 transitions. [2018-09-26 08:06:35,020 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 345 transitions. Word has length 13 [2018-09-26 08:06:35,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:35,021 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 345 transitions. [2018-09-26 08:06:35,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:35,021 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 345 transitions. [2018-09-26 08:06:35,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:35,022 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:35,022 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:35,022 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:35,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:35,023 INFO L82 PathProgramCache]: Analyzing trace with hash 2115277807, now seen corresponding path program 2 times [2018-09-26 08:06:35,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:35,037 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:06:35,037 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:35,037 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:35,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:35,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:35,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:35,038 INFO L87 Difference]: Start difference. First operand 214 states and 345 transitions. Second operand 7 states. [2018-09-26 08:06:35,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:35,215 INFO L93 Difference]: Finished difference Result 258 states and 407 transitions. [2018-09-26 08:06:35,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:06:35,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-09-26 08:06:35,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:35,217 INFO L225 Difference]: With dead ends: 258 [2018-09-26 08:06:35,217 INFO L226 Difference]: Without dead ends: 256 [2018-09-26 08:06:35,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:06:35,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-09-26 08:06:35,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 236. [2018-09-26 08:06:35,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-09-26 08:06:35,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 382 transitions. [2018-09-26 08:06:35,319 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 382 transitions. Word has length 13 [2018-09-26 08:06:35,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:35,320 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 382 transitions. [2018-09-26 08:06:35,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:35,320 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 382 transitions. [2018-09-26 08:06:35,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:35,320 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:35,321 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:35,321 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:35,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:35,321 INFO L82 PathProgramCache]: Analyzing trace with hash 2115277519, now seen corresponding path program 2 times [2018-09-26 08:06:35,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:35,342 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:06:35,343 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:35,343 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:06:35,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:35,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:35,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:35,344 INFO L87 Difference]: Start difference. First operand 236 states and 382 transitions. Second operand 9 states. [2018-09-26 08:06:35,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:35,598 INFO L93 Difference]: Finished difference Result 270 states and 424 transitions. [2018-09-26 08:06:35,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:06:35,599 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-09-26 08:06:35,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:35,601 INFO L225 Difference]: With dead ends: 270 [2018-09-26 08:06:35,601 INFO L226 Difference]: Without dead ends: 269 [2018-09-26 08:06:35,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:06:35,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-09-26 08:06:35,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 241. [2018-09-26 08:06:35,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-09-26 08:06:35,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 391 transitions. [2018-09-26 08:06:35,730 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 391 transitions. Word has length 13 [2018-09-26 08:06:35,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:35,730 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 391 transitions. [2018-09-26 08:06:35,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:35,730 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 391 transitions. [2018-09-26 08:06:35,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:35,731 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:35,731 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:35,732 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:35,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:35,732 INFO L82 PathProgramCache]: Analyzing trace with hash 2115278289, now seen corresponding path program 1 times [2018-09-26 08:06:35,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:35,749 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:35,749 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:35,749 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:35,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:35,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:35,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:35,750 INFO L87 Difference]: Start difference. First operand 241 states and 391 transitions. Second operand 8 states. [2018-09-26 08:06:36,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:36,037 INFO L93 Difference]: Finished difference Result 296 states and 468 transitions. [2018-09-26 08:06:36,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:06:36,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-09-26 08:06:36,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:36,039 INFO L225 Difference]: With dead ends: 296 [2018-09-26 08:06:36,039 INFO L226 Difference]: Without dead ends: 294 [2018-09-26 08:06:36,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:06:36,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-09-26 08:06:36,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 245. [2018-09-26 08:06:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-09-26 08:06:36,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 397 transitions. [2018-09-26 08:06:36,204 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 397 transitions. Word has length 13 [2018-09-26 08:06:36,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:36,204 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 397 transitions. [2018-09-26 08:06:36,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:36,204 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 397 transitions. [2018-09-26 08:06:36,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:36,205 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:36,205 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:36,205 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:36,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:36,206 INFO L82 PathProgramCache]: Analyzing trace with hash -238445237, now seen corresponding path program 1 times [2018-09-26 08:06:36,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:36,235 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:36,236 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:36,236 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:06:36,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:36,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:36,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:36,237 INFO L87 Difference]: Start difference. First operand 245 states and 397 transitions. Second operand 9 states. [2018-09-26 08:06:36,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:36,460 INFO L93 Difference]: Finished difference Result 270 states and 431 transitions. [2018-09-26 08:06:36,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:06:36,461 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-09-26 08:06:36,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:36,463 INFO L225 Difference]: With dead ends: 270 [2018-09-26 08:06:36,463 INFO L226 Difference]: Without dead ends: 269 [2018-09-26 08:06:36,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:36,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-09-26 08:06:36,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 260. [2018-09-26 08:06:36,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-09-26 08:06:36,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 423 transitions. [2018-09-26 08:06:36,620 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 423 transitions. Word has length 13 [2018-09-26 08:06:36,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:36,621 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 423 transitions. [2018-09-26 08:06:36,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:36,621 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 423 transitions. [2018-09-26 08:06:36,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:36,622 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:36,622 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:36,622 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:36,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:36,622 INFO L82 PathProgramCache]: Analyzing trace with hash 2129075237, now seen corresponding path program 1 times [2018-09-26 08:06:36,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:36,642 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:36,643 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:36,643 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:06:36,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:36,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:36,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:36,644 INFO L87 Difference]: Start difference. First operand 260 states and 423 transitions. Second operand 9 states. [2018-09-26 08:06:36,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:36,954 INFO L93 Difference]: Finished difference Result 317 states and 507 transitions. [2018-09-26 08:06:36,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:06:36,955 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-09-26 08:06:36,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:36,957 INFO L225 Difference]: With dead ends: 317 [2018-09-26 08:06:36,957 INFO L226 Difference]: Without dead ends: 315 [2018-09-26 08:06:36,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:06:36,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-09-26 08:06:37,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 252. [2018-09-26 08:06:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-09-26 08:06:37,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 411 transitions. [2018-09-26 08:06:37,097 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 411 transitions. Word has length 13 [2018-09-26 08:06:37,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:37,098 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 411 transitions. [2018-09-26 08:06:37,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:37,098 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 411 transitions. [2018-09-26 08:06:37,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:37,099 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:37,099 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2018-09-26 08:06:37,099 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:37,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:37,099 INFO L82 PathProgramCache]: Analyzing trace with hash -24071906, now seen corresponding path program 1 times [2018-09-26 08:06:37,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:37,123 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:37,123 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:37,123 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:37,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:37,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:37,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:37,125 INFO L87 Difference]: Start difference. First operand 252 states and 411 transitions. Second operand 9 states. [2018-09-26 08:06:37,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:37,383 INFO L93 Difference]: Finished difference Result 317 states and 513 transitions. [2018-09-26 08:06:37,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:06:37,384 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-09-26 08:06:37,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:37,386 INFO L225 Difference]: With dead ends: 317 [2018-09-26 08:06:37,386 INFO L226 Difference]: Without dead ends: 315 [2018-09-26 08:06:37,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:06:37,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-09-26 08:06:37,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 258. [2018-09-26 08:06:37,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-09-26 08:06:37,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 423 transitions. [2018-09-26 08:06:37,510 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 423 transitions. Word has length 13 [2018-09-26 08:06:37,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:37,511 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 423 transitions. [2018-09-26 08:06:37,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:37,511 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 423 transitions. [2018-09-26 08:06:37,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:06:37,512 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:37,512 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:37,512 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:37,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:37,512 INFO L82 PathProgramCache]: Analyzing trace with hash -603538094, now seen corresponding path program 1 times [2018-09-26 08:06:37,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:37,542 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:06:37,542 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:37,542 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:06:37,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:06:37,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:06:37,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:37,543 INFO L87 Difference]: Start difference. First operand 258 states and 423 transitions. Second operand 11 states. [2018-09-26 08:06:37,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:37,781 INFO L93 Difference]: Finished difference Result 273 states and 437 transitions. [2018-09-26 08:06:37,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:06:37,782 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-09-26 08:06:37,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:37,784 INFO L225 Difference]: With dead ends: 273 [2018-09-26 08:06:37,784 INFO L226 Difference]: Without dead ends: 272 [2018-09-26 08:06:37,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:06:37,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-09-26 08:06:37,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 249. [2018-09-26 08:06:37,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-09-26 08:06:37,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 408 transitions. [2018-09-26 08:06:37,908 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 408 transitions. Word has length 15 [2018-09-26 08:06:37,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:37,908 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 408 transitions. [2018-09-26 08:06:37,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:06:37,908 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 408 transitions. [2018-09-26 08:06:37,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:06:37,909 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:37,909 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:37,910 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:37,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:37,910 INFO L82 PathProgramCache]: Analyzing trace with hash 2021827592, now seen corresponding path program 1 times [2018-09-26 08:06:37,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:37,933 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:37,933 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:37,933 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:06:37,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:06:37,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:06:37,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:37,934 INFO L87 Difference]: Start difference. First operand 249 states and 408 transitions. Second operand 11 states. [2018-09-26 08:06:38,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:38,162 INFO L93 Difference]: Finished difference Result 279 states and 448 transitions. [2018-09-26 08:06:38,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:06:38,163 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-09-26 08:06:38,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:38,164 INFO L225 Difference]: With dead ends: 279 [2018-09-26 08:06:38,165 INFO L226 Difference]: Without dead ends: 278 [2018-09-26 08:06:38,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:06:38,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-09-26 08:06:38,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 255. [2018-09-26 08:06:38,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-09-26 08:06:38,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 418 transitions. [2018-09-26 08:06:38,288 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 418 transitions. Word has length 15 [2018-09-26 08:06:38,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:38,288 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 418 transitions. [2018-09-26 08:06:38,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:06:38,288 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 418 transitions. [2018-09-26 08:06:38,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:06:38,289 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:38,289 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:38,289 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:38,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:38,290 INFO L82 PathProgramCache]: Analyzing trace with hash 2013238847, now seen corresponding path program 1 times [2018-09-26 08:06:38,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:38,306 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:38,307 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:38,307 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:38,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:38,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:38,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:38,308 INFO L87 Difference]: Start difference. First operand 255 states and 418 transitions. Second operand 9 states. [2018-09-26 08:06:38,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:38,540 INFO L93 Difference]: Finished difference Result 296 states and 483 transitions. [2018-09-26 08:06:38,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:06:38,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-09-26 08:06:38,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:38,542 INFO L225 Difference]: With dead ends: 296 [2018-09-26 08:06:38,542 INFO L226 Difference]: Without dead ends: 295 [2018-09-26 08:06:38,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:06:38,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-09-26 08:06:38,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 246. [2018-09-26 08:06:38,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-09-26 08:06:38,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 403 transitions. [2018-09-26 08:06:38,656 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 403 transitions. Word has length 15 [2018-09-26 08:06:38,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:38,656 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 403 transitions. [2018-09-26 08:06:38,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:38,656 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 403 transitions. [2018-09-26 08:06:38,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:06:38,657 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:38,657 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:38,657 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:38,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:38,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1215990847, now seen corresponding path program 1 times [2018-09-26 08:06:38,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:38,681 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:38,681 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:38,681 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:06:38,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:06:38,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:06:38,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:38,682 INFO L87 Difference]: Start difference. First operand 246 states and 403 transitions. Second operand 11 states. [2018-09-26 08:06:38,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:38,907 INFO L93 Difference]: Finished difference Result 274 states and 449 transitions. [2018-09-26 08:06:38,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:38,907 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-09-26 08:06:38,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:38,909 INFO L225 Difference]: With dead ends: 274 [2018-09-26 08:06:38,910 INFO L226 Difference]: Without dead ends: 273 [2018-09-26 08:06:38,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:06:38,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-09-26 08:06:39,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 267. [2018-09-26 08:06:39,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-09-26 08:06:39,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 438 transitions. [2018-09-26 08:06:39,040 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 438 transitions. Word has length 15 [2018-09-26 08:06:39,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:39,041 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 438 transitions. [2018-09-26 08:06:39,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:06:39,041 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 438 transitions. [2018-09-26 08:06:39,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:06:39,042 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:39,042 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:39,042 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:39,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:39,042 INFO L82 PathProgramCache]: Analyzing trace with hash -994782852, now seen corresponding path program 1 times [2018-09-26 08:06:39,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:39,078 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:39,079 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:39,079 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:06:39,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:06:39,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:06:39,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:39,080 INFO L87 Difference]: Start difference. First operand 267 states and 438 transitions. Second operand 11 states. [2018-09-26 08:06:39,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:39,433 INFO L93 Difference]: Finished difference Result 311 states and 496 transitions. [2018-09-26 08:06:39,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:06:39,433 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-09-26 08:06:39,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:39,435 INFO L225 Difference]: With dead ends: 311 [2018-09-26 08:06:39,435 INFO L226 Difference]: Without dead ends: 309 [2018-09-26 08:06:39,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:06:39,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-09-26 08:06:39,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 279. [2018-09-26 08:06:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-09-26 08:06:39,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 457 transitions. [2018-09-26 08:06:39,594 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 457 transitions. Word has length 15 [2018-09-26 08:06:39,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:39,594 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 457 transitions. [2018-09-26 08:06:39,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:06:39,594 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 457 transitions. [2018-09-26 08:06:39,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:06:39,595 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:39,595 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:39,596 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:39,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:39,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1087577094, now seen corresponding path program 2 times [2018-09-26 08:06:39,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:39,624 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:06:39,624 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:39,624 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:06:39,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:06:39,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:06:39,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:06:39,625 INFO L87 Difference]: Start difference. First operand 279 states and 457 transitions. Second operand 12 states. [2018-09-26 08:06:39,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:39,967 INFO L93 Difference]: Finished difference Result 313 states and 495 transitions. [2018-09-26 08:06:39,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:06:39,967 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2018-09-26 08:06:39,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:39,969 INFO L225 Difference]: With dead ends: 313 [2018-09-26 08:06:39,969 INFO L226 Difference]: Without dead ends: 312 [2018-09-26 08:06:39,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:06:39,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-09-26 08:06:40,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 284. [2018-09-26 08:06:40,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-09-26 08:06:40,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 466 transitions. [2018-09-26 08:06:40,119 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 466 transitions. Word has length 15 [2018-09-26 08:06:40,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:40,119 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 466 transitions. [2018-09-26 08:06:40,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:06:40,119 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 466 transitions. [2018-09-26 08:06:40,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:06:40,120 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:40,120 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:40,120 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:40,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:40,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1086284228, now seen corresponding path program 1 times [2018-09-26 08:06:40,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:40,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:40,144 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:40,145 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:06:40,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:06:40,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:06:40,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:40,146 INFO L87 Difference]: Start difference. First operand 284 states and 466 transitions. Second operand 11 states. [2018-09-26 08:06:40,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:40,527 INFO L93 Difference]: Finished difference Result 354 states and 563 transitions. [2018-09-26 08:06:40,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:06:40,527 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-09-26 08:06:40,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:40,529 INFO L225 Difference]: With dead ends: 354 [2018-09-26 08:06:40,529 INFO L226 Difference]: Without dead ends: 352 [2018-09-26 08:06:40,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=169, Invalid=823, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:06:40,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-09-26 08:06:40,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 296. [2018-09-26 08:06:40,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-09-26 08:06:40,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 486 transitions. [2018-09-26 08:06:40,678 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 486 transitions. Word has length 15 [2018-09-26 08:06:40,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:40,678 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 486 transitions. [2018-09-26 08:06:40,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:06:40,678 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 486 transitions. [2018-09-26 08:06:40,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:06:40,679 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:40,679 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:40,679 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:40,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:40,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1365577631, now seen corresponding path program 1 times [2018-09-26 08:06:40,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:40,699 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:40,700 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:40,700 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:06:40,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:06:40,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:06:40,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:40,701 INFO L87 Difference]: Start difference. First operand 296 states and 486 transitions. Second operand 11 states. [2018-09-26 08:06:40,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:40,965 INFO L93 Difference]: Finished difference Result 332 states and 544 transitions. [2018-09-26 08:06:40,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:40,965 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-09-26 08:06:40,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:40,967 INFO L225 Difference]: With dead ends: 332 [2018-09-26 08:06:40,967 INFO L226 Difference]: Without dead ends: 331 [2018-09-26 08:06:40,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:06:40,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-09-26 08:06:41,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 318. [2018-09-26 08:06:41,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-09-26 08:06:41,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 523 transitions. [2018-09-26 08:06:41,131 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 523 transitions. Word has length 15 [2018-09-26 08:06:41,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:41,131 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 523 transitions. [2018-09-26 08:06:41,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:06:41,131 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 523 transitions. [2018-09-26 08:06:41,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:06:41,132 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:41,132 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:41,133 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:41,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:41,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1365577919, now seen corresponding path program 1 times [2018-09-26 08:06:41,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:41,149 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:06:41,150 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:41,150 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:06:41,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:06:41,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:06:41,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:06:41,151 INFO L87 Difference]: Start difference. First operand 318 states and 523 transitions. Second operand 10 states. [2018-09-26 08:06:41,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:41,645 INFO L93 Difference]: Finished difference Result 503 states and 808 transitions. [2018-09-26 08:06:41,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:06:41,646 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-09-26 08:06:41,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:41,649 INFO L225 Difference]: With dead ends: 503 [2018-09-26 08:06:41,649 INFO L226 Difference]: Without dead ends: 501 [2018-09-26 08:06:41,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:06:41,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-09-26 08:06:41,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 396. [2018-09-26 08:06:41,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-09-26 08:06:41,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 658 transitions. [2018-09-26 08:06:41,865 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 658 transitions. Word has length 15 [2018-09-26 08:06:41,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:41,866 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 658 transitions. [2018-09-26 08:06:41,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:06:41,866 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 658 transitions. [2018-09-26 08:06:41,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:06:41,867 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:41,867 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:41,867 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:41,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:41,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1374166088, now seen corresponding path program 1 times [2018-09-26 08:06:41,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:41,892 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:06:41,893 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:41,893 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:06:41,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:06:41,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:06:41,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:06:41,894 INFO L87 Difference]: Start difference. First operand 396 states and 658 transitions. Second operand 12 states. [2018-09-26 08:06:42,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:42,329 INFO L93 Difference]: Finished difference Result 489 states and 800 transitions. [2018-09-26 08:06:42,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:06:42,330 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2018-09-26 08:06:42,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:42,333 INFO L225 Difference]: With dead ends: 489 [2018-09-26 08:06:42,333 INFO L226 Difference]: Without dead ends: 488 [2018-09-26 08:06:42,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:06:42,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-09-26 08:06:42,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 429. [2018-09-26 08:06:42,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-09-26 08:06:42,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 718 transitions. [2018-09-26 08:06:42,572 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 718 transitions. Word has length 15 [2018-09-26 08:06:42,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:42,572 INFO L480 AbstractCegarLoop]: Abstraction has 429 states and 718 transitions. [2018-09-26 08:06:42,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:06:42,573 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 718 transitions. [2018-09-26 08:06:42,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:06:42,576 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:42,576 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:42,576 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:42,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:42,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1374164806, now seen corresponding path program 1 times [2018-09-26 08:06:42,577 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:42,600 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:06:42,600 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:42,600 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:06:42,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:06:42,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:06:42,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:42,601 INFO L87 Difference]: Start difference. First operand 429 states and 718 transitions. Second operand 11 states. [2018-09-26 08:06:43,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:43,038 INFO L93 Difference]: Finished difference Result 484 states and 793 transitions. [2018-09-26 08:06:43,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:06:43,039 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-09-26 08:06:43,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:43,042 INFO L225 Difference]: With dead ends: 484 [2018-09-26 08:06:43,042 INFO L226 Difference]: Without dead ends: 482 [2018-09-26 08:06:43,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:06:43,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2018-09-26 08:06:43,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 442. [2018-09-26 08:06:43,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-09-26 08:06:43,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 739 transitions. [2018-09-26 08:06:43,289 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 739 transitions. Word has length 15 [2018-09-26 08:06:43,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:43,289 INFO L480 AbstractCegarLoop]: Abstraction has 442 states and 739 transitions. [2018-09-26 08:06:43,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:06:43,289 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 739 transitions. [2018-09-26 08:06:43,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:06:43,290 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:43,290 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:43,291 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:43,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:43,291 INFO L82 PathProgramCache]: Analyzing trace with hash -750529310, now seen corresponding path program 1 times [2018-09-26 08:06:43,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:43,326 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:06:43,326 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:43,326 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:06:43,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:06:43,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:06:43,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:06:43,328 INFO L87 Difference]: Start difference. First operand 442 states and 739 transitions. Second operand 10 states. [2018-09-26 08:06:43,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:43,684 INFO L93 Difference]: Finished difference Result 465 states and 766 transitions. [2018-09-26 08:06:43,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:06:43,685 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-09-26 08:06:43,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:43,688 INFO L225 Difference]: With dead ends: 465 [2018-09-26 08:06:43,688 INFO L226 Difference]: Without dead ends: 464 [2018-09-26 08:06:43,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:06:43,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-09-26 08:06:43,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 451. [2018-09-26 08:06:43,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-09-26 08:06:43,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 754 transitions. [2018-09-26 08:06:43,920 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 754 transitions. Word has length 15 [2018-09-26 08:06:43,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:43,920 INFO L480 AbstractCegarLoop]: Abstraction has 451 states and 754 transitions. [2018-09-26 08:06:43,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:06:43,920 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 754 transitions. [2018-09-26 08:06:43,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:06:43,921 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:43,921 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:43,922 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:43,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:43,922 INFO L82 PathProgramCache]: Analyzing trace with hash -215212996, now seen corresponding path program 1 times [2018-09-26 08:06:43,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:43,941 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,941 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:43,941 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:06:43,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:06:43,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:06:43,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:06:43,942 INFO L87 Difference]: Start difference. First operand 451 states and 754 transitions. Second operand 10 states. [2018-09-26 08:06:44,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:44,348 INFO L93 Difference]: Finished difference Result 518 states and 855 transitions. [2018-09-26 08:06:44,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:06:44,349 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-09-26 08:06:44,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:44,352 INFO L225 Difference]: With dead ends: 518 [2018-09-26 08:06:44,352 INFO L226 Difference]: Without dead ends: 516 [2018-09-26 08:06:44,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:06:44,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-09-26 08:06:44,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 467. [2018-09-26 08:06:44,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-09-26 08:06:44,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 781 transitions. [2018-09-26 08:06:44,597 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 781 transitions. Word has length 15 [2018-09-26 08:06:44,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:44,597 INFO L480 AbstractCegarLoop]: Abstraction has 467 states and 781 transitions. [2018-09-26 08:06:44,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:06:44,597 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 781 transitions. [2018-09-26 08:06:44,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:06:44,598 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:44,598 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:44,598 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:44,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:44,599 INFO L82 PathProgramCache]: Analyzing trace with hash -494290335, now seen corresponding path program 1 times [2018-09-26 08:06:44,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:44,615 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:06:44,616 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:44,616 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:06:44,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:06:44,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:06:44,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:06:44,617 INFO L87 Difference]: Start difference. First operand 467 states and 781 transitions. Second operand 10 states. [2018-09-26 08:06:44,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:44,986 INFO L93 Difference]: Finished difference Result 513 states and 856 transitions. [2018-09-26 08:06:44,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:44,987 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-09-26 08:06:44,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:44,990 INFO L225 Difference]: With dead ends: 513 [2018-09-26 08:06:44,990 INFO L226 Difference]: Without dead ends: 512 [2018-09-26 08:06:44,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:06:44,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-09-26 08:06:45,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 492. [2018-09-26 08:06:45,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-09-26 08:06:45,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 823 transitions. [2018-09-26 08:06:45,249 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 823 transitions. Word has length 15 [2018-09-26 08:06:45,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:45,249 INFO L480 AbstractCegarLoop]: Abstraction has 492 states and 823 transitions. [2018-09-26 08:06:45,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:06:45,249 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 823 transitions. [2018-09-26 08:06:45,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:06:45,250 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:45,250 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:45,250 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:45,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:45,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1511388970, now seen corresponding path program 2 times [2018-09-26 08:06:45,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:45,271 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:06:45,271 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:45,271 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:06:45,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:06:45,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:06:45,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:45,272 INFO L87 Difference]: Start difference. First operand 492 states and 823 transitions. Second operand 11 states. [2018-09-26 08:06:45,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:45,753 INFO L93 Difference]: Finished difference Result 571 states and 939 transitions. [2018-09-26 08:06:45,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:06:45,754 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-09-26 08:06:45,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:45,757 INFO L225 Difference]: With dead ends: 571 [2018-09-26 08:06:45,757 INFO L226 Difference]: Without dead ends: 570 [2018-09-26 08:06:45,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:06:45,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-09-26 08:06:46,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 512. [2018-09-26 08:06:46,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2018-09-26 08:06:46,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 860 transitions. [2018-09-26 08:06:46,054 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 860 transitions. Word has length 15 [2018-09-26 08:06:46,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:46,054 INFO L480 AbstractCegarLoop]: Abstraction has 512 states and 860 transitions. [2018-09-26 08:06:46,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:06:46,054 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 860 transitions. [2018-09-26 08:06:46,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:06:46,055 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:46,056 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:46,056 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:46,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:46,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1511389740, now seen corresponding path program 1 times [2018-09-26 08:06:46,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:46,076 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:06:46,077 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:46,077 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:06:46,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:06:46,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:06:46,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:06:46,078 INFO L87 Difference]: Start difference. First operand 512 states and 860 transitions. Second operand 10 states. [2018-09-26 08:06:46,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:46,594 INFO L93 Difference]: Finished difference Result 583 states and 963 transitions. [2018-09-26 08:06:46,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:06:46,594 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-09-26 08:06:46,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:46,597 INFO L225 Difference]: With dead ends: 583 [2018-09-26 08:06:46,597 INFO L226 Difference]: Without dead ends: 581 [2018-09-26 08:06:46,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:06:46,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2018-09-26 08:06:46,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 524. [2018-09-26 08:06:46,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-09-26 08:06:46,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 881 transitions. [2018-09-26 08:06:46,836 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 881 transitions. Word has length 15 [2018-09-26 08:06:46,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:46,836 INFO L480 AbstractCegarLoop]: Abstraction has 524 states and 881 transitions. [2018-09-26 08:06:46,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:06:46,837 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 881 transitions. [2018-09-26 08:06:46,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:06:46,837 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:46,838 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:46,838 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:46,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:46,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1502800801, now seen corresponding path program 1 times [2018-09-26 08:06:46,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:46,859 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:06:46,859 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:46,859 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:06:46,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:06:46,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:06:46,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:46,860 INFO L87 Difference]: Start difference. First operand 524 states and 881 transitions. Second operand 11 states. [2018-09-26 08:06:47,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:47,469 INFO L93 Difference]: Finished difference Result 737 states and 1215 transitions. [2018-09-26 08:06:47,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:06:47,470 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-09-26 08:06:47,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:47,473 INFO L225 Difference]: With dead ends: 737 [2018-09-26 08:06:47,474 INFO L226 Difference]: Without dead ends: 736 [2018-09-26 08:06:47,474 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:06:47,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2018-09-26 08:06:47,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 623. [2018-09-26 08:06:47,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-09-26 08:06:47,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 1052 transitions. [2018-09-26 08:06:47,801 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 1052 transitions. Word has length 15 [2018-09-26 08:06:47,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:47,801 INFO L480 AbstractCegarLoop]: Abstraction has 623 states and 1052 transitions. [2018-09-26 08:06:47,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:06:47,801 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 1052 transitions. [2018-09-26 08:06:47,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:06:47,803 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:47,803 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 08:06:47,803 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:47,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:47,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1502802083, now seen corresponding path program 1 times [2018-09-26 08:06:47,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:47,817 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:06:47,817 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:47,817 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:06:47,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:47,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:47,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:47,818 INFO L87 Difference]: Start difference. First operand 623 states and 1052 transitions. Second operand 9 states. [2018-09-26 08:06:48,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:48,440 INFO L93 Difference]: Finished difference Result 819 states and 1364 transitions. [2018-09-26 08:06:48,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:06:48,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-09-26 08:06:48,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:48,444 INFO L225 Difference]: With dead ends: 819 [2018-09-26 08:06:48,445 INFO L226 Difference]: Without dead ends: 817 [2018-09-26 08:06:48,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:06:48,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2018-09-26 08:06:48,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 600. [2018-09-26 08:06:48,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-09-26 08:06:48,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 1013 transitions. [2018-09-26 08:06:48,784 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 1013 transitions. Word has length 15 [2018-09-26 08:06:48,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:48,784 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 1013 transitions. [2018-09-26 08:06:48,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:48,784 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 1013 transitions. [2018-09-26 08:06:48,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:06:48,785 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:48,785 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:48,786 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:48,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:48,786 INFO L82 PathProgramCache]: Analyzing trace with hash -708989572, now seen corresponding path program 1 times [2018-09-26 08:06:48,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:48,805 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:06:48,805 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:48,806 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:06:48,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:06:48,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:06:48,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:48,806 INFO L87 Difference]: Start difference. First operand 600 states and 1013 transitions. Second operand 11 states. [2018-09-26 08:06:49,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:49,287 INFO L93 Difference]: Finished difference Result 638 states and 1059 transitions. [2018-09-26 08:06:49,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:06:49,287 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-09-26 08:06:49,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:49,291 INFO L225 Difference]: With dead ends: 638 [2018-09-26 08:06:49,291 INFO L226 Difference]: Without dead ends: 637 [2018-09-26 08:06:49,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:06:49,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2018-09-26 08:06:49,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 587. [2018-09-26 08:06:49,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-09-26 08:06:49,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 989 transitions. [2018-09-26 08:06:49,640 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 989 transitions. Word has length 15 [2018-09-26 08:06:49,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:49,641 INFO L480 AbstractCegarLoop]: Abstraction has 587 states and 989 transitions. [2018-09-26 08:06:49,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:06:49,641 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 989 transitions. [2018-09-26 08:06:49,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:06:49,642 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:49,642 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:49,642 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:49,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:49,643 INFO L82 PathProgramCache]: Analyzing trace with hash -708189250, now seen corresponding path program 1 times [2018-09-26 08:06:49,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:49,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:49,659 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:49,659 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:06:49,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:06:49,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:06:49,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:06:49,660 INFO L87 Difference]: Start difference. First operand 587 states and 989 transitions. Second operand 10 states. [2018-09-26 08:06:50,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:50,167 INFO L93 Difference]: Finished difference Result 642 states and 1067 transitions. [2018-09-26 08:06:50,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:06:50,168 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-09-26 08:06:50,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:50,171 INFO L225 Difference]: With dead ends: 642 [2018-09-26 08:06:50,171 INFO L226 Difference]: Without dead ends: 640 [2018-09-26 08:06:50,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:06:50,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-09-26 08:06:50,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 587. [2018-09-26 08:06:50,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-09-26 08:06:50,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 989 transitions. [2018-09-26 08:06:50,458 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 989 transitions. Word has length 15 [2018-09-26 08:06:50,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:50,458 INFO L480 AbstractCegarLoop]: Abstraction has 587 states and 989 transitions. [2018-09-26 08:06:50,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:06:50,458 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 989 transitions. [2018-09-26 08:06:50,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:06:50,459 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:50,459 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:50,460 INFO L423 AbstractCegarLoop]: === Iteration 62 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:50,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:50,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1511308848, now seen corresponding path program 2 times [2018-09-26 08:06:50,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:50,473 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:50,474 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:50,474 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:06:50,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:06:50,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:06:50,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:06:50,475 INFO L87 Difference]: Start difference. First operand 587 states and 989 transitions. Second operand 10 states. [2018-09-26 08:06:50,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:50,845 INFO L93 Difference]: Finished difference Result 610 states and 1020 transitions. [2018-09-26 08:06:50,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:50,846 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-09-26 08:06:50,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:50,849 INFO L225 Difference]: With dead ends: 610 [2018-09-26 08:06:50,849 INFO L226 Difference]: Without dead ends: 609 [2018-09-26 08:06:50,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:06:50,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2018-09-26 08:06:51,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 578. [2018-09-26 08:06:51,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-09-26 08:06:51,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 974 transitions. [2018-09-26 08:06:51,145 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 974 transitions. Word has length 15 [2018-09-26 08:06:51,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:51,145 INFO L480 AbstractCegarLoop]: Abstraction has 578 states and 974 transitions. [2018-09-26 08:06:51,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:06:51,145 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 974 transitions. [2018-09-26 08:06:51,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:06:51,146 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:51,146 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:51,147 INFO L423 AbstractCegarLoop]: === Iteration 63 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:51,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:51,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1638227434, now seen corresponding path program 1 times [2018-09-26 08:06:51,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:51,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:51,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:51,167 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:51,167 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:06:51,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:06:51,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:06:51,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:51,168 INFO L87 Difference]: Start difference. First operand 578 states and 974 transitions. Second operand 11 states. [2018-09-26 08:06:51,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:51,656 INFO L93 Difference]: Finished difference Result 633 states and 1050 transitions. [2018-09-26 08:06:51,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:06:51,657 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-09-26 08:06:51,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:51,660 INFO L225 Difference]: With dead ends: 633 [2018-09-26 08:06:51,660 INFO L226 Difference]: Without dead ends: 631 [2018-09-26 08:06:51,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:06:51,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2018-09-26 08:06:52,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 591. [2018-09-26 08:06:52,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-09-26 08:06:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 995 transitions. [2018-09-26 08:06:52,008 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 995 transitions. Word has length 15 [2018-09-26 08:06:52,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:52,008 INFO L480 AbstractCegarLoop]: Abstraction has 591 states and 995 transitions. [2018-09-26 08:06:52,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:06:52,008 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 995 transitions. [2018-09-26 08:06:52,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:06:52,009 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:52,010 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:52,010 INFO L423 AbstractCegarLoop]: === Iteration 64 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:52,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:52,010 INFO L82 PathProgramCache]: Analyzing trace with hash 553313350, now seen corresponding path program 1 times [2018-09-26 08:06:52,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:52,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:52,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:52,028 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:52,028 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:06:52,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:06:52,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:06:52,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:52,029 INFO L87 Difference]: Start difference. First operand 591 states and 995 transitions. Second operand 11 states. [2018-09-26 08:06:52,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:52,435 INFO L93 Difference]: Finished difference Result 620 states and 1034 transitions. [2018-09-26 08:06:52,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:06:52,436 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-09-26 08:06:52,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:52,439 INFO L225 Difference]: With dead ends: 620 [2018-09-26 08:06:52,439 INFO L226 Difference]: Without dead ends: 619 [2018-09-26 08:06:52,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:06:52,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-09-26 08:06:52,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 596. [2018-09-26 08:06:52,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-09-26 08:06:52,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1004 transitions. [2018-09-26 08:06:52,811 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1004 transitions. Word has length 15 [2018-09-26 08:06:52,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:52,811 INFO L480 AbstractCegarLoop]: Abstraction has 596 states and 1004 transitions. [2018-09-26 08:06:52,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:06:52,812 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1004 transitions. [2018-09-26 08:06:52,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:06:52,813 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:52,814 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1] [2018-09-26 08:06:52,814 INFO L423 AbstractCegarLoop]: === Iteration 65 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:52,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:52,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1657460349, now seen corresponding path program 1 times [2018-09-26 08:06:52,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:52,839 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:52,840 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:52,840 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:06:52,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:06:52,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:06:52,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:52,841 INFO L87 Difference]: Start difference. First operand 596 states and 1004 transitions. Second operand 11 states. [2018-09-26 08:06:53,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:53,280 INFO L93 Difference]: Finished difference Result 601 states and 1009 transitions. [2018-09-26 08:06:53,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:06:53,281 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-09-26 08:06:53,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:53,284 INFO L225 Difference]: With dead ends: 601 [2018-09-26 08:06:53,284 INFO L226 Difference]: Without dead ends: 599 [2018-09-26 08:06:53,285 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:06:53,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-09-26 08:06:53,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 590. [2018-09-26 08:06:53,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-09-26 08:06:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 994 transitions. [2018-09-26 08:06:53,589 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 994 transitions. Word has length 15 [2018-09-26 08:06:53,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:53,590 INFO L480 AbstractCegarLoop]: Abstraction has 590 states and 994 transitions. [2018-09-26 08:06:53,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:06:53,590 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 994 transitions. [2018-09-26 08:06:53,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:06:53,591 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:53,591 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:53,591 INFO L423 AbstractCegarLoop]: === Iteration 66 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:53,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:53,592 INFO L82 PathProgramCache]: Analyzing trace with hash -616146153, now seen corresponding path program 3 times [2018-09-26 08:06:53,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:53,600 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:53,600 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:53,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:53,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:53,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:53,601 INFO L87 Difference]: Start difference. First operand 590 states and 994 transitions. Second operand 8 states. [2018-09-26 08:06:54,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:54,088 INFO L93 Difference]: Finished difference Result 652 states and 1080 transitions. [2018-09-26 08:06:54,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:06:54,088 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:06:54,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:54,091 INFO L225 Difference]: With dead ends: 652 [2018-09-26 08:06:54,092 INFO L226 Difference]: Without dead ends: 650 [2018-09-26 08:06:54,092 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:06:54,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-09-26 08:06:54,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 534. [2018-09-26 08:06:54,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2018-09-26 08:06:54,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 901 transitions. [2018-09-26 08:06:54,350 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 901 transitions. Word has length 16 [2018-09-26 08:06:54,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:54,350 INFO L480 AbstractCegarLoop]: Abstraction has 534 states and 901 transitions. [2018-09-26 08:06:54,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:54,351 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 901 transitions. [2018-09-26 08:06:54,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:06:54,351 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:54,351 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:54,352 INFO L423 AbstractCegarLoop]: === Iteration 67 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:54,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:54,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1231757577, now seen corresponding path program 4 times [2018-09-26 08:06:54,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:54,361 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:54,361 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:54,361 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:54,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:54,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:54,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:54,362 INFO L87 Difference]: Start difference. First operand 534 states and 901 transitions. Second operand 8 states. [2018-09-26 08:06:54,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:54,843 INFO L93 Difference]: Finished difference Result 587 states and 970 transitions. [2018-09-26 08:06:54,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:06:54,843 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:06:54,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:54,846 INFO L225 Difference]: With dead ends: 587 [2018-09-26 08:06:54,846 INFO L226 Difference]: Without dead ends: 585 [2018-09-26 08:06:54,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:54,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-09-26 08:06:55,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 518. [2018-09-26 08:06:55,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-09-26 08:06:55,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 872 transitions. [2018-09-26 08:06:55,215 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 872 transitions. Word has length 16 [2018-09-26 08:06:55,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:55,215 INFO L480 AbstractCegarLoop]: Abstraction has 518 states and 872 transitions. [2018-09-26 08:06:55,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:55,216 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 872 transitions. [2018-09-26 08:06:55,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:06:55,217 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:55,217 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:55,217 INFO L423 AbstractCegarLoop]: === Iteration 68 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:55,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:55,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1223170690, now seen corresponding path program 1 times [2018-09-26 08:06:55,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:55,227 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:06:55,227 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:55,227 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:55,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:55,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:55,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:55,228 INFO L87 Difference]: Start difference. First operand 518 states and 872 transitions. Second operand 8 states. [2018-09-26 08:06:55,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:55,715 INFO L93 Difference]: Finished difference Result 599 states and 990 transitions. [2018-09-26 08:06:55,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:06:55,716 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:06:55,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:55,719 INFO L225 Difference]: With dead ends: 599 [2018-09-26 08:06:55,719 INFO L226 Difference]: Without dead ends: 597 [2018-09-26 08:06:55,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:06:55,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-09-26 08:06:55,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 523. [2018-09-26 08:06:55,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-09-26 08:06:55,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 880 transitions. [2018-09-26 08:06:55,965 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 880 transitions. Word has length 16 [2018-09-26 08:06:55,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:55,965 INFO L480 AbstractCegarLoop]: Abstraction has 523 states and 880 transitions. [2018-09-26 08:06:55,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:55,965 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 880 transitions. [2018-09-26 08:06:55,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:06:55,966 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:55,966 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:55,966 INFO L423 AbstractCegarLoop]: === Iteration 69 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:55,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:55,967 INFO L82 PathProgramCache]: Analyzing trace with hash -767609008, now seen corresponding path program 2 times [2018-09-26 08:06:55,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:55,975 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:06:55,975 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:55,976 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:55,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:55,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:55,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:55,976 INFO L87 Difference]: Start difference. First operand 523 states and 880 transitions. Second operand 8 states. [2018-09-26 08:06:56,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:56,332 INFO L93 Difference]: Finished difference Result 581 states and 960 transitions. [2018-09-26 08:06:56,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:06:56,333 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:06:56,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:56,335 INFO L225 Difference]: With dead ends: 581 [2018-09-26 08:06:56,335 INFO L226 Difference]: Without dead ends: 579 [2018-09-26 08:06:56,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:06:56,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-09-26 08:06:56,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 518. [2018-09-26 08:06:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-09-26 08:06:56,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 872 transitions. [2018-09-26 08:06:56,608 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 872 transitions. Word has length 16 [2018-09-26 08:06:56,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:56,609 INFO L480 AbstractCegarLoop]: Abstraction has 518 states and 872 transitions. [2018-09-26 08:06:56,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:56,609 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 872 transitions. [2018-09-26 08:06:56,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:06:56,616 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:56,616 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:56,616 INFO L423 AbstractCegarLoop]: === Iteration 70 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:56,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:56,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1823106549, now seen corresponding path program 1 times [2018-09-26 08:06:56,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:56,635 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:06:56,639 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:56,639 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:56,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:56,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:56,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:56,640 INFO L87 Difference]: Start difference. First operand 518 states and 872 transitions. Second operand 8 states. [2018-09-26 08:06:57,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:57,058 INFO L93 Difference]: Finished difference Result 575 states and 954 transitions. [2018-09-26 08:06:57,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:06:57,058 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:06:57,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:57,061 INFO L225 Difference]: With dead ends: 575 [2018-09-26 08:06:57,061 INFO L226 Difference]: Without dead ends: 573 [2018-09-26 08:06:57,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:06:57,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2018-09-26 08:06:57,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 521. [2018-09-26 08:06:57,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-09-26 08:06:57,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 877 transitions. [2018-09-26 08:06:57,403 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 877 transitions. Word has length 16 [2018-09-26 08:06:57,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:57,403 INFO L480 AbstractCegarLoop]: Abstraction has 521 states and 877 transitions. [2018-09-26 08:06:57,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:57,403 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 877 transitions. [2018-09-26 08:06:57,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:06:57,404 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:57,404 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,404 INFO L423 AbstractCegarLoop]: === Iteration 71 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:57,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:57,405 INFO L82 PathProgramCache]: Analyzing trace with hash 481081049, now seen corresponding path program 2 times [2018-09-26 08:06:57,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:57,413 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:06:57,413 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:57,413 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:57,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:57,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:57,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:57,414 INFO L87 Difference]: Start difference. First operand 521 states and 877 transitions. Second operand 8 states. [2018-09-26 08:06:57,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:57,832 INFO L93 Difference]: Finished difference Result 581 states and 961 transitions. [2018-09-26 08:06:57,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:06:57,832 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:06:57,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:57,835 INFO L225 Difference]: With dead ends: 581 [2018-09-26 08:06:57,835 INFO L226 Difference]: Without dead ends: 579 [2018-09-26 08:06:57,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:06:57,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-09-26 08:06:58,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 518. [2018-09-26 08:06:58,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-09-26 08:06:58,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 872 transitions. [2018-09-26 08:06:58,093 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 872 transitions. Word has length 16 [2018-09-26 08:06:58,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:58,093 INFO L480 AbstractCegarLoop]: Abstraction has 518 states and 872 transitions. [2018-09-26 08:06:58,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:58,093 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 872 transitions. [2018-09-26 08:06:58,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:06:58,094 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:58,095 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:58,095 INFO L423 AbstractCegarLoop]: === Iteration 72 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:58,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:58,095 INFO L82 PathProgramCache]: Analyzing trace with hash 472492110, now seen corresponding path program 3 times [2018-09-26 08:06:58,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:58,103 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:58,103 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:58,103 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:58,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:58,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:58,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:58,104 INFO L87 Difference]: Start difference. First operand 518 states and 872 transitions. Second operand 8 states. [2018-09-26 08:06:58,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:58,437 INFO L93 Difference]: Finished difference Result 573 states and 946 transitions. [2018-09-26 08:06:58,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:06:58,437 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:06:58,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:58,440 INFO L225 Difference]: With dead ends: 573 [2018-09-26 08:06:58,440 INFO L226 Difference]: Without dead ends: 571 [2018-09-26 08:06:58,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:58,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-09-26 08:06:58,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 512. [2018-09-26 08:06:58,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2018-09-26 08:06:58,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 862 transitions. [2018-09-26 08:06:58,672 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 862 transitions. Word has length 16 [2018-09-26 08:06:58,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:58,672 INFO L480 AbstractCegarLoop]: Abstraction has 512 states and 862 transitions. [2018-09-26 08:06:58,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:58,673 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 862 transitions. [2018-09-26 08:06:58,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:06:58,674 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:58,674 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:58,674 INFO L423 AbstractCegarLoop]: === Iteration 73 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:58,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:58,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1974571456, now seen corresponding path program 4 times [2018-09-26 08:06:58,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:58,682 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:58,682 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:58,683 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:58,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:58,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:58,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:58,683 INFO L87 Difference]: Start difference. First operand 512 states and 862 transitions. Second operand 8 states. [2018-09-26 08:06:59,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:59,149 INFO L93 Difference]: Finished difference Result 564 states and 935 transitions. [2018-09-26 08:06:59,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:06:59,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:06:59,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:59,153 INFO L225 Difference]: With dead ends: 564 [2018-09-26 08:06:59,153 INFO L226 Difference]: Without dead ends: 562 [2018-09-26 08:06:59,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:06:59,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2018-09-26 08:06:59,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 452. [2018-09-26 08:06:59,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-09-26 08:06:59,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 761 transitions. [2018-09-26 08:06:59,373 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 761 transitions. Word has length 16 [2018-09-26 08:06:59,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:59,373 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 761 transitions. [2018-09-26 08:06:59,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:59,373 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 761 transitions. [2018-09-26 08:06:59,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:06:59,374 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:59,374 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:59,375 INFO L423 AbstractCegarLoop]: === Iteration 74 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:59,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:59,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1651842093, now seen corresponding path program 1 times [2018-09-26 08:06:59,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:59,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:59,397 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:59,397 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:06:59,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:06:59,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:06:59,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:06:59,398 INFO L87 Difference]: Start difference. First operand 452 states and 761 transitions. Second operand 13 states. [2018-09-26 08:06:59,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:59,775 INFO L93 Difference]: Finished difference Result 480 states and 791 transitions. [2018-09-26 08:06:59,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:06:59,775 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2018-09-26 08:06:59,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:59,777 INFO L225 Difference]: With dead ends: 480 [2018-09-26 08:06:59,777 INFO L226 Difference]: Without dead ends: 479 [2018-09-26 08:06:59,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=195, Invalid=861, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:06:59,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-09-26 08:07:00,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 430. [2018-09-26 08:07:00,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-09-26 08:07:00,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 722 transitions. [2018-09-26 08:07:00,084 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 722 transitions. Word has length 17 [2018-09-26 08:07:00,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:00,084 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 722 transitions. [2018-09-26 08:07:00,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:07:00,084 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 722 transitions. [2018-09-26 08:07:00,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:07:00,085 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:00,085 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:00,085 INFO L423 AbstractCegarLoop]: === Iteration 75 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:00,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:00,086 INFO L82 PathProgramCache]: Analyzing trace with hash 692781, now seen corresponding path program 1 times [2018-09-26 08:07:00,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:00,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:00,098 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:00,098 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:07:00,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:07:00,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:07:00,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:07:00,098 INFO L87 Difference]: Start difference. First operand 430 states and 722 transitions. Second operand 12 states. [2018-09-26 08:07:00,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:00,464 INFO L93 Difference]: Finished difference Result 545 states and 906 transitions. [2018-09-26 08:07:00,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:07:00,464 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-09-26 08:07:00,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:00,465 INFO L225 Difference]: With dead ends: 545 [2018-09-26 08:07:00,466 INFO L226 Difference]: Without dead ends: 544 [2018-09-26 08:07:00,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:07:00,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-09-26 08:07:00,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 451. [2018-09-26 08:07:00,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-09-26 08:07:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 757 transitions. [2018-09-26 08:07:00,686 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 757 transitions. Word has length 17 [2018-09-26 08:07:00,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:00,686 INFO L480 AbstractCegarLoop]: Abstraction has 451 states and 757 transitions. [2018-09-26 08:07:00,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:07:00,686 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 757 transitions. [2018-09-26 08:07:00,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:07:00,687 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:00,687 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:00,687 INFO L423 AbstractCegarLoop]: === Iteration 76 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:00,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:00,688 INFO L82 PathProgramCache]: Analyzing trace with hash 337396676, now seen corresponding path program 1 times [2018-09-26 08:07:00,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:00,705 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:00,706 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:00,706 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:07:00,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:07:00,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:07:00,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:07:00,707 INFO L87 Difference]: Start difference. First operand 451 states and 757 transitions. Second operand 12 states. [2018-09-26 08:07:00,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:00,994 INFO L93 Difference]: Finished difference Result 458 states and 767 transitions. [2018-09-26 08:07:00,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:07:00,994 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-09-26 08:07:00,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:00,996 INFO L225 Difference]: With dead ends: 458 [2018-09-26 08:07:00,996 INFO L226 Difference]: Without dead ends: 457 [2018-09-26 08:07:00,997 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:07:00,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-09-26 08:07:01,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 423. [2018-09-26 08:07:01,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-09-26 08:07:01,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 709 transitions. [2018-09-26 08:07:01,199 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 709 transitions. Word has length 17 [2018-09-26 08:07:01,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:01,200 INFO L480 AbstractCegarLoop]: Abstraction has 423 states and 709 transitions. [2018-09-26 08:07:01,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:07:01,200 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 709 transitions. [2018-09-26 08:07:01,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:07:01,200 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:01,200 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:01,201 INFO L423 AbstractCegarLoop]: === Iteration 77 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:01,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:01,201 INFO L82 PathProgramCache]: Analyzing trace with hash -449446913, now seen corresponding path program 2 times [2018-09-26 08:07:01,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:01,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:01,223 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:01,224 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:07:01,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:07:01,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:07:01,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:07:01,224 INFO L87 Difference]: Start difference. First operand 423 states and 709 transitions. Second operand 13 states. [2018-09-26 08:07:01,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:01,753 INFO L93 Difference]: Finished difference Result 508 states and 829 transitions. [2018-09-26 08:07:01,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:07:01,754 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2018-09-26 08:07:01,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:01,755 INFO L225 Difference]: With dead ends: 508 [2018-09-26 08:07:01,755 INFO L226 Difference]: Without dead ends: 507 [2018-09-26 08:07:01,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=220, Invalid=1112, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:07:01,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-09-26 08:07:01,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 440. [2018-09-26 08:07:01,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-09-26 08:07:01,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 736 transitions. [2018-09-26 08:07:01,976 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 736 transitions. Word has length 17 [2018-09-26 08:07:01,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:01,976 INFO L480 AbstractCegarLoop]: Abstraction has 440 states and 736 transitions. [2018-09-26 08:07:01,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:07:01,977 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 736 transitions. [2018-09-26 08:07:01,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:07:01,977 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:01,977 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1] [2018-09-26 08:07:01,978 INFO L423 AbstractCegarLoop]: === Iteration 78 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:01,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:01,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1940633158, now seen corresponding path program 1 times [2018-09-26 08:07:01,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:01,999 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:02,000 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:02,000 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:07:02,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:07:02,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:07:02,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:07:02,001 INFO L87 Difference]: Start difference. First operand 440 states and 736 transitions. Second operand 13 states. [2018-09-26 08:07:02,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:02,254 INFO L93 Difference]: Finished difference Result 446 states and 743 transitions. [2018-09-26 08:07:02,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:07:02,254 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2018-09-26 08:07:02,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:02,255 INFO L225 Difference]: With dead ends: 446 [2018-09-26 08:07:02,255 INFO L226 Difference]: Without dead ends: 445 [2018-09-26 08:07:02,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:07:02,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-09-26 08:07:02,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 424. [2018-09-26 08:07:02,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-09-26 08:07:02,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 709 transitions. [2018-09-26 08:07:02,467 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 709 transitions. Word has length 17 [2018-09-26 08:07:02,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:02,467 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 709 transitions. [2018-09-26 08:07:02,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:07:02,467 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 709 transitions. [2018-09-26 08:07:02,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:07:02,468 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:02,468 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:02,468 INFO L423 AbstractCegarLoop]: === Iteration 79 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:02,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:02,468 INFO L82 PathProgramCache]: Analyzing trace with hash -453832993, now seen corresponding path program 1 times [2018-09-26 08:07:02,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:02,484 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:07:02,485 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:02,485 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:07:02,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:07:02,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:07:02,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:07:02,486 INFO L87 Difference]: Start difference. First operand 424 states and 709 transitions. Second operand 12 states. [2018-09-26 08:07:02,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:02,929 INFO L93 Difference]: Finished difference Result 505 states and 821 transitions. [2018-09-26 08:07:02,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:07:02,929 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-09-26 08:07:02,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:02,930 INFO L225 Difference]: With dead ends: 505 [2018-09-26 08:07:02,931 INFO L226 Difference]: Without dead ends: 504 [2018-09-26 08:07:02,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:07:02,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2018-09-26 08:07:03,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 453. [2018-09-26 08:07:03,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2018-09-26 08:07:03,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 755 transitions. [2018-09-26 08:07:03,166 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 755 transitions. Word has length 17 [2018-09-26 08:07:03,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:03,166 INFO L480 AbstractCegarLoop]: Abstraction has 453 states and 755 transitions. [2018-09-26 08:07:03,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:07:03,166 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 755 transitions. [2018-09-26 08:07:03,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:07:03,167 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:03,167 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:03,168 INFO L423 AbstractCegarLoop]: === Iteration 80 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:03,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:03,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1757610527, now seen corresponding path program 1 times [2018-09-26 08:07:03,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:03,182 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:03,182 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:03,183 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:07:03,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:07:03,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:07:03,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:07:03,183 INFO L87 Difference]: Start difference. First operand 453 states and 755 transitions. Second operand 12 states. [2018-09-26 08:07:03,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:03,607 INFO L93 Difference]: Finished difference Result 516 states and 838 transitions. [2018-09-26 08:07:03,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:07:03,607 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-09-26 08:07:03,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:03,608 INFO L225 Difference]: With dead ends: 516 [2018-09-26 08:07:03,608 INFO L226 Difference]: Without dead ends: 515 [2018-09-26 08:07:03,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=169, Invalid=887, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:07:03,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-09-26 08:07:03,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 449. [2018-09-26 08:07:03,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-09-26 08:07:03,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 748 transitions. [2018-09-26 08:07:03,840 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 748 transitions. Word has length 17 [2018-09-26 08:07:03,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:03,840 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 748 transitions. [2018-09-26 08:07:03,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:07:03,840 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 748 transitions. [2018-09-26 08:07:03,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:07:03,841 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:03,841 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:03,842 INFO L423 AbstractCegarLoop]: === Iteration 81 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:03,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:03,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1709007603, now seen corresponding path program 1 times [2018-09-26 08:07:03,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:03,860 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:03,861 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:03,861 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:07:03,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:07:03,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:07:03,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:07:03,861 INFO L87 Difference]: Start difference. First operand 449 states and 748 transitions. Second operand 13 states. [2018-09-26 08:07:04,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:04,265 INFO L93 Difference]: Finished difference Result 526 states and 863 transitions. [2018-09-26 08:07:04,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:07:04,266 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2018-09-26 08:07:04,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:04,267 INFO L225 Difference]: With dead ends: 526 [2018-09-26 08:07:04,267 INFO L226 Difference]: Without dead ends: 524 [2018-09-26 08:07:04,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:07:04,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-09-26 08:07:04,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 455. [2018-09-26 08:07:04,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-09-26 08:07:04,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 760 transitions. [2018-09-26 08:07:04,523 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 760 transitions. Word has length 17 [2018-09-26 08:07:04,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:04,523 INFO L480 AbstractCegarLoop]: Abstraction has 455 states and 760 transitions. [2018-09-26 08:07:04,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:07:04,523 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 760 transitions. [2018-09-26 08:07:04,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:07:04,524 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:04,524 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:04,524 INFO L423 AbstractCegarLoop]: === Iteration 82 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:04,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:04,525 INFO L82 PathProgramCache]: Analyzing trace with hash -840518133, now seen corresponding path program 2 times [2018-09-26 08:07:04,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:04,538 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:04,538 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:04,538 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:07:04,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:07:04,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:07:04,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:07:04,539 INFO L87 Difference]: Start difference. First operand 455 states and 760 transitions. Second operand 12 states. [2018-09-26 08:07:04,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:04,867 INFO L93 Difference]: Finished difference Result 499 states and 825 transitions. [2018-09-26 08:07:04,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:07:04,867 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-09-26 08:07:04,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:04,868 INFO L225 Difference]: With dead ends: 499 [2018-09-26 08:07:04,868 INFO L226 Difference]: Without dead ends: 498 [2018-09-26 08:07:04,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:07:04,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-09-26 08:07:05,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 428. [2018-09-26 08:07:05,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-09-26 08:07:05,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 713 transitions. [2018-09-26 08:07:05,116 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 713 transitions. Word has length 17 [2018-09-26 08:07:05,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:05,116 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 713 transitions. [2018-09-26 08:07:05,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:07:05,116 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 713 transitions. [2018-09-26 08:07:05,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:05,116 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:05,117 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:05,117 INFO L423 AbstractCegarLoop]: === Iteration 83 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:05,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:05,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1270158156, now seen corresponding path program 1 times [2018-09-26 08:07:05,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:05,132 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:05,132 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:05,133 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:07:05,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:07:05,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:07:05,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:07:05,133 INFO L87 Difference]: Start difference. First operand 428 states and 713 transitions. Second operand 12 states. [2018-09-26 08:07:05,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:05,480 INFO L93 Difference]: Finished difference Result 491 states and 812 transitions. [2018-09-26 08:07:05,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:07:05,480 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-09-26 08:07:05,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:05,482 INFO L225 Difference]: With dead ends: 491 [2018-09-26 08:07:05,482 INFO L226 Difference]: Without dead ends: 490 [2018-09-26 08:07:05,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:07:05,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-09-26 08:07:05,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 466. [2018-09-26 08:07:05,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-09-26 08:07:05,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 779 transitions. [2018-09-26 08:07:05,781 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 779 transitions. Word has length 18 [2018-09-26 08:07:05,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:05,781 INFO L480 AbstractCegarLoop]: Abstraction has 466 states and 779 transitions. [2018-09-26 08:07:05,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:07:05,781 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 779 transitions. [2018-09-26 08:07:05,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:05,782 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:05,782 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:05,783 INFO L423 AbstractCegarLoop]: === Iteration 84 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:05,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:05,783 INFO L82 PathProgramCache]: Analyzing trace with hash -301522250, now seen corresponding path program 1 times [2018-09-26 08:07:05,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:05,802 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:05,802 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:05,802 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:07:05,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:07:05,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:07:05,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:07:05,803 INFO L87 Difference]: Start difference. First operand 466 states and 779 transitions. Second operand 12 states. [2018-09-26 08:07:06,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:06,327 INFO L93 Difference]: Finished difference Result 563 states and 925 transitions. [2018-09-26 08:07:06,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:07:06,327 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-09-26 08:07:06,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:06,328 INFO L225 Difference]: With dead ends: 563 [2018-09-26 08:07:06,329 INFO L226 Difference]: Without dead ends: 561 [2018-09-26 08:07:06,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:07:06,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-09-26 08:07:06,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 458. [2018-09-26 08:07:06,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-09-26 08:07:06,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 765 transitions. [2018-09-26 08:07:06,588 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 765 transitions. Word has length 18 [2018-09-26 08:07:06,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:06,588 INFO L480 AbstractCegarLoop]: Abstraction has 458 states and 765 transitions. [2018-09-26 08:07:06,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:07:06,588 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 765 transitions. [2018-09-26 08:07:06,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:06,589 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:06,589 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:06,589 INFO L423 AbstractCegarLoop]: === Iteration 85 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:06,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:06,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1503466215, now seen corresponding path program 1 times [2018-09-26 08:07:06,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:06,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:06,603 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:06,603 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:07:06,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:07:06,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:07:06,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:07:06,604 INFO L87 Difference]: Start difference. First operand 458 states and 765 transitions. Second operand 11 states. [2018-09-26 08:07:07,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:07,148 INFO L93 Difference]: Finished difference Result 513 states and 833 transitions. [2018-09-26 08:07:07,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:07:07,148 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-09-26 08:07:07,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:07,149 INFO L225 Difference]: With dead ends: 513 [2018-09-26 08:07:07,149 INFO L226 Difference]: Without dead ends: 511 [2018-09-26 08:07:07,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=188, Invalid=682, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:07:07,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-26 08:07:07,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 459. [2018-09-26 08:07:07,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-09-26 08:07:07,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 767 transitions. [2018-09-26 08:07:07,436 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 767 transitions. Word has length 18 [2018-09-26 08:07:07,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:07,436 INFO L480 AbstractCegarLoop]: Abstraction has 459 states and 767 transitions. [2018-09-26 08:07:07,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:07:07,436 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 767 transitions. [2018-09-26 08:07:07,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:07,437 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:07,437 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:07,438 INFO L423 AbstractCegarLoop]: === Iteration 86 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:07,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:07,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1224172812, now seen corresponding path program 2 times [2018-09-26 08:07:07,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:07,455 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:07,456 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:07,456 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:07:07,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:07:07,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:07:07,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:07:07,456 INFO L87 Difference]: Start difference. First operand 459 states and 767 transitions. Second operand 13 states. [2018-09-26 08:07:07,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:07,849 INFO L93 Difference]: Finished difference Result 507 states and 835 transitions. [2018-09-26 08:07:07,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:07:07,849 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-09-26 08:07:07,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:07,850 INFO L225 Difference]: With dead ends: 507 [2018-09-26 08:07:07,850 INFO L226 Difference]: Without dead ends: 506 [2018-09-26 08:07:07,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:07:07,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-09-26 08:07:08,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 466. [2018-09-26 08:07:08,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-09-26 08:07:08,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 780 transitions. [2018-09-26 08:07:08,119 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 780 transitions. Word has length 18 [2018-09-26 08:07:08,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:08,120 INFO L480 AbstractCegarLoop]: Abstraction has 466 states and 780 transitions. [2018-09-26 08:07:08,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:07:08,120 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 780 transitions. [2018-09-26 08:07:08,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:08,121 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:08,121 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:08,121 INFO L423 AbstractCegarLoop]: === Iteration 87 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:08,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:08,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1224172524, now seen corresponding path program 1 times [2018-09-26 08:07:08,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:08,137 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:08,137 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:08,137 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:07:08,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:07:08,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:07:08,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:07:08,138 INFO L87 Difference]: Start difference. First operand 466 states and 780 transitions. Second operand 11 states. [2018-09-26 08:07:08,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:08,552 INFO L93 Difference]: Finished difference Result 518 states and 845 transitions. [2018-09-26 08:07:08,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:07:08,552 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-09-26 08:07:08,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:08,553 INFO L225 Difference]: With dead ends: 518 [2018-09-26 08:07:08,553 INFO L226 Difference]: Without dead ends: 516 [2018-09-26 08:07:08,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:07:08,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-09-26 08:07:08,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 469. [2018-09-26 08:07:08,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-09-26 08:07:08,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 783 transitions. [2018-09-26 08:07:08,873 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 783 transitions. Word has length 18 [2018-09-26 08:07:08,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:08,873 INFO L480 AbstractCegarLoop]: Abstraction has 469 states and 783 transitions. [2018-09-26 08:07:08,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:07:08,874 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 783 transitions. [2018-09-26 08:07:08,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:08,874 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:08,874 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:08,874 INFO L423 AbstractCegarLoop]: === Iteration 88 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:08,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:08,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1215585637, now seen corresponding path program 1 times [2018-09-26 08:07:08,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:08,888 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:08,889 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:08,889 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:07:08,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:07:08,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:07:08,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:07:08,890 INFO L87 Difference]: Start difference. First operand 469 states and 783 transitions. Second operand 11 states. [2018-09-26 08:07:09,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:09,340 INFO L93 Difference]: Finished difference Result 531 states and 868 transitions. [2018-09-26 08:07:09,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:07:09,340 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-09-26 08:07:09,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:09,341 INFO L225 Difference]: With dead ends: 531 [2018-09-26 08:07:09,341 INFO L226 Difference]: Without dead ends: 529 [2018-09-26 08:07:09,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:07:09,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-09-26 08:07:09,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 470. [2018-09-26 08:07:09,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-09-26 08:07:09,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 785 transitions. [2018-09-26 08:07:09,615 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 785 transitions. Word has length 18 [2018-09-26 08:07:09,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:09,615 INFO L480 AbstractCegarLoop]: Abstraction has 470 states and 785 transitions. [2018-09-26 08:07:09,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:07:09,616 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 785 transitions. [2018-09-26 08:07:09,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:09,616 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:09,616 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:09,617 INFO L423 AbstractCegarLoop]: === Iteration 89 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:09,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:09,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1085218294, now seen corresponding path program 1 times [2018-09-26 08:07:09,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:09,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:09,631 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:09,631 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:07:09,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:07:09,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:07:09,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:07:09,632 INFO L87 Difference]: Start difference. First operand 470 states and 785 transitions. Second operand 12 states. [2018-09-26 08:07:10,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:10,091 INFO L93 Difference]: Finished difference Result 545 states and 895 transitions. [2018-09-26 08:07:10,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:07:10,092 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-09-26 08:07:10,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:10,093 INFO L225 Difference]: With dead ends: 545 [2018-09-26 08:07:10,093 INFO L226 Difference]: Without dead ends: 543 [2018-09-26 08:07:10,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:07:10,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-09-26 08:07:10,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 474. [2018-09-26 08:07:10,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-09-26 08:07:10,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 791 transitions. [2018-09-26 08:07:10,562 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 791 transitions. Word has length 18 [2018-09-26 08:07:10,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:10,562 INFO L480 AbstractCegarLoop]: Abstraction has 474 states and 791 transitions. [2018-09-26 08:07:10,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:07:10,562 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 791 transitions. [2018-09-26 08:07:10,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:10,562 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:10,563 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:10,563 INFO L423 AbstractCegarLoop]: === Iteration 90 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:10,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:10,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1467012, now seen corresponding path program 1 times [2018-09-26 08:07:10,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:10,573 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:10,573 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:10,573 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:07:10,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:07:10,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:07:10,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:07:10,574 INFO L87 Difference]: Start difference. First operand 474 states and 791 transitions. Second operand 11 states. [2018-09-26 08:07:11,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:11,105 INFO L93 Difference]: Finished difference Result 634 states and 1037 transitions. [2018-09-26 08:07:11,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:07:11,106 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-09-26 08:07:11,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:11,108 INFO L225 Difference]: With dead ends: 634 [2018-09-26 08:07:11,108 INFO L226 Difference]: Without dead ends: 632 [2018-09-26 08:07:11,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:07:11,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-09-26 08:07:11,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 493. [2018-09-26 08:07:11,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-09-26 08:07:11,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 822 transitions. [2018-09-26 08:07:11,521 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 822 transitions. Word has length 18 [2018-09-26 08:07:11,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:11,522 INFO L480 AbstractCegarLoop]: Abstraction has 493 states and 822 transitions. [2018-09-26 08:07:11,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:07:11,522 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 822 transitions. [2018-09-26 08:07:11,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:11,522 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:11,522 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:11,522 INFO L423 AbstractCegarLoop]: === Iteration 91 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:11,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:11,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1846437006, now seen corresponding path program 1 times [2018-09-26 08:07:11,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:11,535 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:11,536 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:11,536 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:07:11,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:07:11,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:07:11,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:07:11,536 INFO L87 Difference]: Start difference. First operand 493 states and 822 transitions. Second operand 13 states. [2018-09-26 08:07:12,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:12,051 INFO L93 Difference]: Finished difference Result 574 states and 939 transitions. [2018-09-26 08:07:12,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:07:12,051 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-09-26 08:07:12,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:12,053 INFO L225 Difference]: With dead ends: 574 [2018-09-26 08:07:12,053 INFO L226 Difference]: Without dead ends: 573 [2018-09-26 08:07:12,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:07:12,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2018-09-26 08:07:12,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 491. [2018-09-26 08:07:12,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2018-09-26 08:07:12,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 817 transitions. [2018-09-26 08:07:12,419 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 817 transitions. Word has length 18 [2018-09-26 08:07:12,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:12,419 INFO L480 AbstractCegarLoop]: Abstraction has 491 states and 817 transitions. [2018-09-26 08:07:12,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:07:12,419 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 817 transitions. [2018-09-26 08:07:12,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:12,420 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:12,420 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:12,420 INFO L423 AbstractCegarLoop]: === Iteration 92 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:12,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:12,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1846436718, now seen corresponding path program 2 times [2018-09-26 08:07:12,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:12,437 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:12,438 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:12,438 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:07:12,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:07:12,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:07:12,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:07:12,439 INFO L87 Difference]: Start difference. First operand 491 states and 817 transitions. Second operand 11 states. [2018-09-26 08:07:12,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:12,984 INFO L93 Difference]: Finished difference Result 557 states and 901 transitions. [2018-09-26 08:07:12,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:07:12,984 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-09-26 08:07:12,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:12,985 INFO L225 Difference]: With dead ends: 557 [2018-09-26 08:07:12,986 INFO L226 Difference]: Without dead ends: 555 [2018-09-26 08:07:12,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:07:12,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-09-26 08:07:13,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 477. [2018-09-26 08:07:13,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-09-26 08:07:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 791 transitions. [2018-09-26 08:07:13,276 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 791 transitions. Word has length 18 [2018-09-26 08:07:13,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:13,276 INFO L480 AbstractCegarLoop]: Abstraction has 477 states and 791 transitions. [2018-09-26 08:07:13,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:07:13,276 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 791 transitions. [2018-09-26 08:07:13,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:13,276 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:13,277 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:13,277 INFO L423 AbstractCegarLoop]: === Iteration 93 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:13,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:13,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1837849831, now seen corresponding path program 1 times [2018-09-26 08:07:13,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:13,289 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:13,289 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:13,289 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:07:13,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:07:13,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:07:13,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:07:13,290 INFO L87 Difference]: Start difference. First operand 477 states and 791 transitions. Second operand 11 states. [2018-09-26 08:07:13,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:13,758 INFO L93 Difference]: Finished difference Result 557 states and 903 transitions. [2018-09-26 08:07:13,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:07:13,758 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-09-26 08:07:13,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:13,760 INFO L225 Difference]: With dead ends: 557 [2018-09-26 08:07:13,760 INFO L226 Difference]: Without dead ends: 555 [2018-09-26 08:07:13,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:07:13,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-09-26 08:07:14,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 467. [2018-09-26 08:07:14,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-09-26 08:07:14,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 775 transitions. [2018-09-26 08:07:14,126 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 775 transitions. Word has length 18 [2018-09-26 08:07:14,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:14,126 INFO L480 AbstractCegarLoop]: Abstraction has 467 states and 775 transitions. [2018-09-26 08:07:14,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:07:14,126 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 775 transitions. [2018-09-26 08:07:14,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:14,126 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:14,127 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:14,127 INFO L423 AbstractCegarLoop]: === Iteration 94 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:14,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:14,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1884609208, now seen corresponding path program 1 times [2018-09-26 08:07:14,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:14,145 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:07:14,145 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:14,145 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:07:14,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:07:14,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:07:14,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:07:14,146 INFO L87 Difference]: Start difference. First operand 467 states and 775 transitions. Second operand 12 states. [2018-09-26 08:07:14,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:14,657 INFO L93 Difference]: Finished difference Result 594 states and 971 transitions. [2018-09-26 08:07:14,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:07:14,657 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-09-26 08:07:14,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:14,658 INFO L225 Difference]: With dead ends: 594 [2018-09-26 08:07:14,658 INFO L226 Difference]: Without dead ends: 592 [2018-09-26 08:07:14,659 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:07:14,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-09-26 08:07:14,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 469. [2018-09-26 08:07:14,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-09-26 08:07:14,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 778 transitions. [2018-09-26 08:07:14,958 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 778 transitions. Word has length 18 [2018-09-26 08:07:14,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:14,958 INFO L480 AbstractCegarLoop]: Abstraction has 469 states and 778 transitions. [2018-09-26 08:07:14,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:07:14,958 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 778 transitions. [2018-09-26 08:07:14,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:14,958 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:14,959 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:14,959 INFO L423 AbstractCegarLoop]: === Iteration 95 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:14,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:14,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1136854538, now seen corresponding path program 1 times [2018-09-26 08:07:14,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:14,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:14,969 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:14,969 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:07:14,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:07:14,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:07:14,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:07:14,970 INFO L87 Difference]: Start difference. First operand 469 states and 778 transitions. Second operand 10 states. [2018-09-26 08:07:15,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:15,402 INFO L93 Difference]: Finished difference Result 531 states and 864 transitions. [2018-09-26 08:07:15,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:07:15,402 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-09-26 08:07:15,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:15,403 INFO L225 Difference]: With dead ends: 531 [2018-09-26 08:07:15,403 INFO L226 Difference]: Without dead ends: 529 [2018-09-26 08:07:15,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:07:15,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-09-26 08:07:15,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 473. [2018-09-26 08:07:15,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-09-26 08:07:15,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 785 transitions. [2018-09-26 08:07:15,709 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 785 transitions. Word has length 18 [2018-09-26 08:07:15,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:15,709 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 785 transitions. [2018-09-26 08:07:15,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:07:15,709 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 785 transitions. [2018-09-26 08:07:15,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:15,710 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:15,710 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:15,710 INFO L423 AbstractCegarLoop]: === Iteration 96 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:15,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:15,711 INFO L82 PathProgramCache]: Analyzing trace with hash 589748198, now seen corresponding path program 1 times [2018-09-26 08:07:15,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:15,724 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:15,724 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:15,724 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:07:15,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:07:15,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:07:15,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:07:15,725 INFO L87 Difference]: Start difference. First operand 473 states and 785 transitions. Second operand 10 states. [2018-09-26 08:07:16,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:16,220 INFO L93 Difference]: Finished difference Result 578 states and 943 transitions. [2018-09-26 08:07:16,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:07:16,220 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-09-26 08:07:16,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:16,221 INFO L225 Difference]: With dead ends: 578 [2018-09-26 08:07:16,221 INFO L226 Difference]: Without dead ends: 576 [2018-09-26 08:07:16,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:07:16,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-09-26 08:07:16,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 496. [2018-09-26 08:07:16,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-09-26 08:07:16,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 824 transitions. [2018-09-26 08:07:16,539 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 824 transitions. Word has length 18 [2018-09-26 08:07:16,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:16,539 INFO L480 AbstractCegarLoop]: Abstraction has 496 states and 824 transitions. [2018-09-26 08:07:16,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:07:16,539 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 824 transitions. [2018-09-26 08:07:16,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:16,540 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:16,540 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:16,540 INFO L423 AbstractCegarLoop]: === Iteration 97 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:16,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:16,541 INFO L82 PathProgramCache]: Analyzing trace with hash 581159259, now seen corresponding path program 1 times [2018-09-26 08:07:16,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:16,550 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:16,551 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:16,551 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:16,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:07:16,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:07:16,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:07:16,552 INFO L87 Difference]: Start difference. First operand 496 states and 824 transitions. Second operand 9 states. [2018-09-26 08:07:16,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:16,977 INFO L93 Difference]: Finished difference Result 551 states and 898 transitions. [2018-09-26 08:07:16,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:07:16,977 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-09-26 08:07:16,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:16,978 INFO L225 Difference]: With dead ends: 551 [2018-09-26 08:07:16,978 INFO L226 Difference]: Without dead ends: 549 [2018-09-26 08:07:16,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:07:16,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-09-26 08:07:17,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 500. [2018-09-26 08:07:17,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2018-09-26 08:07:17,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 828 transitions. [2018-09-26 08:07:17,559 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 828 transitions. Word has length 18 [2018-09-26 08:07:17,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:17,559 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 828 transitions. [2018-09-26 08:07:17,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:17,560 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 828 transitions. [2018-09-26 08:07:17,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:17,560 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:17,561 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:17,561 INFO L423 AbstractCegarLoop]: === Iteration 98 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:17,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:17,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1629830792, now seen corresponding path program 1 times [2018-09-26 08:07:17,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:17,582 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:17,582 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:17,582 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:07:17,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:07:17,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:07:17,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:07:17,583 INFO L87 Difference]: Start difference. First operand 500 states and 828 transitions. Second operand 10 states. [2018-09-26 08:07:18,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:18,094 INFO L93 Difference]: Finished difference Result 581 states and 944 transitions. [2018-09-26 08:07:18,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:07:18,095 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-09-26 08:07:18,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:18,095 INFO L225 Difference]: With dead ends: 581 [2018-09-26 08:07:18,095 INFO L226 Difference]: Without dead ends: 579 [2018-09-26 08:07:18,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:07:18,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-09-26 08:07:18,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 504. [2018-09-26 08:07:18,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-09-26 08:07:18,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 834 transitions. [2018-09-26 08:07:18,581 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 834 transitions. Word has length 18 [2018-09-26 08:07:18,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:18,581 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 834 transitions. [2018-09-26 08:07:18,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:07:18,581 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 834 transitions. [2018-09-26 08:07:18,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:18,582 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:18,582 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:18,582 INFO L423 AbstractCegarLoop]: === Iteration 99 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:18,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:18,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1655320734, now seen corresponding path program 2 times [2018-09-26 08:07:18,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:18,591 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:18,591 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:18,591 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:07:18,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:07:18,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:07:18,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:07:18,592 INFO L87 Difference]: Start difference. First operand 504 states and 834 transitions. Second operand 10 states. [2018-09-26 08:07:19,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:19,161 INFO L93 Difference]: Finished difference Result 630 states and 1024 transitions. [2018-09-26 08:07:19,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:07:19,161 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-09-26 08:07:19,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:19,162 INFO L225 Difference]: With dead ends: 630 [2018-09-26 08:07:19,162 INFO L226 Difference]: Without dead ends: 628 [2018-09-26 08:07:19,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:07:19,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-09-26 08:07:19,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 509. [2018-09-26 08:07:19,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-09-26 08:07:19,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 843 transitions. [2018-09-26 08:07:19,490 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 843 transitions. Word has length 18 [2018-09-26 08:07:19,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:19,491 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 843 transitions. [2018-09-26 08:07:19,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:07:19,491 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 843 transitions. [2018-09-26 08:07:19,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:19,491 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:19,491 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:19,492 INFO L423 AbstractCegarLoop]: === Iteration 100 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:19,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:19,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1646731795, now seen corresponding path program 2 times [2018-09-26 08:07:19,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:19,502 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:19,503 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:19,503 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:07:19,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:07:19,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:07:19,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:07:19,503 INFO L87 Difference]: Start difference. First operand 509 states and 843 transitions. Second operand 10 states. [2018-09-26 08:07:20,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:20,125 INFO L93 Difference]: Finished difference Result 620 states and 1007 transitions. [2018-09-26 08:07:20,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:07:20,125 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-09-26 08:07:20,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:20,126 INFO L225 Difference]: With dead ends: 620 [2018-09-26 08:07:20,126 INFO L226 Difference]: Without dead ends: 618 [2018-09-26 08:07:20,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:07:20,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-09-26 08:07:20,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 510. [2018-09-26 08:07:20,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2018-09-26 08:07:20,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 845 transitions. [2018-09-26 08:07:20,456 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 845 transitions. Word has length 18 [2018-09-26 08:07:20,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:20,456 INFO L480 AbstractCegarLoop]: Abstraction has 510 states and 845 transitions. [2018-09-26 08:07:20,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:07:20,456 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 845 transitions. [2018-09-26 08:07:20,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:20,457 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:20,457 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:20,458 INFO L423 AbstractCegarLoop]: === Iteration 101 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:20,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:20,458 INFO L82 PathProgramCache]: Analyzing trace with hash -800331771, now seen corresponding path program 3 times [2018-09-26 08:07:20,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:20,470 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:20,471 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:20,471 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:07:20,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:07:20,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:07:20,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:07:20,472 INFO L87 Difference]: Start difference. First operand 510 states and 845 transitions. Second operand 10 states. [2018-09-26 08:07:21,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:21,122 INFO L93 Difference]: Finished difference Result 703 states and 1148 transitions. [2018-09-26 08:07:21,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:07:21,122 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-09-26 08:07:21,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:21,123 INFO L225 Difference]: With dead ends: 703 [2018-09-26 08:07:21,123 INFO L226 Difference]: Without dead ends: 701 [2018-09-26 08:07:21,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:07:21,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-09-26 08:07:21,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 530. [2018-09-26 08:07:21,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-09-26 08:07:21,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 879 transitions. [2018-09-26 08:07:21,476 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 879 transitions. Word has length 18 [2018-09-26 08:07:21,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:21,477 INFO L480 AbstractCegarLoop]: Abstraction has 530 states and 879 transitions. [2018-09-26 08:07:21,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:07:21,477 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 879 transitions. [2018-09-26 08:07:21,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:21,477 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:21,477 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:21,478 INFO L423 AbstractCegarLoop]: === Iteration 102 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:21,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:21,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1149501708, now seen corresponding path program 1 times [2018-09-26 08:07:21,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:21,489 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:21,489 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:21,489 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:07:21,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:07:21,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:07:21,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:07:21,490 INFO L87 Difference]: Start difference. First operand 530 states and 879 transitions. Second operand 10 states. [2018-09-26 08:07:22,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:22,036 INFO L93 Difference]: Finished difference Result 642 states and 1045 transitions. [2018-09-26 08:07:22,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:07:22,037 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-09-26 08:07:22,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:22,038 INFO L225 Difference]: With dead ends: 642 [2018-09-26 08:07:22,038 INFO L226 Difference]: Without dead ends: 640 [2018-09-26 08:07:22,038 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:07:22,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-09-26 08:07:22,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 524. [2018-09-26 08:07:22,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-09-26 08:07:22,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 869 transitions. [2018-09-26 08:07:22,388 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 869 transitions. Word has length 18 [2018-09-26 08:07:22,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:22,388 INFO L480 AbstractCegarLoop]: Abstraction has 524 states and 869 transitions. [2018-09-26 08:07:22,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:07:22,389 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 869 transitions. [2018-09-26 08:07:22,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:22,389 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:22,389 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:22,389 INFO L423 AbstractCegarLoop]: === Iteration 103 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:22,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:22,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1140912769, now seen corresponding path program 1 times [2018-09-26 08:07:22,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:22,402 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:22,402 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:22,402 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:07:22,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:07:22,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:07:22,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:07:22,403 INFO L87 Difference]: Start difference. First operand 524 states and 869 transitions. Second operand 10 states. [2018-09-26 08:07:22,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:22,913 INFO L93 Difference]: Finished difference Result 591 states and 958 transitions. [2018-09-26 08:07:22,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:07:22,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-09-26 08:07:22,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:22,914 INFO L225 Difference]: With dead ends: 591 [2018-09-26 08:07:22,914 INFO L226 Difference]: Without dead ends: 589 [2018-09-26 08:07:22,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:07:22,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-09-26 08:07:23,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 502. [2018-09-26 08:07:23,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-09-26 08:07:23,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 831 transitions. [2018-09-26 08:07:23,258 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 831 transitions. Word has length 18 [2018-09-26 08:07:23,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:23,258 INFO L480 AbstractCegarLoop]: Abstraction has 502 states and 831 transitions. [2018-09-26 08:07:23,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:07:23,258 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 831 transitions. [2018-09-26 08:07:23,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:23,258 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:23,258 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:23,259 INFO L423 AbstractCegarLoop]: === Iteration 104 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:23,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:23,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1070077282, now seen corresponding path program 1 times [2018-09-26 08:07:23,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:23,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:23,268 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:23,268 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:07:23,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:07:23,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:07:23,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:07:23,269 INFO L87 Difference]: Start difference. First operand 502 states and 831 transitions. Second operand 10 states. [2018-09-26 08:07:23,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:23,806 INFO L93 Difference]: Finished difference Result 576 states and 935 transitions. [2018-09-26 08:07:23,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:07:23,806 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-09-26 08:07:23,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:23,807 INFO L225 Difference]: With dead ends: 576 [2018-09-26 08:07:23,807 INFO L226 Difference]: Without dead ends: 574 [2018-09-26 08:07:23,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:07:23,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-09-26 08:07:24,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 490. [2018-09-26 08:07:24,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-09-26 08:07:24,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 811 transitions. [2018-09-26 08:07:24,143 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 811 transitions. Word has length 18 [2018-09-26 08:07:24,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:24,143 INFO L480 AbstractCegarLoop]: Abstraction has 490 states and 811 transitions. [2018-09-26 08:07:24,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:07:24,143 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 811 transitions. [2018-09-26 08:07:24,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:07:24,144 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:24,144 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:24,144 INFO L423 AbstractCegarLoop]: === Iteration 105 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:24,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:24,145 INFO L82 PathProgramCache]: Analyzing trace with hash -850531879, now seen corresponding path program 3 times [2018-09-26 08:07:24,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:24,160 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:24,160 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:24,161 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:07:24,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:07:24,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:07:24,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:07:24,161 INFO L87 Difference]: Start difference. First operand 490 states and 811 transitions. Second operand 14 states. [2018-09-26 08:07:24,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:24,579 INFO L93 Difference]: Finished difference Result 502 states and 819 transitions. [2018-09-26 08:07:24,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:07:24,580 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-09-26 08:07:24,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:24,580 INFO L225 Difference]: With dead ends: 502 [2018-09-26 08:07:24,580 INFO L226 Difference]: Without dead ends: 501 [2018-09-26 08:07:24,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:07:24,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-09-26 08:07:24,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 454. [2018-09-26 08:07:24,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-09-26 08:07:24,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 750 transitions. [2018-09-26 08:07:24,907 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 750 transitions. Word has length 20 [2018-09-26 08:07:24,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:24,907 INFO L480 AbstractCegarLoop]: Abstraction has 454 states and 750 transitions. [2018-09-26 08:07:24,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:07:24,907 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 750 transitions. [2018-09-26 08:07:24,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:07:24,907 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:24,907 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:24,908 INFO L423 AbstractCegarLoop]: === Iteration 106 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:24,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:24,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1707385863, now seen corresponding path program 1 times [2018-09-26 08:07:24,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:24,925 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:24,926 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:24,926 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:07:24,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:07:24,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:07:24,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:07:24,927 INFO L87 Difference]: Start difference. First operand 454 states and 750 transitions. Second operand 14 states. [2018-09-26 08:07:25,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:25,441 INFO L93 Difference]: Finished difference Result 549 states and 901 transitions. [2018-09-26 08:07:25,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:07:25,441 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-09-26 08:07:25,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:25,442 INFO L225 Difference]: With dead ends: 549 [2018-09-26 08:07:25,442 INFO L226 Difference]: Without dead ends: 548 [2018-09-26 08:07:25,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:07:25,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-09-26 08:07:25,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 465. [2018-09-26 08:07:25,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-09-26 08:07:25,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 769 transitions. [2018-09-26 08:07:25,778 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 769 transitions. Word has length 20 [2018-09-26 08:07:25,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:25,778 INFO L480 AbstractCegarLoop]: Abstraction has 465 states and 769 transitions. [2018-09-26 08:07:25,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:07:25,778 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 769 transitions. [2018-09-26 08:07:25,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:07:25,779 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:25,779 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:25,779 INFO L423 AbstractCegarLoop]: === Iteration 107 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:25,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:25,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1999268581, now seen corresponding path program 2 times [2018-09-26 08:07:25,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:25,796 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:25,797 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:25,797 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:07:25,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:07:25,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:07:25,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:07:25,797 INFO L87 Difference]: Start difference. First operand 465 states and 769 transitions. Second operand 14 states. [2018-09-26 08:07:26,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:26,267 INFO L93 Difference]: Finished difference Result 510 states and 832 transitions. [2018-09-26 08:07:26,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:07:26,267 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-09-26 08:07:26,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:26,268 INFO L225 Difference]: With dead ends: 510 [2018-09-26 08:07:26,268 INFO L226 Difference]: Without dead ends: 508 [2018-09-26 08:07:26,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:07:26,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-09-26 08:07:26,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 449. [2018-09-26 08:07:26,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-09-26 08:07:26,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 743 transitions. [2018-09-26 08:07:26,607 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 743 transitions. Word has length 20 [2018-09-26 08:07:26,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:26,608 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 743 transitions. [2018-09-26 08:07:26,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:07:26,608 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 743 transitions. [2018-09-26 08:07:26,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:07:26,608 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:26,608 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:26,609 INFO L423 AbstractCegarLoop]: === Iteration 108 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:26,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:26,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1514664426, now seen corresponding path program 1 times [2018-09-26 08:07:26,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:26,627 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:26,628 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:26,628 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:07:26,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:07:26,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:07:26,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:07:26,628 INFO L87 Difference]: Start difference. First operand 449 states and 743 transitions. Second operand 13 states. [2018-09-26 08:07:27,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:27,319 INFO L93 Difference]: Finished difference Result 529 states and 854 transitions. [2018-09-26 08:07:27,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:07:27,320 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-09-26 08:07:27,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:27,320 INFO L225 Difference]: With dead ends: 529 [2018-09-26 08:07:27,320 INFO L226 Difference]: Without dead ends: 528 [2018-09-26 08:07:27,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=297, Invalid=1343, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:07:27,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-09-26 08:07:27,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 445. [2018-09-26 08:07:27,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-09-26 08:07:27,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 737 transitions. [2018-09-26 08:07:27,661 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 737 transitions. Word has length 20 [2018-09-26 08:07:27,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:27,661 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 737 transitions. [2018-09-26 08:07:27,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:07:27,661 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 737 transitions. [2018-09-26 08:07:27,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:07:27,661 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:27,661 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:27,662 INFO L423 AbstractCegarLoop]: === Iteration 109 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:27,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:27,662 INFO L82 PathProgramCache]: Analyzing trace with hash -390222799, now seen corresponding path program 4 times [2018-09-26 08:07:27,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:27,680 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:27,680 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:27,680 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:07:27,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:07:27,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:07:27,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:07:27,681 INFO L87 Difference]: Start difference. First operand 445 states and 737 transitions. Second operand 15 states. [2018-09-26 08:07:28,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:28,293 INFO L93 Difference]: Finished difference Result 502 states and 814 transitions. [2018-09-26 08:07:28,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:07:28,293 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2018-09-26 08:07:28,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:28,294 INFO L225 Difference]: With dead ends: 502 [2018-09-26 08:07:28,294 INFO L226 Difference]: Without dead ends: 501 [2018-09-26 08:07:28,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:07:28,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-09-26 08:07:28,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 459. [2018-09-26 08:07:28,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-09-26 08:07:28,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 759 transitions. [2018-09-26 08:07:28,641 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 759 transitions. Word has length 20 [2018-09-26 08:07:28,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:28,641 INFO L480 AbstractCegarLoop]: Abstraction has 459 states and 759 transitions. [2018-09-26 08:07:28,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:07:28,641 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 759 transitions. [2018-09-26 08:07:28,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:07:28,642 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:28,642 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:28,642 INFO L423 AbstractCegarLoop]: === Iteration 110 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:28,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:28,642 INFO L82 PathProgramCache]: Analyzing trace with hash -2059824409, now seen corresponding path program 2 times [2018-09-26 08:07:28,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:28,659 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:28,660 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:28,660 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:07:28,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:07:28,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:07:28,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:07:28,660 INFO L87 Difference]: Start difference. First operand 459 states and 759 transitions. Second operand 14 states. [2018-09-26 08:07:29,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:29,179 INFO L93 Difference]: Finished difference Result 521 states and 849 transitions. [2018-09-26 08:07:29,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:07:29,179 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-09-26 08:07:29,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:29,180 INFO L225 Difference]: With dead ends: 521 [2018-09-26 08:07:29,180 INFO L226 Difference]: Without dead ends: 520 [2018-09-26 08:07:29,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:07:29,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2018-09-26 08:07:29,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 489. [2018-09-26 08:07:29,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-09-26 08:07:29,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 808 transitions. [2018-09-26 08:07:29,554 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 808 transitions. Word has length 20 [2018-09-26 08:07:29,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:29,554 INFO L480 AbstractCegarLoop]: Abstraction has 489 states and 808 transitions. [2018-09-26 08:07:29,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:07:29,554 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 808 transitions. [2018-09-26 08:07:29,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:07:29,555 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:29,555 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:29,555 INFO L423 AbstractCegarLoop]: === Iteration 111 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:29,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:29,555 INFO L82 PathProgramCache]: Analyzing trace with hash -781467557, now seen corresponding path program 1 times [2018-09-26 08:07:29,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:29,573 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:29,574 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:29,574 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:07:29,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:07:29,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:07:29,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:07:29,574 INFO L87 Difference]: Start difference. First operand 489 states and 808 transitions. Second operand 14 states. [2018-09-26 08:07:30,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:30,256 INFO L93 Difference]: Finished difference Result 578 states and 932 transitions. [2018-09-26 08:07:30,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:07:30,257 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-09-26 08:07:30,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:30,257 INFO L225 Difference]: With dead ends: 578 [2018-09-26 08:07:30,258 INFO L226 Difference]: Without dead ends: 576 [2018-09-26 08:07:30,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=224, Invalid=1258, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:07:30,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-09-26 08:07:30,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 493. [2018-09-26 08:07:30,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-09-26 08:07:30,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 815 transitions. [2018-09-26 08:07:30,635 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 815 transitions. Word has length 20 [2018-09-26 08:07:30,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:30,636 INFO L480 AbstractCegarLoop]: Abstraction has 493 states and 815 transitions. [2018-09-26 08:07:30,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:07:30,636 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 815 transitions. [2018-09-26 08:07:30,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:07:30,636 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:30,636 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:30,636 INFO L423 AbstractCegarLoop]: === Iteration 112 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:30,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:30,637 INFO L82 PathProgramCache]: Analyzing trace with hash -874261799, now seen corresponding path program 5 times [2018-09-26 08:07:30,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:30,650 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:30,650 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:30,650 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:07:30,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:07:30,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:07:30,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:07:30,651 INFO L87 Difference]: Start difference. First operand 493 states and 815 transitions. Second operand 15 states. [2018-09-26 08:07:31,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:31,318 INFO L93 Difference]: Finished difference Result 600 states and 981 transitions. [2018-09-26 08:07:31,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:07:31,318 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2018-09-26 08:07:31,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:31,319 INFO L225 Difference]: With dead ends: 600 [2018-09-26 08:07:31,319 INFO L226 Difference]: Without dead ends: 599 [2018-09-26 08:07:31,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:07:31,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-09-26 08:07:31,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 498. [2018-09-26 08:07:31,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-09-26 08:07:31,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 825 transitions. [2018-09-26 08:07:31,760 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 825 transitions. Word has length 20 [2018-09-26 08:07:31,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:31,760 INFO L480 AbstractCegarLoop]: Abstraction has 498 states and 825 transitions. [2018-09-26 08:07:31,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:07:31,760 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 825 transitions. [2018-09-26 08:07:31,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:07:31,761 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:31,761 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:31,761 INFO L423 AbstractCegarLoop]: === Iteration 113 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:31,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:31,761 INFO L82 PathProgramCache]: Analyzing trace with hash -872968933, now seen corresponding path program 2 times [2018-09-26 08:07:31,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:31,777 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:31,777 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:31,777 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:07:31,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:07:31,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:07:31,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:07:31,778 INFO L87 Difference]: Start difference. First operand 498 states and 825 transitions. Second operand 14 states. [2018-09-26 08:07:32,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:32,671 INFO L93 Difference]: Finished difference Result 829 states and 1342 transitions. [2018-09-26 08:07:32,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:07:32,672 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-09-26 08:07:32,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:32,673 INFO L225 Difference]: With dead ends: 829 [2018-09-26 08:07:32,673 INFO L226 Difference]: Without dead ends: 827 [2018-09-26 08:07:32,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=275, Invalid=1705, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:07:32,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2018-09-26 08:07:33,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 612. [2018-09-26 08:07:33,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-09-26 08:07:33,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1017 transitions. [2018-09-26 08:07:33,110 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1017 transitions. Word has length 20 [2018-09-26 08:07:33,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:33,110 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 1017 transitions. [2018-09-26 08:07:33,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:07:33,110 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1017 transitions. [2018-09-26 08:07:33,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:07:33,111 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:33,111 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:33,111 INFO L423 AbstractCegarLoop]: === Iteration 114 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:33,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:33,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1388091879, now seen corresponding path program 1 times [2018-09-26 08:07:33,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:33,137 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:33,137 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:33,137 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:07:33,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:07:33,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:07:33,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:07:33,138 INFO L87 Difference]: Start difference. First operand 612 states and 1017 transitions. Second operand 13 states. [2018-09-26 08:07:34,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:34,228 INFO L93 Difference]: Finished difference Result 696 states and 1138 transitions. [2018-09-26 08:07:34,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:07:34,228 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-09-26 08:07:34,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:34,229 INFO L225 Difference]: With dead ends: 696 [2018-09-26 08:07:34,229 INFO L226 Difference]: Without dead ends: 694 [2018-09-26 08:07:34,230 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=194, Invalid=928, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:07:34,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2018-09-26 08:07:34,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 643. [2018-09-26 08:07:34,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2018-09-26 08:07:34,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1068 transitions. [2018-09-26 08:07:34,721 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1068 transitions. Word has length 20 [2018-09-26 08:07:34,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:34,722 INFO L480 AbstractCegarLoop]: Abstraction has 643 states and 1068 transitions. [2018-09-26 08:07:34,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:07:34,722 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1068 transitions. [2018-09-26 08:07:34,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:07:34,722 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:34,722 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:34,723 INFO L423 AbstractCegarLoop]: === Iteration 115 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:34,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:34,723 INFO L82 PathProgramCache]: Analyzing trace with hash 149319872, now seen corresponding path program 3 times [2018-09-26 08:07:34,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:34,729 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:34,730 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:34,730 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:34,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:07:34,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:07:34,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:07:34,731 INFO L87 Difference]: Start difference. First operand 643 states and 1068 transitions. Second operand 7 states. [2018-09-26 08:07:35,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:35,889 INFO L93 Difference]: Finished difference Result 2025 states and 3340 transitions. [2018-09-26 08:07:35,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:07:35,889 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-09-26 08:07:35,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:35,891 INFO L225 Difference]: With dead ends: 2025 [2018-09-26 08:07:35,891 INFO L226 Difference]: Without dead ends: 1397 [2018-09-26 08:07:35,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:07:35,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2018-09-26 08:07:36,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 1239. [2018-09-26 08:07:36,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2018-09-26 08:07:36,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 2029 transitions. [2018-09-26 08:07:36,830 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 2029 transitions. Word has length 20 [2018-09-26 08:07:36,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:36,830 INFO L480 AbstractCegarLoop]: Abstraction has 1239 states and 2029 transitions. [2018-09-26 08:07:36,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:07:36,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 2029 transitions. [2018-09-26 08:07:36,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:07:36,831 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:36,831 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:36,832 INFO L423 AbstractCegarLoop]: === Iteration 116 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:36,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:36,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1603097883, now seen corresponding path program 1 times [2018-09-26 08:07:36,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:36,854 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:36,854 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:36,854 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:07:36,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:07:36,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:07:36,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:07:36,855 INFO L87 Difference]: Start difference. First operand 1239 states and 2029 transitions. Second operand 13 states. [2018-09-26 08:07:38,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:38,097 INFO L93 Difference]: Finished difference Result 1356 states and 2197 transitions. [2018-09-26 08:07:38,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:07:38,097 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-09-26 08:07:38,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:38,099 INFO L225 Difference]: With dead ends: 1356 [2018-09-26 08:07:38,099 INFO L226 Difference]: Without dead ends: 1354 [2018-09-26 08:07:38,099 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=215, Invalid=1117, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:07:38,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-09-26 08:07:39,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1251. [2018-09-26 08:07:39,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1251 states. [2018-09-26 08:07:39,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 2049 transitions. [2018-09-26 08:07:39,054 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 2049 transitions. Word has length 20 [2018-09-26 08:07:39,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:39,054 INFO L480 AbstractCegarLoop]: Abstraction has 1251 states and 2049 transitions. [2018-09-26 08:07:39,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:07:39,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 2049 transitions. [2018-09-26 08:07:39,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:07:39,056 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:39,056 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:39,056 INFO L423 AbstractCegarLoop]: === Iteration 117 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:39,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:39,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1503357634, now seen corresponding path program 2 times [2018-09-26 08:07:39,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:39,105 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:39,106 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:39,106 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:07:39,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:07:39,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:07:39,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:07:39,106 INFO L87 Difference]: Start difference. First operand 1251 states and 2049 transitions. Second operand 13 states. [2018-09-26 08:07:40,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:40,344 INFO L93 Difference]: Finished difference Result 1410 states and 2292 transitions. [2018-09-26 08:07:40,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:07:40,344 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-09-26 08:07:40,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:40,346 INFO L225 Difference]: With dead ends: 1410 [2018-09-26 08:07:40,346 INFO L226 Difference]: Without dead ends: 1408 [2018-09-26 08:07:40,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:07:40,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2018-09-26 08:07:41,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1272. [2018-09-26 08:07:41,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2018-09-26 08:07:41,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 2080 transitions. [2018-09-26 08:07:41,346 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 2080 transitions. Word has length 20 [2018-09-26 08:07:41,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:41,346 INFO L480 AbstractCegarLoop]: Abstraction has 1272 states and 2080 transitions. [2018-09-26 08:07:41,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:07:41,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 2080 transitions. [2018-09-26 08:07:41,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:07:41,347 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:41,347 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:41,347 INFO L423 AbstractCegarLoop]: === Iteration 118 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:41,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:41,347 INFO L82 PathProgramCache]: Analyzing trace with hash 418443550, now seen corresponding path program 1 times [2018-09-26 08:07:41,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:41,360 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:41,360 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:41,360 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:07:41,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:07:41,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:07:41,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:07:41,361 INFO L87 Difference]: Start difference. First operand 1272 states and 2080 transitions. Second operand 13 states. [2018-09-26 08:07:42,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:42,485 INFO L93 Difference]: Finished difference Result 1365 states and 2218 transitions. [2018-09-26 08:07:42,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:07:42,486 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-09-26 08:07:42,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:42,487 INFO L225 Difference]: With dead ends: 1365 [2018-09-26 08:07:42,487 INFO L226 Difference]: Without dead ends: 1364 [2018-09-26 08:07:42,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:07:42,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2018-09-26 08:07:43,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1342. [2018-09-26 08:07:43,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2018-09-26 08:07:43,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 2190 transitions. [2018-09-26 08:07:43,607 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 2190 transitions. Word has length 20 [2018-09-26 08:07:43,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:43,607 INFO L480 AbstractCegarLoop]: Abstraction has 1342 states and 2190 transitions. [2018-09-26 08:07:43,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:07:43,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 2190 transitions. [2018-09-26 08:07:43,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:07:43,608 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:43,608 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:43,609 INFO L423 AbstractCegarLoop]: === Iteration 119 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:43,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:43,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1962310520, now seen corresponding path program 4 times [2018-09-26 08:07:43,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:43,617 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:07:43,617 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:43,617 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:43,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:07:43,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:07:43,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:07:43,618 INFO L87 Difference]: Start difference. First operand 1342 states and 2190 transitions. Second operand 7 states. [2018-09-26 08:07:45,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:45,118 INFO L93 Difference]: Finished difference Result 2545 states and 4127 transitions. [2018-09-26 08:07:45,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:07:45,118 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-09-26 08:07:45,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:45,120 INFO L225 Difference]: With dead ends: 2545 [2018-09-26 08:07:45,120 INFO L226 Difference]: Without dead ends: 1760 [2018-09-26 08:07:45,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:07:45,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2018-09-26 08:07:46,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1331. [2018-09-26 08:07:46,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-09-26 08:07:46,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2166 transitions. [2018-09-26 08:07:46,201 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2166 transitions. Word has length 20 [2018-09-26 08:07:46,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:46,201 INFO L480 AbstractCegarLoop]: Abstraction has 1331 states and 2166 transitions. [2018-09-26 08:07:46,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:07:46,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2166 transitions. [2018-09-26 08:07:46,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:07:46,202 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:46,202 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:46,202 INFO L423 AbstractCegarLoop]: === Iteration 120 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:46,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:46,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1797340462, now seen corresponding path program 1 times [2018-09-26 08:07:46,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:46,214 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:46,215 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:46,215 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:07:46,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:07:46,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:07:46,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:07:46,215 INFO L87 Difference]: Start difference. First operand 1331 states and 2166 transitions. Second operand 12 states. [2018-09-26 08:07:47,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:47,819 INFO L93 Difference]: Finished difference Result 1610 states and 2608 transitions. [2018-09-26 08:07:47,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:07:47,819 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-09-26 08:07:47,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:47,820 INFO L225 Difference]: With dead ends: 1610 [2018-09-26 08:07:47,820 INFO L226 Difference]: Without dead ends: 1608 [2018-09-26 08:07:47,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:07:47,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2018-09-26 08:07:49,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1436. [2018-09-26 08:07:49,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1436 states. [2018-09-26 08:07:49,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2341 transitions. [2018-09-26 08:07:49,033 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 2341 transitions. Word has length 20 [2018-09-26 08:07:49,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:49,033 INFO L480 AbstractCegarLoop]: Abstraction has 1436 states and 2341 transitions. [2018-09-26 08:07:49,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:07:49,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 2341 transitions. [2018-09-26 08:07:49,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:07:49,034 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:49,034 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:49,034 INFO L423 AbstractCegarLoop]: === Iteration 121 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:49,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:49,034 INFO L82 PathProgramCache]: Analyzing trace with hash -70738496, now seen corresponding path program 5 times [2018-09-26 08:07:49,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:49,043 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:07:49,043 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:49,044 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:49,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:07:49,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:07:49,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:07:49,044 INFO L87 Difference]: Start difference. First operand 1436 states and 2341 transitions. Second operand 7 states. [2018-09-26 08:07:50,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:50,618 INFO L93 Difference]: Finished difference Result 2745 states and 4471 transitions. [2018-09-26 08:07:50,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:07:50,618 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-09-26 08:07:50,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:50,621 INFO L225 Difference]: With dead ends: 2745 [2018-09-26 08:07:50,621 INFO L226 Difference]: Without dead ends: 1823 [2018-09-26 08:07:50,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:07:50,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2018-09-26 08:07:52,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1657. [2018-09-26 08:07:52,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1657 states. [2018-09-26 08:07:52,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2701 transitions. [2018-09-26 08:07:52,036 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2701 transitions. Word has length 20 [2018-09-26 08:07:52,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:52,036 INFO L480 AbstractCegarLoop]: Abstraction has 1657 states and 2701 transitions. [2018-09-26 08:07:52,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:07:52,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2701 transitions. [2018-09-26 08:07:52,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:07:52,037 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:52,037 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:52,037 INFO L423 AbstractCegarLoop]: === Iteration 122 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:52,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:52,038 INFO L82 PathProgramCache]: Analyzing trace with hash -70737726, now seen corresponding path program 2 times [2018-09-26 08:07:52,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:52,050 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:52,051 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:52,051 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:07:52,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:07:52,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:07:52,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:07:52,052 INFO L87 Difference]: Start difference. First operand 1657 states and 2701 transitions. Second operand 12 states. [2018-09-26 08:07:53,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:53,837 INFO L93 Difference]: Finished difference Result 1815 states and 2934 transitions. [2018-09-26 08:07:53,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:07:53,838 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-09-26 08:07:53,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:53,840 INFO L225 Difference]: With dead ends: 1815 [2018-09-26 08:07:53,840 INFO L226 Difference]: Without dead ends: 1813 [2018-09-26 08:07:53,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:07:53,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2018-09-26 08:07:55,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1651. [2018-09-26 08:07:55,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1651 states. [2018-09-26 08:07:55,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2690 transitions. [2018-09-26 08:07:55,192 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2690 transitions. Word has length 20 [2018-09-26 08:07:55,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:55,192 INFO L480 AbstractCegarLoop]: Abstraction has 1651 states and 2690 transitions. [2018-09-26 08:07:55,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:07:55,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2690 transitions. [2018-09-26 08:07:55,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:07:55,193 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:55,193 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:55,193 INFO L423 AbstractCegarLoop]: === Iteration 123 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:55,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:55,193 INFO L82 PathProgramCache]: Analyzing trace with hash 56099968, now seen corresponding path program 1 times [2018-09-26 08:07:55,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:55,215 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:55,216 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:55,216 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:07:55,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:07:55,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:07:55,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:07:55,217 INFO L87 Difference]: Start difference. First operand 1651 states and 2690 transitions. Second operand 13 states. [2018-09-26 08:07:56,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:56,937 INFO L93 Difference]: Finished difference Result 1804 states and 2922 transitions. [2018-09-26 08:07:56,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:07:56,937 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-09-26 08:07:56,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:56,939 INFO L225 Difference]: With dead ends: 1804 [2018-09-26 08:07:56,939 INFO L226 Difference]: Without dead ends: 1802 [2018-09-26 08:07:56,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=183, Invalid=1077, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:07:56,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2018-09-26 08:07:58,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1635. [2018-09-26 08:07:58,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1635 states. [2018-09-26 08:07:58,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2664 transitions. [2018-09-26 08:07:58,267 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2664 transitions. Word has length 20 [2018-09-26 08:07:58,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:58,268 INFO L480 AbstractCegarLoop]: Abstraction has 1635 states and 2664 transitions. [2018-09-26 08:07:58,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:07:58,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2664 transitions. [2018-09-26 08:07:58,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:07:58,269 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:58,269 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:58,269 INFO L423 AbstractCegarLoop]: === Iteration 124 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:58,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:58,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1028814116, now seen corresponding path program 1 times [2018-09-26 08:07:58,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:58,286 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:58,286 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:58,287 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:07:58,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:07:58,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:07:58,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:07:58,287 INFO L87 Difference]: Start difference. First operand 1635 states and 2664 transitions. Second operand 13 states. [2018-09-26 08:08:00,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:00,156 INFO L93 Difference]: Finished difference Result 1702 states and 2762 transitions. [2018-09-26 08:08:00,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:08:00,156 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-09-26 08:08:00,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:00,158 INFO L225 Difference]: With dead ends: 1702 [2018-09-26 08:08:00,159 INFO L226 Difference]: Without dead ends: 1701 [2018-09-26 08:08:00,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:08:00,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2018-09-26 08:08:01,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1631. [2018-09-26 08:08:01,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1631 states. [2018-09-26 08:08:01,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2657 transitions. [2018-09-26 08:08:01,512 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2657 transitions. Word has length 20 [2018-09-26 08:08:01,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:01,512 INFO L480 AbstractCegarLoop]: Abstraction has 1631 states and 2657 transitions. [2018-09-26 08:08:01,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:08:01,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2657 transitions. [2018-09-26 08:08:01,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:08:01,513 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:01,514 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:01,514 INFO L423 AbstractCegarLoop]: === Iteration 125 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:01,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:01,514 INFO L82 PathProgramCache]: Analyzing trace with hash 294164016, now seen corresponding path program 1 times [2018-09-26 08:08:01,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:01,528 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:01,528 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:01,528 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:08:01,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:08:01,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:08:01,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:08:01,529 INFO L87 Difference]: Start difference. First operand 1631 states and 2657 transitions. Second operand 12 states. [2018-09-26 08:08:03,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:03,303 INFO L93 Difference]: Finished difference Result 1884 states and 3067 transitions. [2018-09-26 08:08:03,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:08:03,303 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-09-26 08:08:03,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:03,305 INFO L225 Difference]: With dead ends: 1884 [2018-09-26 08:08:03,305 INFO L226 Difference]: Without dead ends: 1883 [2018-09-26 08:08:03,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:08:03,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2018-09-26 08:08:04,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1605. [2018-09-26 08:08:04,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1605 states. [2018-09-26 08:08:04,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 2615 transitions. [2018-09-26 08:08:04,663 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 2615 transitions. Word has length 20 [2018-09-26 08:08:04,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:04,663 INFO L480 AbstractCegarLoop]: Abstraction has 1605 states and 2615 transitions. [2018-09-26 08:08:04,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:08:04,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 2615 transitions. [2018-09-26 08:08:04,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:08:04,664 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:04,664 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:04,665 INFO L423 AbstractCegarLoop]: === Iteration 126 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:04,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:04,665 INFO L82 PathProgramCache]: Analyzing trace with hash -503083984, now seen corresponding path program 1 times [2018-09-26 08:08:04,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:04,677 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:04,678 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:04,678 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:08:04,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:08:04,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:08:04,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:08:04,679 INFO L87 Difference]: Start difference. First operand 1605 states and 2615 transitions. Second operand 14 states. [2018-09-26 08:08:06,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:06,330 INFO L93 Difference]: Finished difference Result 1872 states and 3057 transitions. [2018-09-26 08:08:06,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:08:06,330 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-09-26 08:08:06,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:06,332 INFO L225 Difference]: With dead ends: 1872 [2018-09-26 08:08:06,333 INFO L226 Difference]: Without dead ends: 1871 [2018-09-26 08:08:06,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:08:06,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2018-09-26 08:08:07,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1694. [2018-09-26 08:08:07,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1694 states. [2018-09-26 08:08:07,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2762 transitions. [2018-09-26 08:08:07,734 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 2762 transitions. Word has length 20 [2018-09-26 08:08:07,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:07,734 INFO L480 AbstractCegarLoop]: Abstraction has 1694 states and 2762 transitions. [2018-09-26 08:08:07,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:08:07,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2762 transitions. [2018-09-26 08:08:07,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:08:07,735 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:07,735 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:07,735 INFO L423 AbstractCegarLoop]: === Iteration 127 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:07,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:07,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1843127659, now seen corresponding path program 1 times [2018-09-26 08:08:07,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:07,749 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:07,749 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:07,749 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:08:07,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:08:07,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:08:07,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:08:07,750 INFO L87 Difference]: Start difference. First operand 1694 states and 2762 transitions. Second operand 12 states. [2018-09-26 08:08:09,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:09,446 INFO L93 Difference]: Finished difference Result 1818 states and 2952 transitions. [2018-09-26 08:08:09,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:08:09,447 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-09-26 08:08:09,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:09,449 INFO L225 Difference]: With dead ends: 1818 [2018-09-26 08:08:09,449 INFO L226 Difference]: Without dead ends: 1816 [2018-09-26 08:08:09,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:08:09,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2018-09-26 08:08:10,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1702. [2018-09-26 08:08:10,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2018-09-26 08:08:10,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2774 transitions. [2018-09-26 08:08:10,865 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2774 transitions. Word has length 21 [2018-09-26 08:08:10,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:10,866 INFO L480 AbstractCegarLoop]: Abstraction has 1702 states and 2774 transitions. [2018-09-26 08:08:10,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:08:10,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2774 transitions. [2018-09-26 08:08:10,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:08:10,867 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:10,867 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:10,867 INFO L423 AbstractCegarLoop]: === Iteration 128 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:10,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:10,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1652448723, now seen corresponding path program 1 times [2018-09-26 08:08:10,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:10,882 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,883 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:10,883 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:08:10,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:08:10,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:08:10,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:08:10,884 INFO L87 Difference]: Start difference. First operand 1702 states and 2774 transitions. Second operand 12 states. [2018-09-26 08:08:12,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:12,586 INFO L93 Difference]: Finished difference Result 1906 states and 3103 transitions. [2018-09-26 08:08:12,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:08:12,587 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-09-26 08:08:12,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:12,589 INFO L225 Difference]: With dead ends: 1906 [2018-09-26 08:08:12,589 INFO L226 Difference]: Without dead ends: 1904 [2018-09-26 08:08:12,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:08:12,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2018-09-26 08:08:14,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1715. [2018-09-26 08:08:14,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2018-09-26 08:08:14,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2795 transitions. [2018-09-26 08:08:14,050 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2795 transitions. Word has length 21 [2018-09-26 08:08:14,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:14,050 INFO L480 AbstractCegarLoop]: Abstraction has 1715 states and 2795 transitions. [2018-09-26 08:08:14,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:08:14,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2795 transitions. [2018-09-26 08:08:14,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:08:14,052 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:14,052 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:14,052 INFO L423 AbstractCegarLoop]: === Iteration 129 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:14,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:14,053 INFO L82 PathProgramCache]: Analyzing trace with hash -858694805, now seen corresponding path program 1 times [2018-09-26 08:08:14,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:14,062 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:14,063 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:14,063 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:08:14,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:08:14,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:08:14,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:08:14,064 INFO L87 Difference]: Start difference. First operand 1715 states and 2795 transitions. Second operand 12 states. [2018-09-26 08:08:15,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:15,888 INFO L93 Difference]: Finished difference Result 1953 states and 3181 transitions. [2018-09-26 08:08:15,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:08:15,888 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-09-26 08:08:15,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:15,890 INFO L225 Difference]: With dead ends: 1953 [2018-09-26 08:08:15,890 INFO L226 Difference]: Without dead ends: 1951 [2018-09-26 08:08:15,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=221, Invalid=901, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:08:15,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2018-09-26 08:08:17,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1700. [2018-09-26 08:08:17,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1700 states. [2018-09-26 08:08:17,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2771 transitions. [2018-09-26 08:08:17,347 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2771 transitions. Word has length 21 [2018-09-26 08:08:17,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:17,347 INFO L480 AbstractCegarLoop]: Abstraction has 1700 states and 2771 transitions. [2018-09-26 08:08:17,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:08:17,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2771 transitions. [2018-09-26 08:08:17,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:08:17,348 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:17,349 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 08:08:17,349 INFO L423 AbstractCegarLoop]: === Iteration 130 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:17,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:17,349 INFO L82 PathProgramCache]: Analyzing trace with hash -119563298, now seen corresponding path program 3 times [2018-09-26 08:08:17,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:17,373 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:17,374 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:17,374 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:08:17,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:08:17,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:08:17,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:08:17,375 INFO L87 Difference]: Start difference. First operand 1700 states and 2771 transitions. Second operand 16 states. [2018-09-26 08:08:19,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:19,028 INFO L93 Difference]: Finished difference Result 1765 states and 2860 transitions. [2018-09-26 08:08:19,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:08:19,028 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-09-26 08:08:19,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:19,030 INFO L225 Difference]: With dead ends: 1765 [2018-09-26 08:08:19,030 INFO L226 Difference]: Without dead ends: 1764 [2018-09-26 08:08:19,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=216, Invalid=974, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:08:19,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2018-09-26 08:08:20,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1611. [2018-09-26 08:08:20,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2018-09-26 08:08:20,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2624 transitions. [2018-09-26 08:08:20,435 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2624 transitions. Word has length 22 [2018-09-26 08:08:20,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:20,435 INFO L480 AbstractCegarLoop]: Abstraction has 1611 states and 2624 transitions. [2018-09-26 08:08:20,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:08:20,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2624 transitions. [2018-09-26 08:08:20,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:08:20,436 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:20,436 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 08:08:20,436 INFO L423 AbstractCegarLoop]: === Iteration 131 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:20,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:20,436 INFO L82 PathProgramCache]: Analyzing trace with hash 489410380, now seen corresponding path program 4 times [2018-09-26 08:08:20,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:20,456 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:20,456 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:20,457 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:08:20,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:08:20,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:08:20,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:08:20,457 INFO L87 Difference]: Start difference. First operand 1611 states and 2624 transitions. Second operand 16 states. [2018-09-26 08:08:22,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:22,211 INFO L93 Difference]: Finished difference Result 1706 states and 2757 transitions. [2018-09-26 08:08:22,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:08:22,211 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-09-26 08:08:22,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:22,213 INFO L225 Difference]: With dead ends: 1706 [2018-09-26 08:08:22,213 INFO L226 Difference]: Without dead ends: 1705 [2018-09-26 08:08:22,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=323, Invalid=1839, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:08:22,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2018-09-26 08:08:23,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1607. [2018-09-26 08:08:23,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2018-09-26 08:08:23,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 2615 transitions. [2018-09-26 08:08:23,645 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 2615 transitions. Word has length 22 [2018-09-26 08:08:23,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:23,645 INFO L480 AbstractCegarLoop]: Abstraction has 1607 states and 2615 transitions. [2018-09-26 08:08:23,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:08:23,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 2615 transitions. [2018-09-26 08:08:23,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:08:23,646 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:23,646 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:23,646 INFO L423 AbstractCegarLoop]: === Iteration 132 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:23,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:23,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1161738932, now seen corresponding path program 2 times [2018-09-26 08:08:23,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:23,670 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:23,670 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:23,670 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:08:23,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:08:23,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:08:23,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:08:23,671 INFO L87 Difference]: Start difference. First operand 1607 states and 2615 transitions. Second operand 15 states. [2018-09-26 08:08:25,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:25,686 INFO L93 Difference]: Finished difference Result 1768 states and 2871 transitions. [2018-09-26 08:08:25,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:08:25,686 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-09-26 08:08:25,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:25,688 INFO L225 Difference]: With dead ends: 1768 [2018-09-26 08:08:25,688 INFO L226 Difference]: Without dead ends: 1767 [2018-09-26 08:08:25,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:08:25,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2018-09-26 08:08:27,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1649. [2018-09-26 08:08:27,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2018-09-26 08:08:27,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2685 transitions. [2018-09-26 08:08:27,156 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2685 transitions. Word has length 22 [2018-09-26 08:08:27,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:27,157 INFO L480 AbstractCegarLoop]: Abstraction has 1649 states and 2685 transitions. [2018-09-26 08:08:27,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:08:27,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2685 transitions. [2018-09-26 08:08:27,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:08:27,158 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:27,158 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 08:08:27,158 INFO L423 AbstractCegarLoop]: === Iteration 133 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:27,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:27,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1611878626, now seen corresponding path program 5 times [2018-09-26 08:08:27,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:27,178 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:27,178 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:27,178 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:08:27,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:08:27,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:08:27,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:08:27,179 INFO L87 Difference]: Start difference. First operand 1649 states and 2685 transitions. Second operand 16 states. [2018-09-26 08:08:29,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:29,350 INFO L93 Difference]: Finished difference Result 1995 states and 3219 transitions. [2018-09-26 08:08:29,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:08:29,351 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-09-26 08:08:29,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:29,353 INFO L225 Difference]: With dead ends: 1995 [2018-09-26 08:08:29,353 INFO L226 Difference]: Without dead ends: 1994 [2018-09-26 08:08:29,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=347, Invalid=2203, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:08:29,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2018-09-26 08:08:30,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1676. [2018-09-26 08:08:30,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1676 states. [2018-09-26 08:08:30,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 2732 transitions. [2018-09-26 08:08:30,852 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 2732 transitions. Word has length 22 [2018-09-26 08:08:30,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:30,852 INFO L480 AbstractCegarLoop]: Abstraction has 1676 states and 2732 transitions. [2018-09-26 08:08:30,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:08:30,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2732 transitions. [2018-09-26 08:08:30,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:08:30,853 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:30,853 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:30,854 INFO L423 AbstractCegarLoop]: === Iteration 134 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:30,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:30,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1825100773, now seen corresponding path program 1 times [2018-09-26 08:08:30,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:30,875 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:30,876 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:30,876 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:08:30,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:08:30,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:08:30,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:08:30,876 INFO L87 Difference]: Start difference. First operand 1676 states and 2732 transitions. Second operand 15 states. [2018-09-26 08:08:32,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:32,771 INFO L93 Difference]: Finished difference Result 1916 states and 3112 transitions. [2018-09-26 08:08:32,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:08:32,771 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-09-26 08:08:32,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:32,773 INFO L225 Difference]: With dead ends: 1916 [2018-09-26 08:08:32,773 INFO L226 Difference]: Without dead ends: 1914 [2018-09-26 08:08:32,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=214, Invalid=1192, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:08:32,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2018-09-26 08:08:34,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1767. [2018-09-26 08:08:34,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2018-09-26 08:08:34,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2876 transitions. [2018-09-26 08:08:34,410 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2876 transitions. Word has length 22 [2018-09-26 08:08:34,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:34,410 INFO L480 AbstractCegarLoop]: Abstraction has 1767 states and 2876 transitions. [2018-09-26 08:08:34,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:08:34,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2876 transitions. [2018-09-26 08:08:34,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:08:34,411 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:34,411 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:34,411 INFO L423 AbstractCegarLoop]: === Iteration 135 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:34,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:34,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1601377053, now seen corresponding path program 1 times [2018-09-26 08:08:34,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:34,430 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:34,430 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:34,430 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:08:34,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:08:34,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:08:34,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:08:34,431 INFO L87 Difference]: Start difference. First operand 1767 states and 2876 transitions. Second operand 14 states. [2018-09-26 08:08:36,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:36,129 INFO L93 Difference]: Finished difference Result 1874 states and 3046 transitions. [2018-09-26 08:08:36,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:08:36,129 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-09-26 08:08:36,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:36,131 INFO L225 Difference]: With dead ends: 1874 [2018-09-26 08:08:36,131 INFO L226 Difference]: Without dead ends: 1873 [2018-09-26 08:08:36,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:08:36,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2018-09-26 08:08:37,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1763. [2018-09-26 08:08:37,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1763 states. [2018-09-26 08:08:37,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2871 transitions. [2018-09-26 08:08:37,739 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2871 transitions. Word has length 22 [2018-09-26 08:08:37,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:37,740 INFO L480 AbstractCegarLoop]: Abstraction has 1763 states and 2871 transitions. [2018-09-26 08:08:37,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:08:37,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2871 transitions. [2018-09-26 08:08:37,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:08:37,741 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:37,741 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:37,741 INFO L423 AbstractCegarLoop]: === Iteration 136 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:37,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:37,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1715079645, now seen corresponding path program 1 times [2018-09-26 08:08:37,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:37,759 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:37,760 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:37,760 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:08:37,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:08:37,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:08:37,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:08:37,760 INFO L87 Difference]: Start difference. First operand 1763 states and 2871 transitions. Second operand 15 states. [2018-09-26 08:08:39,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:39,778 INFO L93 Difference]: Finished difference Result 1970 states and 3194 transitions. [2018-09-26 08:08:39,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:08:39,778 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-09-26 08:08:39,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:39,780 INFO L225 Difference]: With dead ends: 1970 [2018-09-26 08:08:39,780 INFO L226 Difference]: Without dead ends: 1968 [2018-09-26 08:08:39,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=221, Invalid=1261, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:08:39,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2018-09-26 08:08:41,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1712. [2018-09-26 08:08:41,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1712 states. [2018-09-26 08:08:41,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2788 transitions. [2018-09-26 08:08:41,341 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2788 transitions. Word has length 22 [2018-09-26 08:08:41,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:41,341 INFO L480 AbstractCegarLoop]: Abstraction has 1712 states and 2788 transitions. [2018-09-26 08:08:41,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:08:41,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2788 transitions. [2018-09-26 08:08:41,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:08:41,342 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:41,342 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 08:08:41,342 INFO L423 AbstractCegarLoop]: === Iteration 137 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:41,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:41,342 INFO L82 PathProgramCache]: Analyzing trace with hash -846590175, now seen corresponding path program 3 times [2018-09-26 08:08:41,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:41,355 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:41,355 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:41,355 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:08:41,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:08:41,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:08:41,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:08:41,356 INFO L87 Difference]: Start difference. First operand 1712 states and 2788 transitions. Second operand 14 states. [2018-09-26 08:08:43,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:43,150 INFO L93 Difference]: Finished difference Result 1872 states and 3041 transitions. [2018-09-26 08:08:43,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:08:43,151 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-09-26 08:08:43,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:43,153 INFO L225 Difference]: With dead ends: 1872 [2018-09-26 08:08:43,153 INFO L226 Difference]: Without dead ends: 1871 [2018-09-26 08:08:43,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:08:43,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2018-09-26 08:08:44,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1656. [2018-09-26 08:08:44,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1656 states. [2018-09-26 08:08:44,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2697 transitions. [2018-09-26 08:08:44,671 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2697 transitions. Word has length 22 [2018-09-26 08:08:44,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:44,671 INFO L480 AbstractCegarLoop]: Abstraction has 1656 states and 2697 transitions. [2018-09-26 08:08:44,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:08:44,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2697 transitions. [2018-09-26 08:08:44,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:08:44,672 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:44,672 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:44,672 INFO L423 AbstractCegarLoop]: === Iteration 138 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:44,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:44,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1868893045, now seen corresponding path program 2 times [2018-09-26 08:08:44,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:44,691 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:44,691 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:44,692 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:08:44,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:08:44,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:08:44,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:08:44,692 INFO L87 Difference]: Start difference. First operand 1656 states and 2697 transitions. Second operand 15 states. [2018-09-26 08:08:46,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:46,429 INFO L93 Difference]: Finished difference Result 1826 states and 2973 transitions. [2018-09-26 08:08:46,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:08:46,429 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-09-26 08:08:46,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:46,431 INFO L225 Difference]: With dead ends: 1826 [2018-09-26 08:08:46,431 INFO L226 Difference]: Without dead ends: 1825 [2018-09-26 08:08:46,432 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:08:46,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2018-09-26 08:08:47,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1527. [2018-09-26 08:08:47,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2018-09-26 08:08:47,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2487 transitions. [2018-09-26 08:08:47,818 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2487 transitions. Word has length 22 [2018-09-26 08:08:47,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:47,818 INFO L480 AbstractCegarLoop]: Abstraction has 1527 states and 2487 transitions. [2018-09-26 08:08:47,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:08:47,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2487 transitions. [2018-09-26 08:08:47,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:08:47,819 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:47,819 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:47,819 INFO L423 AbstractCegarLoop]: === Iteration 139 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:47,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:47,820 INFO L82 PathProgramCache]: Analyzing trace with hash 441602332, now seen corresponding path program 1 times [2018-09-26 08:08:47,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:47,833 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:47,833 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:47,833 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:08:47,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:08:47,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:08:47,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:08:47,834 INFO L87 Difference]: Start difference. First operand 1527 states and 2487 transitions. Second operand 14 states. [2018-09-26 08:08:49,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:49,475 INFO L93 Difference]: Finished difference Result 1634 states and 2653 transitions. [2018-09-26 08:08:49,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:08:49,475 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-09-26 08:08:49,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:49,477 INFO L225 Difference]: With dead ends: 1634 [2018-09-26 08:08:49,477 INFO L226 Difference]: Without dead ends: 1633 [2018-09-26 08:08:49,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:08:49,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2018-09-26 08:08:50,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1575. [2018-09-26 08:08:50,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2018-09-26 08:08:50,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2566 transitions. [2018-09-26 08:08:50,947 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2566 transitions. Word has length 23 [2018-09-26 08:08:50,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:50,947 INFO L480 AbstractCegarLoop]: Abstraction has 1575 states and 2566 transitions. [2018-09-26 08:08:50,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:08:50,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2566 transitions. [2018-09-26 08:08:50,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:08:50,948 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:50,948 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:50,948 INFO L423 AbstractCegarLoop]: === Iteration 140 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:50,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:50,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1719959184, now seen corresponding path program 1 times [2018-09-26 08:08:50,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:50,964 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:50,964 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:50,964 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:08:50,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:08:50,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:08:50,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:08:50,965 INFO L87 Difference]: Start difference. First operand 1575 states and 2566 transitions. Second operand 14 states. [2018-09-26 08:08:52,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:52,743 INFO L93 Difference]: Finished difference Result 1685 states and 2725 transitions. [2018-09-26 08:08:52,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:08:52,743 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-09-26 08:08:52,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:52,744 INFO L225 Difference]: With dead ends: 1685 [2018-09-26 08:08:52,744 INFO L226 Difference]: Without dead ends: 1683 [2018-09-26 08:08:52,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=287, Invalid=1119, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:08:52,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2018-09-26 08:08:54,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1575. [2018-09-26 08:08:54,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2018-09-26 08:08:54,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2566 transitions. [2018-09-26 08:08:54,190 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2566 transitions. Word has length 23 [2018-09-26 08:08:54,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:54,190 INFO L480 AbstractCegarLoop]: Abstraction has 1575 states and 2566 transitions. [2018-09-26 08:08:54,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:08:54,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2566 transitions. [2018-09-26 08:08:54,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:08:54,191 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:54,191 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:54,191 INFO L423 AbstractCegarLoop]: === Iteration 141 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:54,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:54,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1628457808, now seen corresponding path program 2 times [2018-09-26 08:08:54,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:54,205 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:54,205 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:54,205 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:08:54,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:08:54,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:08:54,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:08:54,206 INFO L87 Difference]: Start difference. First operand 1575 states and 2566 transitions. Second operand 14 states. [2018-09-26 08:08:56,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:56,297 INFO L93 Difference]: Finished difference Result 2088 states and 3396 transitions. [2018-09-26 08:08:56,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:08:56,298 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-09-26 08:08:56,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:56,300 INFO L225 Difference]: With dead ends: 2088 [2018-09-26 08:08:56,300 INFO L226 Difference]: Without dead ends: 2086 [2018-09-26 08:08:56,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=399, Invalid=2151, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:08:56,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2018-09-26 08:08:57,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 1710. [2018-09-26 08:08:57,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2018-09-26 08:08:57,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2793 transitions. [2018-09-26 08:08:57,873 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2793 transitions. Word has length 23 [2018-09-26 08:08:57,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:57,873 INFO L480 AbstractCegarLoop]: Abstraction has 1710 states and 2793 transitions. [2018-09-26 08:08:57,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:08:57,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2793 transitions. [2018-09-26 08:08:57,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:08:57,874 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:57,874 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:57,874 INFO L423 AbstractCegarLoop]: === Iteration 142 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:57,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:57,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1349164405, now seen corresponding path program 3 times [2018-09-26 08:08:57,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:57,889 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:57,889 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:57,889 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:08:57,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:08:57,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:08:57,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:08:57,890 INFO L87 Difference]: Start difference. First operand 1710 states and 2793 transitions. Second operand 16 states. [2018-09-26 08:08:59,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:59,640 INFO L93 Difference]: Finished difference Result 1839 states and 2998 transitions. [2018-09-26 08:08:59,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:08:59,640 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-09-26 08:08:59,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:59,642 INFO L225 Difference]: With dead ends: 1839 [2018-09-26 08:08:59,642 INFO L226 Difference]: Without dead ends: 1838 [2018-09-26 08:08:59,643 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=166, Invalid=704, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:08:59,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2018-09-26 08:09:01,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1750. [2018-09-26 08:09:01,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2018-09-26 08:09:01,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2860 transitions. [2018-09-26 08:09:01,193 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2860 transitions. Word has length 23 [2018-09-26 08:09:01,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:01,193 INFO L480 AbstractCegarLoop]: Abstraction has 1750 states and 2860 transitions. [2018-09-26 08:09:01,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:09:01,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2860 transitions. [2018-09-26 08:09:01,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:09:01,194 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:01,194 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:01,195 INFO L423 AbstractCegarLoop]: === Iteration 143 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:01,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:01,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1977166985, now seen corresponding path program 1 times [2018-09-26 08:09:01,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:01,212 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:01,212 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:01,213 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:09:01,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:09:01,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:09:01,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:09:01,213 INFO L87 Difference]: Start difference. First operand 1750 states and 2860 transitions. Second operand 15 states. [2018-09-26 08:09:03,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:03,133 INFO L93 Difference]: Finished difference Result 1875 states and 3050 transitions. [2018-09-26 08:09:03,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:09:03,133 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2018-09-26 08:09:03,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:03,136 INFO L225 Difference]: With dead ends: 1875 [2018-09-26 08:09:03,136 INFO L226 Difference]: Without dead ends: 1873 [2018-09-26 08:09:03,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=194, Invalid=996, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:09:03,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2018-09-26 08:09:04,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1738. [2018-09-26 08:09:04,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2018-09-26 08:09:04,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2840 transitions. [2018-09-26 08:09:04,674 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2840 transitions. Word has length 23 [2018-09-26 08:09:04,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:04,674 INFO L480 AbstractCegarLoop]: Abstraction has 1738 states and 2840 transitions. [2018-09-26 08:09:04,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:09:04,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2840 transitions. [2018-09-26 08:09:04,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:09:04,675 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:04,675 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:04,676 INFO L423 AbstractCegarLoop]: === Iteration 144 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:04,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:04,676 INFO L82 PathProgramCache]: Analyzing trace with hash -451471923, now seen corresponding path program 4 times [2018-09-26 08:09:04,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:04,690 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:04,690 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:04,690 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:09:04,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:09:04,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:09:04,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:09:04,691 INFO L87 Difference]: Start difference. First operand 1738 states and 2840 transitions. Second operand 16 states. [2018-09-26 08:09:06,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:06,641 INFO L93 Difference]: Finished difference Result 1956 states and 3208 transitions. [2018-09-26 08:09:06,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:09:06,641 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-09-26 08:09:06,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:06,643 INFO L225 Difference]: With dead ends: 1956 [2018-09-26 08:09:06,643 INFO L226 Difference]: Without dead ends: 1955 [2018-09-26 08:09:06,643 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:09:06,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2018-09-26 08:09:08,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1711. [2018-09-26 08:09:08,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1711 states. [2018-09-26 08:09:08,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2797 transitions. [2018-09-26 08:09:08,186 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2797 transitions. Word has length 23 [2018-09-26 08:09:08,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:08,186 INFO L480 AbstractCegarLoop]: Abstraction has 1711 states and 2797 transitions. [2018-09-26 08:09:08,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:09:08,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2797 transitions. [2018-09-26 08:09:08,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:09:08,187 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:08,187 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:08,187 INFO L423 AbstractCegarLoop]: === Iteration 145 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:08,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:08,187 INFO L82 PathProgramCache]: Analyzing trace with hash -451472211, now seen corresponding path program 2 times [2018-09-26 08:09:08,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:08,205 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:08,205 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:08,205 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:09:08,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:09:08,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:09:08,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:09:08,206 INFO L87 Difference]: Start difference. First operand 1711 states and 2797 transitions. Second operand 14 states. [2018-09-26 08:09:10,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:10,095 INFO L93 Difference]: Finished difference Result 1914 states and 3100 transitions. [2018-09-26 08:09:10,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:09:10,095 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-09-26 08:09:10,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:10,098 INFO L225 Difference]: With dead ends: 1914 [2018-09-26 08:09:10,098 INFO L226 Difference]: Without dead ends: 1912 [2018-09-26 08:09:10,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=193, Invalid=677, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:09:10,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2018-09-26 08:09:11,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1723. [2018-09-26 08:09:11,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2018-09-26 08:09:11,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2809 transitions. [2018-09-26 08:09:11,720 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2809 transitions. Word has length 23 [2018-09-26 08:09:11,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:11,721 INFO L480 AbstractCegarLoop]: Abstraction has 1723 states and 2809 transitions. [2018-09-26 08:09:11,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:09:11,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2809 transitions. [2018-09-26 08:09:11,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:09:11,722 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:11,722 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:11,722 INFO L423 AbstractCegarLoop]: === Iteration 146 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:11,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:11,723 INFO L82 PathProgramCache]: Analyzing trace with hash -590426441, now seen corresponding path program 2 times [2018-09-26 08:09:11,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:11,742 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:11,742 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:11,743 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:09:11,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:09:11,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:09:11,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:09:11,743 INFO L87 Difference]: Start difference. First operand 1723 states and 2809 transitions. Second operand 15 states. [2018-09-26 08:09:13,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:13,775 INFO L93 Difference]: Finished difference Result 1923 states and 3105 transitions. [2018-09-26 08:09:13,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:09:13,775 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2018-09-26 08:09:13,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:13,777 INFO L225 Difference]: With dead ends: 1923 [2018-09-26 08:09:13,777 INFO L226 Difference]: Without dead ends: 1921 [2018-09-26 08:09:13,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=238, Invalid=1094, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:09:13,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2018-09-26 08:09:15,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1745. [2018-09-26 08:09:15,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1745 states. [2018-09-26 08:09:15,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2845 transitions. [2018-09-26 08:09:15,398 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2845 transitions. Word has length 23 [2018-09-26 08:09:15,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:15,398 INFO L480 AbstractCegarLoop]: Abstraction has 1745 states and 2845 transitions. [2018-09-26 08:09:15,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:09:15,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2845 transitions. [2018-09-26 08:09:15,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:09:15,399 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:15,399 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:15,399 INFO L423 AbstractCegarLoop]: === Iteration 147 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:15,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:15,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1677111747, now seen corresponding path program 3 times [2018-09-26 08:09:15,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:15,413 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:15,414 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:15,414 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:09:15,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:09:15,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:09:15,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:09:15,414 INFO L87 Difference]: Start difference. First operand 1745 states and 2845 transitions. Second operand 14 states. [2018-09-26 08:09:17,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:17,667 INFO L93 Difference]: Finished difference Result 2195 states and 3566 transitions. [2018-09-26 08:09:17,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:09:17,667 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-09-26 08:09:17,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:17,669 INFO L225 Difference]: With dead ends: 2195 [2018-09-26 08:09:17,669 INFO L226 Difference]: Without dead ends: 2193 [2018-09-26 08:09:17,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=191, Invalid=679, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:09:17,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2193 states. [2018-09-26 08:09:19,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2193 to 1652. [2018-09-26 08:09:19,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2018-09-26 08:09:19,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 2691 transitions. [2018-09-26 08:09:19,274 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 2691 transitions. Word has length 23 [2018-09-26 08:09:19,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:19,274 INFO L480 AbstractCegarLoop]: Abstraction has 1652 states and 2691 transitions. [2018-09-26 08:09:19,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:09:19,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2691 transitions. [2018-09-26 08:09:19,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:09:19,275 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:19,275 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:19,276 INFO L423 AbstractCegarLoop]: === Iteration 148 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:19,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:19,276 INFO L82 PathProgramCache]: Analyzing trace with hash 170792271, now seen corresponding path program 2 times [2018-09-26 08:09:19,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:19,296 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:19,297 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:19,297 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:09:19,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:09:19,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:09:19,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:09:19,298 INFO L87 Difference]: Start difference. First operand 1652 states and 2691 transitions. Second operand 16 states. [2018-09-26 08:09:21,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:21,438 INFO L93 Difference]: Finished difference Result 1928 states and 3135 transitions. [2018-09-26 08:09:21,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:09:21,438 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-09-26 08:09:21,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:21,440 INFO L225 Difference]: With dead ends: 1928 [2018-09-26 08:09:21,440 INFO L226 Difference]: Without dead ends: 1927 [2018-09-26 08:09:21,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:09:21,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2018-09-26 08:09:23,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1651. [2018-09-26 08:09:23,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1651 states. [2018-09-26 08:09:23,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2684 transitions. [2018-09-26 08:09:23,057 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2684 transitions. Word has length 23 [2018-09-26 08:09:23,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:23,057 INFO L480 AbstractCegarLoop]: Abstraction has 1651 states and 2684 transitions. [2018-09-26 08:09:23,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:09:23,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2684 transitions. [2018-09-26 08:09:23,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:09:23,058 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:23,058 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:23,059 INFO L423 AbstractCegarLoop]: === Iteration 149 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:23,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:23,059 INFO L82 PathProgramCache]: Analyzing trace with hash 170791983, now seen corresponding path program 4 times [2018-09-26 08:09:23,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:23,072 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:23,073 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:23,073 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:09:23,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:09:23,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:09:23,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:09:23,074 INFO L87 Difference]: Start difference. First operand 1651 states and 2684 transitions. Second operand 14 states. [2018-09-26 08:09:25,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:25,171 INFO L93 Difference]: Finished difference Result 1899 states and 3045 transitions. [2018-09-26 08:09:25,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:09:25,171 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-09-26 08:09:25,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:25,173 INFO L225 Difference]: With dead ends: 1899 [2018-09-26 08:09:25,173 INFO L226 Difference]: Without dead ends: 1897 [2018-09-26 08:09:25,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=214, Invalid=716, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:09:25,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2018-09-26 08:09:26,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1441. [2018-09-26 08:09:26,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1441 states. [2018-09-26 08:09:26,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 2333 transitions. [2018-09-26 08:09:26,803 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 2333 transitions. Word has length 23 [2018-09-26 08:09:26,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:26,803 INFO L480 AbstractCegarLoop]: Abstraction has 1441 states and 2333 transitions. [2018-09-26 08:09:26,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:09:26,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 2333 transitions. [2018-09-26 08:09:26,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:09:26,804 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:26,804 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-26 08:09:26,804 INFO L423 AbstractCegarLoop]: === Iteration 150 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:26,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:26,804 INFO L82 PathProgramCache]: Analyzing trace with hash 162203814, now seen corresponding path program 2 times [2018-09-26 08:09:26,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:26,822 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:09:26,822 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:26,822 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:09:26,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:09:26,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:09:26,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:09:26,823 INFO L87 Difference]: Start difference. First operand 1441 states and 2333 transitions. Second operand 15 states. [2018-09-26 08:09:28,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:28,955 INFO L93 Difference]: Finished difference Result 1620 states and 2601 transitions. [2018-09-26 08:09:28,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:09:28,955 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2018-09-26 08:09:28,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:28,957 INFO L225 Difference]: With dead ends: 1620 [2018-09-26 08:09:28,957 INFO L226 Difference]: Without dead ends: 1619 [2018-09-26 08:09:28,957 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=193, Invalid=677, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:09:28,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2018-09-26 08:09:30,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1439. [2018-09-26 08:09:30,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1439 states. [2018-09-26 08:09:30,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 2328 transitions. [2018-09-26 08:09:30,677 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 2328 transitions. Word has length 23 [2018-09-26 08:09:30,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:30,677 INFO L480 AbstractCegarLoop]: Abstraction has 1439 states and 2328 transitions. [2018-09-26 08:09:30,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:09:30,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 2328 transitions. [2018-09-26 08:09:30,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:09:30,678 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:30,678 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:30,678 INFO L423 AbstractCegarLoop]: === Iteration 151 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:30,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:30,678 INFO L82 PathProgramCache]: Analyzing trace with hash 162205096, now seen corresponding path program 2 times [2018-09-26 08:09:30,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:30,693 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:30,694 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:30,694 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:09:30,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:09:30,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:09:30,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:09:30,694 INFO L87 Difference]: Start difference. First operand 1439 states and 2328 transitions. Second operand 14 states. [2018-09-26 08:09:32,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:32,929 INFO L93 Difference]: Finished difference Result 1661 states and 2663 transitions. [2018-09-26 08:09:32,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:09:32,929 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-09-26 08:09:32,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:32,930 INFO L225 Difference]: With dead ends: 1661 [2018-09-26 08:09:32,931 INFO L226 Difference]: Without dead ends: 1659 [2018-09-26 08:09:32,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:09:32,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2018-09-26 08:09:34,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1441. [2018-09-26 08:09:34,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1441 states. [2018-09-26 08:09:34,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 2330 transitions. [2018-09-26 08:09:34,505 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 2330 transitions. Word has length 23 [2018-09-26 08:09:34,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:34,505 INFO L480 AbstractCegarLoop]: Abstraction has 1441 states and 2330 transitions. [2018-09-26 08:09:34,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:09:34,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 2330 transitions. [2018-09-26 08:09:34,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:09:34,506 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:34,506 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:34,506 INFO L423 AbstractCegarLoop]: === Iteration 152 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:34,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:34,506 INFO L82 PathProgramCache]: Analyzing trace with hash 208964473, now seen corresponding path program 2 times [2018-09-26 08:09:34,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:34,523 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:34,523 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:34,523 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:09:34,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:09:34,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:09:34,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:09:34,524 INFO L87 Difference]: Start difference. First operand 1441 states and 2330 transitions. Second operand 15 states. [2018-09-26 08:09:37,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:37,229 INFO L93 Difference]: Finished difference Result 2002 states and 3222 transitions. [2018-09-26 08:09:37,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:09:37,230 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2018-09-26 08:09:37,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:37,231 INFO L225 Difference]: With dead ends: 2002 [2018-09-26 08:09:37,231 INFO L226 Difference]: Without dead ends: 2000 [2018-09-26 08:09:37,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=255, Invalid=1227, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:09:37,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2018-09-26 08:09:39,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1602. [2018-09-26 08:09:39,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1602 states. [2018-09-26 08:09:39,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2591 transitions. [2018-09-26 08:09:39,097 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2591 transitions. Word has length 23 [2018-09-26 08:09:39,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:39,097 INFO L480 AbstractCegarLoop]: Abstraction has 1602 states and 2591 transitions. [2018-09-26 08:09:39,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:09:39,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2591 transitions. [2018-09-26 08:09:39,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:09:39,098 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:39,098 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:39,098 INFO L423 AbstractCegarLoop]: === Iteration 153 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:39,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:39,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1117815128, now seen corresponding path program 1 times [2018-09-26 08:09:39,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:39,119 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:39,120 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:39,120 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:09:39,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:09:39,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:09:39,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:09:39,121 INFO L87 Difference]: Start difference. First operand 1602 states and 2591 transitions. Second operand 13 states. [2018-09-26 08:09:41,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:41,617 INFO L93 Difference]: Finished difference Result 1864 states and 2997 transitions. [2018-09-26 08:09:41,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:09:41,618 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-09-26 08:09:41,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:41,619 INFO L225 Difference]: With dead ends: 1864 [2018-09-26 08:09:41,620 INFO L226 Difference]: Without dead ends: 1862 [2018-09-26 08:09:41,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=224, Invalid=1258, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:09:41,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2018-09-26 08:09:43,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1671. [2018-09-26 08:09:43,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1671 states. [2018-09-26 08:09:43,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2717 transitions. [2018-09-26 08:09:43,541 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2717 transitions. Word has length 23 [2018-09-26 08:09:43,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:43,542 INFO L480 AbstractCegarLoop]: Abstraction has 1671 states and 2717 transitions. [2018-09-26 08:09:43,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:09:43,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2717 transitions. [2018-09-26 08:09:43,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:09:43,542 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:43,543 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-26 08:09:43,543 INFO L423 AbstractCegarLoop]: === Iteration 154 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:43,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:43,543 INFO L82 PathProgramCache]: Analyzing trace with hash -821177279, now seen corresponding path program 2 times [2018-09-26 08:09:43,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:43,562 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:43,562 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:43,562 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:09:43,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:09:43,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:09:43,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:09:43,563 INFO L87 Difference]: Start difference. First operand 1671 states and 2717 transitions. Second operand 16 states. [2018-09-26 08:09:45,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:45,728 INFO L93 Difference]: Finished difference Result 1740 states and 2811 transitions. [2018-09-26 08:09:45,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:09:45,729 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-09-26 08:09:45,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:45,731 INFO L225 Difference]: With dead ends: 1740 [2018-09-26 08:09:45,731 INFO L226 Difference]: Without dead ends: 1739 [2018-09-26 08:09:45,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=373, Invalid=1697, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:09:45,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2018-09-26 08:09:47,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1613. [2018-09-26 08:09:47,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1613 states. [2018-09-26 08:09:47,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 2622 transitions. [2018-09-26 08:09:47,626 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 2622 transitions. Word has length 25 [2018-09-26 08:09:47,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:47,626 INFO L480 AbstractCegarLoop]: Abstraction has 1613 states and 2622 transitions. [2018-09-26 08:09:47,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:09:47,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2622 transitions. [2018-09-26 08:09:47,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:09:47,627 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:47,627 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:47,628 INFO L423 AbstractCegarLoop]: === Iteration 155 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:47,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:47,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1822640705, now seen corresponding path program 1 times [2018-09-26 08:09:47,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:47,642 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:47,642 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:47,642 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:09:47,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:09:47,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:09:47,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:09:47,643 INFO L87 Difference]: Start difference. First operand 1613 states and 2622 transitions. Second operand 15 states. [2018-09-26 08:09:49,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:49,849 INFO L93 Difference]: Finished difference Result 1786 states and 2897 transitions. [2018-09-26 08:09:49,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:09:49,850 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-09-26 08:09:49,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:49,852 INFO L225 Difference]: With dead ends: 1786 [2018-09-26 08:09:49,852 INFO L226 Difference]: Without dead ends: 1785 [2018-09-26 08:09:49,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:09:49,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2018-09-26 08:09:51,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1655. [2018-09-26 08:09:51,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1655 states. [2018-09-26 08:09:51,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2692 transitions. [2018-09-26 08:09:51,758 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2692 transitions. Word has length 25 [2018-09-26 08:09:51,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:51,758 INFO L480 AbstractCegarLoop]: Abstraction has 1655 states and 2692 transitions. [2018-09-26 08:09:51,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:09:51,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2692 transitions. [2018-09-26 08:09:51,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:09:51,759 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:51,759 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-26 08:09:51,760 INFO L423 AbstractCegarLoop]: === Iteration 156 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:51,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:51,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1372501011, now seen corresponding path program 3 times [2018-09-26 08:09:51,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:51,777 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:51,777 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:51,777 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:09:51,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:09:51,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:09:51,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:09:51,778 INFO L87 Difference]: Start difference. First operand 1655 states and 2692 transitions. Second operand 16 states. [2018-09-26 08:09:54,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:54,612 INFO L93 Difference]: Finished difference Result 2034 states and 3278 transitions. [2018-09-26 08:09:54,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:09:54,612 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-09-26 08:09:54,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:54,614 INFO L225 Difference]: With dead ends: 2034 [2018-09-26 08:09:54,614 INFO L226 Difference]: Without dead ends: 2033 [2018-09-26 08:09:54,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=473, Invalid=3187, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:09:54,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2018-09-26 08:09:56,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 1671. [2018-09-26 08:09:56,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1671 states. [2018-09-26 08:09:56,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2720 transitions. [2018-09-26 08:09:56,565 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2720 transitions. Word has length 25 [2018-09-26 08:09:56,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:56,565 INFO L480 AbstractCegarLoop]: Abstraction has 1671 states and 2720 transitions. [2018-09-26 08:09:56,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:09:56,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2720 transitions. [2018-09-26 08:09:56,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:09:56,567 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:56,567 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:56,567 INFO L423 AbstractCegarLoop]: === Iteration 157 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:56,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:56,567 INFO L82 PathProgramCache]: Analyzing trace with hash -532386214, now seen corresponding path program 6 times [2018-09-26 08:09:56,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:56,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:56,596 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:56,597 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:56,597 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:09:56,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:09:56,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:09:56,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:09:56,597 INFO L87 Difference]: Start difference. First operand 1671 states and 2720 transitions. Second operand 18 states. [2018-09-26 08:09:58,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:58,814 INFO L93 Difference]: Finished difference Result 1747 states and 2831 transitions. [2018-09-26 08:09:58,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:09:58,814 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-09-26 08:09:58,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:58,816 INFO L225 Difference]: With dead ends: 1747 [2018-09-26 08:09:58,816 INFO L226 Difference]: Without dead ends: 1746 [2018-09-26 08:09:58,816 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=265, Invalid=1217, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:09:58,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2018-09-26 08:10:00,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1673. [2018-09-26 08:10:00,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1673 states. [2018-09-26 08:10:00,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2721 transitions. [2018-09-26 08:10:00,780 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2721 transitions. Word has length 25 [2018-09-26 08:10:00,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:00,781 INFO L480 AbstractCegarLoop]: Abstraction has 1673 states and 2721 transitions. [2018-09-26 08:10:00,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:10:00,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2721 transitions. [2018-09-26 08:10:00,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:10:00,782 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:00,782 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:10:00,782 INFO L423 AbstractCegarLoop]: === Iteration 158 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:00,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:00,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1681122916, now seen corresponding path program 2 times [2018-09-26 08:10:00,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:00,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:00,804 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:00,804 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:00,804 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:10:00,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:10:00,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:10:00,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:10:00,805 INFO L87 Difference]: Start difference. First operand 1673 states and 2721 transitions. Second operand 17 states. [2018-09-26 08:10:03,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:03,160 INFO L93 Difference]: Finished difference Result 1789 states and 2888 transitions. [2018-09-26 08:10:03,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:10:03,160 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-09-26 08:10:03,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:03,162 INFO L225 Difference]: With dead ends: 1789 [2018-09-26 08:10:03,162 INFO L226 Difference]: Without dead ends: 1787 [2018-09-26 08:10:03,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=260, Invalid=1546, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:10:03,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2018-09-26 08:10:05,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1641. [2018-09-26 08:10:05,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1641 states. [2018-09-26 08:10:05,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2669 transitions. [2018-09-26 08:10:05,177 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2669 transitions. Word has length 25 [2018-09-26 08:10:05,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:05,177 INFO L480 AbstractCegarLoop]: Abstraction has 1641 states and 2669 transitions. [2018-09-26 08:10:05,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:10:05,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2669 transitions. [2018-09-26 08:10:05,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:10:05,178 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:05,178 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-26 08:10:05,178 INFO L423 AbstractCegarLoop]: === Iteration 159 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:05,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:05,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1832810091, now seen corresponding path program 4 times [2018-09-26 08:10:05,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:05,194 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:05,194 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:05,194 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:10:05,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:10:05,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:10:05,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:10:05,195 INFO L87 Difference]: Start difference. First operand 1641 states and 2669 transitions. Second operand 16 states. [2018-09-26 08:10:07,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:07,697 INFO L93 Difference]: Finished difference Result 1864 states and 3013 transitions. [2018-09-26 08:10:07,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:10:07,697 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-09-26 08:10:07,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:07,699 INFO L225 Difference]: With dead ends: 1864 [2018-09-26 08:10:07,699 INFO L226 Difference]: Without dead ends: 1862 [2018-09-26 08:10:07,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=330, Invalid=1562, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:10:07,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2018-09-26 08:10:09,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1610. [2018-09-26 08:10:09,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1610 states. [2018-09-26 08:10:09,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2618 transitions. [2018-09-26 08:10:09,646 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2618 transitions. Word has length 25 [2018-09-26 08:10:09,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:09,646 INFO L480 AbstractCegarLoop]: Abstraction has 1610 states and 2618 transitions. [2018-09-26 08:10:09,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:10:09,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2618 transitions. [2018-09-26 08:10:09,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:10:09,647 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:09,647 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:10:09,647 INFO L423 AbstractCegarLoop]: === Iteration 160 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:09,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:09,648 INFO L82 PathProgramCache]: Analyzing trace with hash -72077134, now seen corresponding path program 7 times [2018-09-26 08:10:09,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:09,679 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:09,679 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:09,680 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:10:09,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:10:09,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:10:09,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:10:09,680 INFO L87 Difference]: Start difference. First operand 1610 states and 2618 transitions. Second operand 18 states. [2018-09-26 08:10:12,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:12,082 INFO L93 Difference]: Finished difference Result 1778 states and 2887 transitions. [2018-09-26 08:10:12,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:10:12,082 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-09-26 08:10:12,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:12,084 INFO L225 Difference]: With dead ends: 1778 [2018-09-26 08:10:12,084 INFO L226 Difference]: Without dead ends: 1777 [2018-09-26 08:10:12,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=312, Invalid=1328, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:10:12,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2018-09-26 08:10:14,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1650. [2018-09-26 08:10:14,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1650 states. [2018-09-26 08:10:14,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 2682 transitions. [2018-09-26 08:10:14,058 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 2682 transitions. Word has length 25 [2018-09-26 08:10:14,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:14,058 INFO L480 AbstractCegarLoop]: Abstraction has 1650 states and 2682 transitions. [2018-09-26 08:10:14,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:10:14,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2682 transitions. [2018-09-26 08:10:14,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:10:14,059 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:14,059 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:10:14,059 INFO L423 AbstractCegarLoop]: === Iteration 161 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:14,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:14,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1741678744, now seen corresponding path program 3 times [2018-09-26 08:10:14,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:14,077 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:14,078 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:14,078 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:10:14,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:10:14,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:10:14,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:10:14,078 INFO L87 Difference]: Start difference. First operand 1650 states and 2682 transitions. Second operand 17 states. [2018-09-26 08:10:16,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:16,384 INFO L93 Difference]: Finished difference Result 1836 states and 2973 transitions. [2018-09-26 08:10:16,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:10:16,384 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-09-26 08:10:16,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:16,386 INFO L225 Difference]: With dead ends: 1836 [2018-09-26 08:10:16,386 INFO L226 Difference]: Without dead ends: 1835 [2018-09-26 08:10:16,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=209, Invalid=847, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:10:16,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2018-09-26 08:10:18,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1762. [2018-09-26 08:10:18,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1762 states. [2018-09-26 08:10:18,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 2868 transitions. [2018-09-26 08:10:18,526 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 2868 transitions. Word has length 25 [2018-09-26 08:10:18,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:18,526 INFO L480 AbstractCegarLoop]: Abstraction has 1762 states and 2868 transitions. [2018-09-26 08:10:18,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:10:18,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 2868 transitions. [2018-09-26 08:10:18,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:10:18,527 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:18,527 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:10:18,527 INFO L423 AbstractCegarLoop]: === Iteration 162 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:18,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:18,527 INFO L82 PathProgramCache]: Analyzing trace with hash -463321892, now seen corresponding path program 3 times [2018-09-26 08:10:18,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:18,547 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:18,547 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:18,548 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:10:18,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:10:18,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:10:18,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:10:18,548 INFO L87 Difference]: Start difference. First operand 1762 states and 2868 transitions. Second operand 17 states. [2018-09-26 08:10:21,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:21,538 INFO L93 Difference]: Finished difference Result 2066 states and 3329 transitions. [2018-09-26 08:10:21,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:10:21,538 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-09-26 08:10:21,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:21,540 INFO L225 Difference]: With dead ends: 2066 [2018-09-26 08:10:21,540 INFO L226 Difference]: Without dead ends: 2064 [2018-09-26 08:10:21,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=390, Invalid=2366, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:10:21,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2018-09-26 08:10:23,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 1772. [2018-09-26 08:10:23,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2018-09-26 08:10:23,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2884 transitions. [2018-09-26 08:10:23,710 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2884 transitions. Word has length 25 [2018-09-26 08:10:23,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:23,710 INFO L480 AbstractCegarLoop]: Abstraction has 1772 states and 2884 transitions. [2018-09-26 08:10:23,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:10:23,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2884 transitions. [2018-09-26 08:10:23,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:10:23,711 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:23,711 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:10:23,711 INFO L423 AbstractCegarLoop]: === Iteration 163 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:23,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:23,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1911500712, now seen corresponding path program 1 times [2018-09-26 08:10:23,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:23,726 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:23,726 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:23,726 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:10:23,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:10:23,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:10:23,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:10:23,727 INFO L87 Difference]: Start difference. First operand 1772 states and 2884 transitions. Second operand 14 states. [2018-09-26 08:10:26,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:26,101 INFO L93 Difference]: Finished difference Result 1956 states and 3171 transitions. [2018-09-26 08:10:26,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:10:26,101 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-09-26 08:10:26,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:26,103 INFO L225 Difference]: With dead ends: 1956 [2018-09-26 08:10:26,103 INFO L226 Difference]: Without dead ends: 1955 [2018-09-26 08:10:26,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=179, Invalid=877, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:10:26,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2018-09-26 08:10:28,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1793. [2018-09-26 08:10:28,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1793 states. [2018-09-26 08:10:28,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2918 transitions. [2018-09-26 08:10:28,312 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2918 transitions. Word has length 25 [2018-09-26 08:10:28,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:28,312 INFO L480 AbstractCegarLoop]: Abstraction has 1793 states and 2918 transitions. [2018-09-26 08:10:28,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:10:28,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2918 transitions. [2018-09-26 08:10:28,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:10:28,313 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:28,313 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:10:28,313 INFO L423 AbstractCegarLoop]: === Iteration 164 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:28,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:28,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1586218584, now seen corresponding path program 1 times [2018-09-26 08:10:28,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:28,330 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:28,331 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:28,331 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:10:28,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:10:28,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:10:28,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:10:28,331 INFO L87 Difference]: Start difference. First operand 1793 states and 2918 transitions. Second operand 16 states. [2018-09-26 08:10:30,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:30,668 INFO L93 Difference]: Finished difference Result 1932 states and 3141 transitions. [2018-09-26 08:10:30,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:10:30,668 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-09-26 08:10:30,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:30,670 INFO L225 Difference]: With dead ends: 1932 [2018-09-26 08:10:30,670 INFO L226 Difference]: Without dead ends: 1931 [2018-09-26 08:10:30,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:10:30,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2018-09-26 08:10:32,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1891. [2018-09-26 08:10:32,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1891 states. [2018-09-26 08:10:32,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 3080 transitions. [2018-09-26 08:10:32,968 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 3080 transitions. Word has length 25 [2018-09-26 08:10:32,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:32,968 INFO L480 AbstractCegarLoop]: Abstraction has 1891 states and 3080 transitions. [2018-09-26 08:10:32,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:10:32,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 3080 transitions. [2018-09-26 08:10:32,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:10:32,969 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:32,970 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:10:32,970 INFO L423 AbstractCegarLoop]: === Iteration 165 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:32,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:32,970 INFO L82 PathProgramCache]: Analyzing trace with hash -209412774, now seen corresponding path program 1 times [2018-09-26 08:10:32,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:32,991 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:32,991 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:32,991 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:10:32,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:10:32,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:10:32,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:10:32,992 INFO L87 Difference]: Start difference. First operand 1891 states and 3080 transitions. Second operand 14 states. [2018-09-26 08:10:35,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:35,624 INFO L93 Difference]: Finished difference Result 2086 states and 3386 transitions. [2018-09-26 08:10:35,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:10:35,624 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-09-26 08:10:35,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:35,626 INFO L225 Difference]: With dead ends: 2086 [2018-09-26 08:10:35,627 INFO L226 Difference]: Without dead ends: 2085 [2018-09-26 08:10:35,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=186, Invalid=936, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:10:35,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. Received shutdown request... [2018-09-26 08:10:37,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 1866. [2018-09-26 08:10:37,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1866 states. [2018-09-26 08:10:37,930 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 08:10:37,935 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 08:10:37,935 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:10:37 BoogieIcfgContainer [2018-09-26 08:10:37,935 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:10:37,936 INFO L168 Benchmark]: Toolchain (without parser) took 252924.01 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.3 GB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -142.4 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-09-26 08:10:37,937 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:10:37,938 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.12 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:37,938 INFO L168 Benchmark]: Boogie Preprocessor took 28.38 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:37,939 INFO L168 Benchmark]: RCFGBuilder took 303.97 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:37,939 INFO L168 Benchmark]: TraceAbstraction took 252537.94 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.3 GB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -153.0 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-09-26 08:10:37,942 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.12 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 28.38 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 303.97 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 252537.94 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.3 GB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -153.0 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 74). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 45). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 85). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 94). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 4 error locations. TIMEOUT Result, 252.4s OverallTime, 165 OverallIterations, 4 TraceHistogramMax, 143.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6178 SDtfs, 16159 SDslu, 15677 SDs, 0 SdLazy, 94043 SolverSat, 6568 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3840 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 3692 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21903 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1891occurred in iteration=164, 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: 105.4s AutomataMinimizationTime, 165 MinimizatonAttempts, 15615 StatesRemovedByMinimization, 161 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2832 NumberOfCodeBlocks, 2832 NumberOfCodeBlocksAsserted, 165 NumberOfCheckSat, 2667 ConstructedInterpolants, 0 QuantifiedInterpolants, 291631 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 165 InterpolantComputations, 10 PerfectInterpolantSequences, 267/1451 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_product.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-10-37-953.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-10-37-953.csv Completed graceful shutdown