java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-bd42740 [2018-09-23 21:17:29,862 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-23 21:17:29,864 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-23 21:17:29,882 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-23 21:17:29,883 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-23 21:17:29,884 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-23 21:17:29,886 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-23 21:17:29,889 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-23 21:17:29,891 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-23 21:17:29,893 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-23 21:17:29,894 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-23 21:17:29,894 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-23 21:17:29,896 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-23 21:17:29,897 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-23 21:17:29,899 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-23 21:17:29,899 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-23 21:17:29,903 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-23 21:17:29,912 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-23 21:17:29,915 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-23 21:17:29,916 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-23 21:17:29,919 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-23 21:17:29,921 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-23 21:17:29,924 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-23 21:17:29,924 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-23 21:17:29,924 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-23 21:17:29,927 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-23 21:17:29,928 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-23 21:17:29,929 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-23 21:17:29,933 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-23 21:17:29,936 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-23 21:17:29,936 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-23 21:17:29,937 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-23 21:17:29,937 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-23 21:17:29,937 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-23 21:17:29,941 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-23 21:17:29,942 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-23 21:17:29,942 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-23 21:17:29,969 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-23 21:17:29,969 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-23 21:17:29,970 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-23 21:17:29,971 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-23 21:17:29,972 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-23 21:17:29,972 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-23 21:17:29,973 INFO L133 SettingsManager]: * Use SBE=true [2018-09-23 21:17:29,973 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-23 21:17:29,973 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-23 21:17:29,974 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-23 21:17:29,974 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-23 21:17:29,975 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-23 21:17:29,975 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-23 21:17:29,975 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-23 21:17:29,975 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-23 21:17:29,975 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-23 21:17:29,976 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-23 21:17:29,976 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-23 21:17:29,976 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-23 21:17:29,976 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-23 21:17:29,976 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-23 21:17:29,977 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-23 21:17:29,977 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 21:17:29,977 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-23 21:17:29,977 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-23 21:17:29,977 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-23 21:17:29,978 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-23 21:17:29,978 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-23 21:17:29,978 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-23 21:17:29,978 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-23 21:17:30,046 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-23 21:17:30,062 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-23 21:17:30,069 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-23 21:17:30,071 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-23 21:17:30,071 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-23 21:17:30,072 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl [2018-09-23 21:17:30,072 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl' [2018-09-23 21:17:30,194 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-23 21:17:30,199 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-23 21:17:30,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-23 21:17:30,200 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-23 21:17:30,200 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-23 21:17:30,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:30" (1/1) ... [2018-09-23 21:17:30,241 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:30" (1/1) ... [2018-09-23 21:17:30,253 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-23 21:17:30,254 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-23 21:17:30,254 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-23 21:17:30,256 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-23 21:17:30,257 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-23 21:17:30,257 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-23 21:17:30,257 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-23 21:17:30,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:30" (1/1) ... [2018-09-23 21:17:30,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:30" (1/1) ... [2018-09-23 21:17:30,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:30" (1/1) ... [2018-09-23 21:17:30,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:30" (1/1) ... [2018-09-23 21:17:30,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:30" (1/1) ... [2018-09-23 21:17:30,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:30" (1/1) ... [2018-09-23 21:17:30,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:30" (1/1) ... [2018-09-23 21:17:30,309 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-23 21:17:30,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-23 21:17:30,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-23 21:17:30,310 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-23 21:17:30,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 21:17:30,375 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-23 21:17:30,375 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-23 21:17:30,375 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-23 21:17:31,414 INFO L351 CfgBuilder]: Using library mode [2018-09-23 21:17:31,415 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 09:17:31 BoogieIcfgContainer [2018-09-23 21:17:31,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-23 21:17:31,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-23 21:17:31,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-23 21:17:31,419 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-23 21:17:31,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:30" (1/2) ... [2018-09-23 21:17:31,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c5c7b9 and model type threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.09 09:17:31, skipping insertion in model container [2018-09-23 21:17:31,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 09:17:31" (2/2) ... [2018-09-23 21:17:31,423 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out3.mover.bpl [2018-09-23 21:17:31,437 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-23 21:17:31,450 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-09-23 21:17:31,505 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-23 21:17:31,506 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-23 21:17:31,506 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-23 21:17:31,507 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-23 21:17:31,507 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-23 21:17:31,507 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-23 21:17:31,507 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-23 21:17:31,507 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-23 21:17:31,507 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-23 21:17:31,536 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-09-23 21:17:31,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-23 21:17:31,546 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:31,547 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-23 21:17:31,549 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:31,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:31,556 INFO L82 PathProgramCache]: Analyzing trace with hash 45506320, now seen corresponding path program 1 times [2018-09-23 21:17:31,558 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:31,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:31,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:31,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:31,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:31,813 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-23 21:17:31,816 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:31,816 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:17:31,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-23 21:17:31,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-23 21:17:31,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-23 21:17:31,842 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 5 states. [2018-09-23 21:17:33,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:33,459 INFO L93 Difference]: Finished difference Result 142 states and 303 transitions. [2018-09-23 21:17:33,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-23 21:17:33,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-23 21:17:33,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:33,480 INFO L225 Difference]: With dead ends: 142 [2018-09-23 21:17:33,480 INFO L226 Difference]: Without dead ends: 138 [2018-09-23 21:17:33,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-23 21:17:33,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-09-23 21:17:33,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 98. [2018-09-23 21:17:33,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-23 21:17:33,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 219 transitions. [2018-09-23 21:17:33,547 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 219 transitions. Word has length 5 [2018-09-23 21:17:33,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:33,548 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 219 transitions. [2018-09-23 21:17:33,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-23 21:17:33,549 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 219 transitions. [2018-09-23 21:17:33,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-23 21:17:33,550 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:33,550 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-23 21:17:33,551 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:33,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:33,552 INFO L82 PathProgramCache]: Analyzing trace with hash 45756290, now seen corresponding path program 1 times [2018-09-23 21:17:33,552 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:33,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:33,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:33,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:33,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:17:33,698 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:33,699 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:17:33,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-23 21:17:33,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-23 21:17:33,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-23 21:17:33,702 INFO L87 Difference]: Start difference. First operand 98 states and 219 transitions. Second operand 5 states. [2018-09-23 21:17:35,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:35,160 INFO L93 Difference]: Finished difference Result 241 states and 539 transitions. [2018-09-23 21:17:35,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-23 21:17:35,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-23 21:17:35,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:35,166 INFO L225 Difference]: With dead ends: 241 [2018-09-23 21:17:35,167 INFO L226 Difference]: Without dead ends: 237 [2018-09-23 21:17:35,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:17:35,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-09-23 21:17:35,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 134. [2018-09-23 21:17:35,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-09-23 21:17:35,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 355 transitions. [2018-09-23 21:17:35,201 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 355 transitions. Word has length 5 [2018-09-23 21:17:35,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:35,202 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 355 transitions. [2018-09-23 21:17:35,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-23 21:17:35,202 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 355 transitions. [2018-09-23 21:17:35,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-23 21:17:35,203 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:35,203 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-23 21:17:35,204 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:35,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:35,205 INFO L82 PathProgramCache]: Analyzing trace with hash 28948051, now seen corresponding path program 1 times [2018-09-23 21:17:35,205 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:35,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:35,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:35,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:35,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:35,312 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-23 21:17:35,313 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:35,313 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:17:35,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-23 21:17:35,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-23 21:17:35,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-23 21:17:35,314 INFO L87 Difference]: Start difference. First operand 134 states and 355 transitions. Second operand 5 states. [2018-09-23 21:17:36,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:36,482 INFO L93 Difference]: Finished difference Result 269 states and 639 transitions. [2018-09-23 21:17:36,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-23 21:17:36,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-23 21:17:36,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:36,487 INFO L225 Difference]: With dead ends: 269 [2018-09-23 21:17:36,488 INFO L226 Difference]: Without dead ends: 265 [2018-09-23 21:17:36,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:17:36,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-09-23 21:17:36,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 162. [2018-09-23 21:17:36,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-09-23 21:17:36,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 455 transitions. [2018-09-23 21:17:36,521 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 455 transitions. Word has length 5 [2018-09-23 21:17:36,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:36,522 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 455 transitions. [2018-09-23 21:17:36,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-23 21:17:36,522 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 455 transitions. [2018-09-23 21:17:36,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:17:36,524 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:36,524 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:36,525 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:36,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:36,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558066, now seen corresponding path program 1 times [2018-09-23 21:17:36,526 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:36,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:36,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:36,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:36,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:36,642 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-23 21:17:36,643 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:36,643 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:17:36,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:17:36,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:17:36,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:17:36,645 INFO L87 Difference]: Start difference. First operand 162 states and 455 transitions. Second operand 8 states. [2018-09-23 21:17:39,273 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-23 21:17:42,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:42,570 INFO L93 Difference]: Finished difference Result 790 states and 2085 transitions. [2018-09-23 21:17:42,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-23 21:17:42,571 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 21:17:42,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:42,576 INFO L225 Difference]: With dead ends: 790 [2018-09-23 21:17:42,576 INFO L226 Difference]: Without dead ends: 629 [2018-09-23 21:17:42,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-09-23 21:17:42,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-09-23 21:17:42,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 278. [2018-09-23 21:17:42,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-09-23 21:17:42,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 854 transitions. [2018-09-23 21:17:42,628 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 854 transitions. Word has length 8 [2018-09-23 21:17:42,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:42,628 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 854 transitions. [2018-09-23 21:17:42,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:17:42,628 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 854 transitions. [2018-09-23 21:17:42,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:17:42,630 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:42,630 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:42,631 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:42,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:42,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558063, now seen corresponding path program 1 times [2018-09-23 21:17:42,632 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:42,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:42,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:42,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:42,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:42,869 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-23 21:17:42,870 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:42,870 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:17:42,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:17:42,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:17:42,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:17:42,872 INFO L87 Difference]: Start difference. First operand 278 states and 854 transitions. Second operand 8 states. [2018-09-23 21:17:46,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:46,525 INFO L93 Difference]: Finished difference Result 634 states and 1540 transitions. [2018-09-23 21:17:46,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 21:17:46,525 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 21:17:46,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:46,530 INFO L225 Difference]: With dead ends: 634 [2018-09-23 21:17:46,531 INFO L226 Difference]: Without dead ends: 628 [2018-09-23 21:17:46,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-09-23 21:17:46,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-09-23 21:17:46,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 310. [2018-09-23 21:17:46,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-09-23 21:17:46,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 963 transitions. [2018-09-23 21:17:46,590 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 963 transitions. Word has length 8 [2018-09-23 21:17:46,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:46,591 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 963 transitions. [2018-09-23 21:17:46,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:17:46,591 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 963 transitions. [2018-09-23 21:17:46,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:17:46,593 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:46,593 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:46,594 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:46,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:46,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1080099218, now seen corresponding path program 1 times [2018-09-23 21:17:46,595 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:46,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:46,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:46,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:46,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:46,720 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-23 21:17:46,721 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:46,721 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:17:46,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:17:46,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:17:46,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:17:46,723 INFO L87 Difference]: Start difference. First operand 310 states and 963 transitions. Second operand 8 states. [2018-09-23 21:17:48,309 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-23 21:17:50,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:50,488 INFO L93 Difference]: Finished difference Result 768 states and 2087 transitions. [2018-09-23 21:17:50,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-23 21:17:50,489 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 21:17:50,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:50,494 INFO L225 Difference]: With dead ends: 768 [2018-09-23 21:17:50,495 INFO L226 Difference]: Without dead ends: 537 [2018-09-23 21:17:50,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-09-23 21:17:50,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-09-23 21:17:50,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 334. [2018-09-23 21:17:50,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-09-23 21:17:50,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1037 transitions. [2018-09-23 21:17:50,553 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1037 transitions. Word has length 8 [2018-09-23 21:17:50,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:50,553 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 1037 transitions. [2018-09-23 21:17:50,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:17:50,553 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1037 transitions. [2018-09-23 21:17:50,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:17:50,555 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:50,555 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:50,556 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:50,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:50,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595081, now seen corresponding path program 1 times [2018-09-23 21:17:50,557 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:50,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:50,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:50,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:50,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:50,710 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-23 21:17:50,710 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:50,711 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:17:50,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:17:50,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:17:50,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:17:50,712 INFO L87 Difference]: Start difference. First operand 334 states and 1037 transitions. Second operand 8 states. [2018-09-23 21:17:53,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:53,322 INFO L93 Difference]: Finished difference Result 1145 states and 3146 transitions. [2018-09-23 21:17:53,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 21:17:53,324 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 21:17:53,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:53,330 INFO L225 Difference]: With dead ends: 1145 [2018-09-23 21:17:53,330 INFO L226 Difference]: Without dead ends: 812 [2018-09-23 21:17:53,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-09-23 21:17:53,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2018-09-23 21:17:53,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 450. [2018-09-23 21:17:53,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-09-23 21:17:53,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1432 transitions. [2018-09-23 21:17:53,394 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1432 transitions. Word has length 8 [2018-09-23 21:17:53,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:53,394 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 1432 transitions. [2018-09-23 21:17:53,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:17:53,395 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1432 transitions. [2018-09-23 21:17:53,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:17:53,396 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:53,396 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:53,397 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:53,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:53,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595078, now seen corresponding path program 1 times [2018-09-23 21:17:53,398 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:53,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:53,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:53,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:53,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:53,505 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-23 21:17:53,505 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:53,506 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:17:53,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:17:53,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:17:53,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:17:53,507 INFO L87 Difference]: Start difference. First operand 450 states and 1432 transitions. Second operand 8 states. [2018-09-23 21:17:55,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:55,944 INFO L93 Difference]: Finished difference Result 877 states and 2260 transitions. [2018-09-23 21:17:55,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-23 21:17:55,944 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 21:17:55,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:55,952 INFO L225 Difference]: With dead ends: 877 [2018-09-23 21:17:55,952 INFO L226 Difference]: Without dead ends: 871 [2018-09-23 21:17:55,953 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-09-23 21:17:55,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-09-23 21:17:56,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 478. [2018-09-23 21:17:56,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-09-23 21:17:56,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1531 transitions. [2018-09-23 21:17:56,043 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1531 transitions. Word has length 8 [2018-09-23 21:17:56,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:56,044 INFO L480 AbstractCegarLoop]: Abstraction has 478 states and 1531 transitions. [2018-09-23 21:17:56,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:17:56,044 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1531 transitions. [2018-09-23 21:17:56,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:17:56,046 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:56,046 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:56,047 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:56,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:56,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064444, now seen corresponding path program 1 times [2018-09-23 21:17:56,048 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:56,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:56,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:56,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:56,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:56,208 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-23 21:17:56,209 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:56,209 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:17:56,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:17:56,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:17:56,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:17:56,210 INFO L87 Difference]: Start difference. First operand 478 states and 1531 transitions. Second operand 8 states. [2018-09-23 21:17:58,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:58,280 INFO L93 Difference]: Finished difference Result 1049 states and 2854 transitions. [2018-09-23 21:17:58,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-23 21:17:58,281 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 21:17:58,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:58,286 INFO L225 Difference]: With dead ends: 1049 [2018-09-23 21:17:58,286 INFO L226 Difference]: Without dead ends: 818 [2018-09-23 21:17:58,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-09-23 21:17:58,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2018-09-23 21:17:58,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 524. [2018-09-23 21:17:58,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-09-23 21:17:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1684 transitions. [2018-09-23 21:17:58,397 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1684 transitions. Word has length 8 [2018-09-23 21:17:58,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:58,398 INFO L480 AbstractCegarLoop]: Abstraction has 524 states and 1684 transitions. [2018-09-23 21:17:58,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:17:58,398 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1684 transitions. [2018-09-23 21:17:58,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:17:58,399 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:58,399 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:58,400 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:58,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:58,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064441, now seen corresponding path program 1 times [2018-09-23 21:17:58,401 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:58,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:58,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:58,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:58,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:58,534 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-23 21:17:58,534 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:58,534 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:17:58,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:17:58,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:17:58,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:17:58,535 INFO L87 Difference]: Start difference. First operand 524 states and 1684 transitions. Second operand 8 states. [2018-09-23 21:18:00,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:00,319 INFO L93 Difference]: Finished difference Result 733 states and 1997 transitions. [2018-09-23 21:18:00,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-23 21:18:00,320 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 21:18:00,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:00,326 INFO L225 Difference]: With dead ends: 733 [2018-09-23 21:18:00,326 INFO L226 Difference]: Without dead ends: 727 [2018-09-23 21:18:00,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-09-23 21:18:00,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-09-23 21:18:00,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 530. [2018-09-23 21:18:00,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-09-23 21:18:00,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1690 transitions. [2018-09-23 21:18:00,453 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1690 transitions. Word has length 8 [2018-09-23 21:18:00,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:00,453 INFO L480 AbstractCegarLoop]: Abstraction has 530 states and 1690 transitions. [2018-09-23 21:18:00,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:18:00,453 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1690 transitions. [2018-09-23 21:18:00,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:18:00,457 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:00,457 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:00,458 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:00,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:00,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656691, now seen corresponding path program 1 times [2018-09-23 21:18:00,459 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:00,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:00,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:00,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:00,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:00,951 WARN L178 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2018-09-23 21:18:01,618 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-23 21:18:01,619 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:01,619 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:18:01,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:18:01,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:18:01,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:18:01,620 INFO L87 Difference]: Start difference. First operand 530 states and 1690 transitions. Second operand 8 states. [2018-09-23 21:18:01,911 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-09-23 21:18:05,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:05,290 INFO L93 Difference]: Finished difference Result 1329 states and 3609 transitions. [2018-09-23 21:18:05,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-23 21:18:05,294 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 21:18:05,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:05,303 INFO L225 Difference]: With dead ends: 1329 [2018-09-23 21:18:05,303 INFO L226 Difference]: Without dead ends: 1323 [2018-09-23 21:18:05,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2018-09-23 21:18:05,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2018-09-23 21:18:05,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 626. [2018-09-23 21:18:05,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-09-23 21:18:05,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 2087 transitions. [2018-09-23 21:18:05,463 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 2087 transitions. Word has length 8 [2018-09-23 21:18:05,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:05,464 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 2087 transitions. [2018-09-23 21:18:05,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:18:05,464 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 2087 transitions. [2018-09-23 21:18:05,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:18:05,465 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:05,465 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:05,466 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:05,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:05,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656688, now seen corresponding path program 1 times [2018-09-23 21:18:05,466 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:05,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:05,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:05,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:05,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:05,571 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-23 21:18:05,571 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:05,571 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:18:05,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:18:05,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:18:05,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:18:05,573 INFO L87 Difference]: Start difference. First operand 626 states and 2087 transitions. Second operand 8 states. [2018-09-23 21:18:07,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:07,956 INFO L93 Difference]: Finished difference Result 1268 states and 3539 transitions. [2018-09-23 21:18:07,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-23 21:18:07,957 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 21:18:07,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:07,964 INFO L225 Difference]: With dead ends: 1268 [2018-09-23 21:18:07,964 INFO L226 Difference]: Without dead ends: 1262 [2018-09-23 21:18:07,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2018-09-23 21:18:07,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2018-09-23 21:18:08,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 618. [2018-09-23 21:18:08,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-09-23 21:18:08,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 2056 transitions. [2018-09-23 21:18:08,138 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 2056 transitions. Word has length 8 [2018-09-23 21:18:08,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:08,138 INFO L480 AbstractCegarLoop]: Abstraction has 618 states and 2056 transitions. [2018-09-23 21:18:08,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:18:08,138 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 2056 transitions. [2018-09-23 21:18:08,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:18:08,140 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:08,140 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:08,140 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:08,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:08,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285639, now seen corresponding path program 1 times [2018-09-23 21:18:08,141 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:08,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:08,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:08,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:08,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:08,388 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-23 21:18:08,388 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:08,389 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:18:08,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:18:08,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:18:08,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:18:08,390 INFO L87 Difference]: Start difference. First operand 618 states and 2056 transitions. Second operand 8 states. [2018-09-23 21:18:11,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:11,004 INFO L93 Difference]: Finished difference Result 1367 states and 3876 transitions. [2018-09-23 21:18:11,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-23 21:18:11,004 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 21:18:11,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:11,012 INFO L225 Difference]: With dead ends: 1367 [2018-09-23 21:18:11,012 INFO L226 Difference]: Without dead ends: 1361 [2018-09-23 21:18:11,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2018-09-23 21:18:11,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2018-09-23 21:18:11,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 671. [2018-09-23 21:18:11,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2018-09-23 21:18:11,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 2249 transitions. [2018-09-23 21:18:11,189 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 2249 transitions. Word has length 8 [2018-09-23 21:18:11,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:11,190 INFO L480 AbstractCegarLoop]: Abstraction has 671 states and 2249 transitions. [2018-09-23 21:18:11,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:18:11,190 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 2249 transitions. [2018-09-23 21:18:11,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:18:11,191 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:11,191 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:11,191 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:11,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:11,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285636, now seen corresponding path program 1 times [2018-09-23 21:18:11,192 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:11,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:11,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:11,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:11,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:11,299 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-23 21:18:11,300 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:11,300 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:18:11,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:18:11,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:18:11,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:18:11,301 INFO L87 Difference]: Start difference. First operand 671 states and 2249 transitions. Second operand 8 states. [2018-09-23 21:18:14,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:14,461 INFO L93 Difference]: Finished difference Result 1373 states and 3787 transitions. [2018-09-23 21:18:14,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-23 21:18:14,461 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 21:18:14,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:14,471 INFO L225 Difference]: With dead ends: 1373 [2018-09-23 21:18:14,471 INFO L226 Difference]: Without dead ends: 1367 [2018-09-23 21:18:14,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2018-09-23 21:18:14,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-09-23 21:18:14,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 698. [2018-09-23 21:18:14,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-09-23 21:18:14,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 2344 transitions. [2018-09-23 21:18:14,694 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 2344 transitions. Word has length 8 [2018-09-23 21:18:14,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:14,694 INFO L480 AbstractCegarLoop]: Abstraction has 698 states and 2344 transitions. [2018-09-23 21:18:14,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:18:14,695 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 2344 transitions. [2018-09-23 21:18:14,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:18:14,696 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:14,696 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:14,697 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:14,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:14,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280348, now seen corresponding path program 1 times [2018-09-23 21:18:14,697 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:14,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:14,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:14,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:14,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:14,823 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-23 21:18:14,823 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:14,823 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-23 21:18:14,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 21:18:14,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 21:18:14,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-23 21:18:14,825 INFO L87 Difference]: Start difference. First operand 698 states and 2344 transitions. Second operand 7 states. [2018-09-23 21:18:17,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:17,054 INFO L93 Difference]: Finished difference Result 1526 states and 4298 transitions. [2018-09-23 21:18:17,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-23 21:18:17,054 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-23 21:18:17,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:17,062 INFO L225 Difference]: With dead ends: 1526 [2018-09-23 21:18:17,062 INFO L226 Difference]: Without dead ends: 1520 [2018-09-23 21:18:17,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-09-23 21:18:17,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2018-09-23 21:18:17,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 789. [2018-09-23 21:18:17,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-09-23 21:18:17,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 2673 transitions. [2018-09-23 21:18:17,310 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 2673 transitions. Word has length 8 [2018-09-23 21:18:17,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:17,310 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 2673 transitions. [2018-09-23 21:18:17,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 21:18:17,310 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 2673 transitions. [2018-09-23 21:18:17,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:18:17,311 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:17,311 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:17,312 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:17,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:17,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280221, now seen corresponding path program 1 times [2018-09-23 21:18:17,313 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:17,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:17,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:17,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:17,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:17,651 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-23 21:18:17,651 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:17,651 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-23 21:18:17,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 21:18:17,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 21:18:17,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-23 21:18:17,653 INFO L87 Difference]: Start difference. First operand 789 states and 2673 transitions. Second operand 7 states. [2018-09-23 21:18:19,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:19,851 INFO L93 Difference]: Finished difference Result 1548 states and 4356 transitions. [2018-09-23 21:18:19,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 21:18:19,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-23 21:18:19,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:19,859 INFO L225 Difference]: With dead ends: 1548 [2018-09-23 21:18:19,859 INFO L226 Difference]: Without dead ends: 1542 [2018-09-23 21:18:19,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-09-23 21:18:19,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2018-09-23 21:18:20,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 821. [2018-09-23 21:18:20,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-09-23 21:18:20,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 2801 transitions. [2018-09-23 21:18:20,079 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 2801 transitions. Word has length 8 [2018-09-23 21:18:20,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:20,079 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 2801 transitions. [2018-09-23 21:18:20,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 21:18:20,079 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 2801 transitions. [2018-09-23 21:18:20,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:18:20,081 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:20,081 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:20,081 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:20,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:20,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878937, now seen corresponding path program 1 times [2018-09-23 21:18:20,082 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:20,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:20,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:20,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:20,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:20,220 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-23 21:18:20,220 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:20,220 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-23 21:18:20,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 21:18:20,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 21:18:20,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-23 21:18:20,221 INFO L87 Difference]: Start difference. First operand 821 states and 2801 transitions. Second operand 7 states. [2018-09-23 21:18:22,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:22,597 INFO L93 Difference]: Finished difference Result 1575 states and 4539 transitions. [2018-09-23 21:18:22,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-23 21:18:22,597 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-23 21:18:22,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:22,606 INFO L225 Difference]: With dead ends: 1575 [2018-09-23 21:18:22,606 INFO L226 Difference]: Without dead ends: 1569 [2018-09-23 21:18:22,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2018-09-23 21:18:22,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2018-09-23 21:18:22,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 849. [2018-09-23 21:18:22,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-09-23 21:18:22,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2913 transitions. [2018-09-23 21:18:22,895 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 2913 transitions. Word has length 8 [2018-09-23 21:18:22,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:22,895 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 2913 transitions. [2018-09-23 21:18:22,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 21:18:22,896 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 2913 transitions. [2018-09-23 21:18:22,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:18:22,897 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:22,897 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:22,897 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:22,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:22,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878810, now seen corresponding path program 1 times [2018-09-23 21:18:22,898 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:22,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:22,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:22,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:22,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:22,993 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-23 21:18:22,993 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:22,994 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-23 21:18:22,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 21:18:22,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 21:18:22,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-23 21:18:22,995 INFO L87 Difference]: Start difference. First operand 849 states and 2913 transitions. Second operand 7 states. [2018-09-23 21:18:25,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:25,112 INFO L93 Difference]: Finished difference Result 1597 states and 4579 transitions. [2018-09-23 21:18:25,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-23 21:18:25,112 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-23 21:18:25,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:25,123 INFO L225 Difference]: With dead ends: 1597 [2018-09-23 21:18:25,123 INFO L226 Difference]: Without dead ends: 1591 [2018-09-23 21:18:25,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-09-23 21:18:25,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-09-23 21:18:25,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 873. [2018-09-23 21:18:25,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-09-23 21:18:25,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 2993 transitions. [2018-09-23 21:18:25,389 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 2993 transitions. Word has length 8 [2018-09-23 21:18:25,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:25,389 INFO L480 AbstractCegarLoop]: Abstraction has 873 states and 2993 transitions. [2018-09-23 21:18:25,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 21:18:25,389 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 2993 transitions. [2018-09-23 21:18:25,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:18:25,390 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:25,391 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:25,391 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:25,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:25,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288024, now seen corresponding path program 1 times [2018-09-23 21:18:25,392 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:25,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:25,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:25,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:25,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:25,604 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-23 21:18:25,604 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:25,604 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-23 21:18:25,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 21:18:25,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 21:18:25,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-23 21:18:25,605 INFO L87 Difference]: Start difference. First operand 873 states and 2993 transitions. Second operand 7 states. [2018-09-23 21:18:27,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:27,831 INFO L93 Difference]: Finished difference Result 1726 states and 5211 transitions. [2018-09-23 21:18:27,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-23 21:18:27,832 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-23 21:18:27,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:27,841 INFO L225 Difference]: With dead ends: 1726 [2018-09-23 21:18:27,841 INFO L226 Difference]: Without dead ends: 1720 [2018-09-23 21:18:27,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-09-23 21:18:27,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2018-09-23 21:18:28,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1006. [2018-09-23 21:18:28,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2018-09-23 21:18:28,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 3474 transitions. [2018-09-23 21:18:28,173 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 3474 transitions. Word has length 8 [2018-09-23 21:18:28,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:28,174 INFO L480 AbstractCegarLoop]: Abstraction has 1006 states and 3474 transitions. [2018-09-23 21:18:28,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 21:18:28,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 3474 transitions. [2018-09-23 21:18:28,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:18:28,175 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:28,175 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:28,175 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:28,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:28,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288027, now seen corresponding path program 1 times [2018-09-23 21:18:28,176 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:28,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:28,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:28,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:28,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:28,310 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-23 21:18:28,310 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:28,310 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-23 21:18:28,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 21:18:28,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 21:18:28,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-23 21:18:28,312 INFO L87 Difference]: Start difference. First operand 1006 states and 3474 transitions. Second operand 7 states. [2018-09-23 21:18:30,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:30,750 INFO L93 Difference]: Finished difference Result 1758 states and 5203 transitions. [2018-09-23 21:18:30,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-23 21:18:30,751 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-23 21:18:30,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:30,757 INFO L225 Difference]: With dead ends: 1758 [2018-09-23 21:18:30,757 INFO L226 Difference]: Without dead ends: 1752 [2018-09-23 21:18:30,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-09-23 21:18:30,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2018-09-23 21:18:31,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1011. [2018-09-23 21:18:31,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-09-23 21:18:31,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 3493 transitions. [2018-09-23 21:18:31,114 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 3493 transitions. Word has length 8 [2018-09-23 21:18:31,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:31,114 INFO L480 AbstractCegarLoop]: Abstraction has 1011 states and 3493 transitions. [2018-09-23 21:18:31,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 21:18:31,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 3493 transitions. [2018-09-23 21:18:31,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:18:31,115 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:31,116 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:31,116 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:31,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:31,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746872, now seen corresponding path program 1 times [2018-09-23 21:18:31,117 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:31,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:31,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:31,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:31,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:31,242 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-23 21:18:31,242 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:31,242 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-23 21:18:31,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 21:18:31,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 21:18:31,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-23 21:18:31,244 INFO L87 Difference]: Start difference. First operand 1011 states and 3493 transitions. Second operand 7 states. [2018-09-23 21:18:34,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:34,123 INFO L93 Difference]: Finished difference Result 1867 states and 5608 transitions. [2018-09-23 21:18:34,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-23 21:18:34,124 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-23 21:18:34,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:34,130 INFO L225 Difference]: With dead ends: 1867 [2018-09-23 21:18:34,131 INFO L226 Difference]: Without dead ends: 1861 [2018-09-23 21:18:34,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-09-23 21:18:34,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2018-09-23 21:18:34,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1119. [2018-09-23 21:18:34,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2018-09-23 21:18:34,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 3931 transitions. [2018-09-23 21:18:34,543 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 3931 transitions. Word has length 8 [2018-09-23 21:18:34,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:34,543 INFO L480 AbstractCegarLoop]: Abstraction has 1119 states and 3931 transitions. [2018-09-23 21:18:34,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 21:18:34,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 3931 transitions. [2018-09-23 21:18:34,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:18:34,545 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:34,545 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:34,545 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:34,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:34,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746875, now seen corresponding path program 1 times [2018-09-23 21:18:34,546 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:34,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:34,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:34,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:34,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:34,656 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-23 21:18:34,656 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:34,656 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-23 21:18:34,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 21:18:34,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 21:18:34,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-23 21:18:34,657 INFO L87 Difference]: Start difference. First operand 1119 states and 3931 transitions. Second operand 7 states. [2018-09-23 21:18:37,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:37,772 INFO L93 Difference]: Finished difference Result 1968 states and 5829 transitions. [2018-09-23 21:18:37,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-23 21:18:37,774 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-23 21:18:37,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:37,782 INFO L225 Difference]: With dead ends: 1968 [2018-09-23 21:18:37,782 INFO L226 Difference]: Without dead ends: 1962 [2018-09-23 21:18:37,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-09-23 21:18:37,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2018-09-23 21:18:38,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1111. [2018-09-23 21:18:38,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2018-09-23 21:18:38,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 3891 transitions. [2018-09-23 21:18:38,333 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 3891 transitions. Word has length 8 [2018-09-23 21:18:38,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:38,334 INFO L480 AbstractCegarLoop]: Abstraction has 1111 states and 3891 transitions. [2018-09-23 21:18:38,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 21:18:38,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 3891 transitions. [2018-09-23 21:18:38,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:18:38,335 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:38,335 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:38,335 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:38,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:38,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1616407055, now seen corresponding path program 1 times [2018-09-23 21:18:38,335 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:38,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:38,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:38,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:38,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:38,458 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-23 21:18:38,458 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:38,459 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-23 21:18:38,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 21:18:38,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 21:18:38,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-23 21:18:38,459 INFO L87 Difference]: Start difference. First operand 1111 states and 3891 transitions. Second operand 7 states. [2018-09-23 21:18:41,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:41,162 INFO L93 Difference]: Finished difference Result 2001 states and 6001 transitions. [2018-09-23 21:18:41,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-23 21:18:41,162 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-23 21:18:41,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:41,169 INFO L225 Difference]: With dead ends: 2001 [2018-09-23 21:18:41,169 INFO L226 Difference]: Without dead ends: 1995 [2018-09-23 21:18:41,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-09-23 21:18:41,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2018-09-23 21:18:41,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1117. [2018-09-23 21:18:41,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2018-09-23 21:18:41,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 3909 transitions. [2018-09-23 21:18:41,692 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 3909 transitions. Word has length 8 [2018-09-23 21:18:41,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:41,692 INFO L480 AbstractCegarLoop]: Abstraction has 1117 states and 3909 transitions. [2018-09-23 21:18:41,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 21:18:41,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 3909 transitions. [2018-09-23 21:18:41,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:18:41,693 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:41,693 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:41,694 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:41,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:41,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1616406928, now seen corresponding path program 1 times [2018-09-23 21:18:41,694 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:41,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:41,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:41,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:41,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:41,765 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-23 21:18:41,765 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:41,765 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-23 21:18:41,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 21:18:41,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 21:18:41,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-23 21:18:41,767 INFO L87 Difference]: Start difference. First operand 1117 states and 3909 transitions. Second operand 7 states. [2018-09-23 21:18:44,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:44,278 INFO L93 Difference]: Finished difference Result 1708 states and 5233 transitions. [2018-09-23 21:18:44,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-23 21:18:44,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-23 21:18:44,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:44,283 INFO L225 Difference]: With dead ends: 1708 [2018-09-23 21:18:44,283 INFO L226 Difference]: Without dead ends: 1702 [2018-09-23 21:18:44,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-09-23 21:18:44,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2018-09-23 21:18:44,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1210. [2018-09-23 21:18:44,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2018-09-23 21:18:44,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 4307 transitions. [2018-09-23 21:18:44,811 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 4307 transitions. Word has length 8 [2018-09-23 21:18:44,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:44,811 INFO L480 AbstractCegarLoop]: Abstraction has 1210 states and 4307 transitions. [2018-09-23 21:18:44,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 21:18:44,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 4307 transitions. [2018-09-23 21:18:44,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:18:44,813 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:44,813 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:44,813 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:44,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:44,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256941, now seen corresponding path program 1 times [2018-09-23 21:18:44,814 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:44,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:44,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:44,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:44,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:44,895 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-23 21:18:44,896 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:44,896 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-23 21:18:44,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 21:18:44,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 21:18:44,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-23 21:18:44,897 INFO L87 Difference]: Start difference. First operand 1210 states and 4307 transitions. Second operand 7 states. [2018-09-23 21:18:48,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:48,414 INFO L93 Difference]: Finished difference Result 2402 states and 7321 transitions. [2018-09-23 21:18:48,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 21:18:48,415 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-23 21:18:48,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:48,421 INFO L225 Difference]: With dead ends: 2402 [2018-09-23 21:18:48,421 INFO L226 Difference]: Without dead ends: 2396 [2018-09-23 21:18:48,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-09-23 21:18:48,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2018-09-23 21:18:49,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1341. [2018-09-23 21:18:49,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-09-23 21:18:49,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 4862 transitions. [2018-09-23 21:18:49,030 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 4862 transitions. Word has length 8 [2018-09-23 21:18:49,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:49,030 INFO L480 AbstractCegarLoop]: Abstraction has 1341 states and 4862 transitions. [2018-09-23 21:18:49,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 21:18:49,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 4862 transitions. [2018-09-23 21:18:49,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:18:49,031 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:49,031 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:49,032 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:49,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:49,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256944, now seen corresponding path program 1 times [2018-09-23 21:18:49,032 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:49,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:49,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:49,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:49,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:49,436 WARN L178 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2018-09-23 21:18:49,630 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-23 21:18:49,631 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:49,631 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-23 21:18:49,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 21:18:49,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 21:18:49,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-23 21:18:49,632 INFO L87 Difference]: Start difference. First operand 1341 states and 4862 transitions. Second operand 7 states. [2018-09-23 21:18:52,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:52,816 INFO L93 Difference]: Finished difference Result 2274 states and 6934 transitions. [2018-09-23 21:18:52,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-23 21:18:52,816 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-23 21:18:52,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:52,821 INFO L225 Difference]: With dead ends: 2274 [2018-09-23 21:18:52,821 INFO L226 Difference]: Without dead ends: 2268 [2018-09-23 21:18:52,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-09-23 21:18:52,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2018-09-23 21:18:53,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 1337. [2018-09-23 21:18:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-09-23 21:18:53,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 4840 transitions. [2018-09-23 21:18:53,511 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 4840 transitions. Word has length 8 [2018-09-23 21:18:53,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:53,511 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 4840 transitions. [2018-09-23 21:18:53,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 21:18:53,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 4840 transitions. [2018-09-23 21:18:53,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:18:53,512 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:53,513 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-09-23 21:18:53,513 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:53,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:53,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1621267991, now seen corresponding path program 1 times [2018-09-23 21:18:53,513 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:53,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:53,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:53,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:53,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:53,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:18:53,563 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:53,563 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-23 21:18:53,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-23 21:18:53,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-23 21:18:53,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-23 21:18:53,564 INFO L87 Difference]: Start difference. First operand 1337 states and 4840 transitions. Second operand 4 states. [2018-09-23 21:18:54,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:54,510 INFO L93 Difference]: Finished difference Result 2170 states and 7637 transitions. [2018-09-23 21:18:54,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-23 21:18:54,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-09-23 21:18:54,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:54,513 INFO L225 Difference]: With dead ends: 2170 [2018-09-23 21:18:54,513 INFO L226 Difference]: Without dead ends: 1253 [2018-09-23 21:18:54,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-23 21:18:54,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2018-09-23 21:18:55,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1080. [2018-09-23 21:18:55,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2018-09-23 21:18:55,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 3769 transitions. [2018-09-23 21:18:55,007 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 3769 transitions. Word has length 8 [2018-09-23 21:18:55,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:55,007 INFO L480 AbstractCegarLoop]: Abstraction has 1080 states and 3769 transitions. [2018-09-23 21:18:55,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-23 21:18:55,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 3769 transitions. [2018-09-23 21:18:55,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:18:55,008 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:55,008 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:55,009 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:55,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:55,009 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283460, now seen corresponding path program 1 times [2018-09-23 21:18:55,009 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:55,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:55,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:55,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:55,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:55,149 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-23 21:18:55,150 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:55,150 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:18:55,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:18:55,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:18:55,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:18:55,151 INFO L87 Difference]: Start difference. First operand 1080 states and 3769 transitions. Second operand 8 states. [2018-09-23 21:18:59,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:59,049 INFO L93 Difference]: Finished difference Result 2095 states and 6316 transitions. [2018-09-23 21:18:59,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-23 21:18:59,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 21:18:59,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:59,053 INFO L225 Difference]: With dead ends: 2095 [2018-09-23 21:18:59,053 INFO L226 Difference]: Without dead ends: 2093 [2018-09-23 21:18:59,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-09-23 21:18:59,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2018-09-23 21:18:59,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1161. [2018-09-23 21:18:59,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2018-09-23 21:18:59,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 4123 transitions. [2018-09-23 21:18:59,606 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 4123 transitions. Word has length 8 [2018-09-23 21:18:59,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:59,606 INFO L480 AbstractCegarLoop]: Abstraction has 1161 states and 4123 transitions. [2018-09-23 21:18:59,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:18:59,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 4123 transitions. [2018-09-23 21:18:59,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:18:59,607 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:59,607 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:59,607 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:59,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:59,608 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283333, now seen corresponding path program 1 times [2018-09-23 21:18:59,608 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:59,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:59,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:59,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:59,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:59,807 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-23 21:18:59,807 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:59,807 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:18:59,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:18:59,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:18:59,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:18:59,808 INFO L87 Difference]: Start difference. First operand 1161 states and 4123 transitions. Second operand 8 states. [2018-09-23 21:19:03,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:19:03,587 INFO L93 Difference]: Finished difference Result 1994 states and 5988 transitions. [2018-09-23 21:19:03,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 21:19:03,588 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 21:19:03,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:19:03,592 INFO L225 Difference]: With dead ends: 1994 [2018-09-23 21:19:03,592 INFO L226 Difference]: Without dead ends: 1988 [2018-09-23 21:19:03,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-09-23 21:19:03,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2018-09-23 21:19:04,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1152. [2018-09-23 21:19:04,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2018-09-23 21:19:04,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 4099 transitions. [2018-09-23 21:19:04,259 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 4099 transitions. Word has length 8 [2018-09-23 21:19:04,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:19:04,260 INFO L480 AbstractCegarLoop]: Abstraction has 1152 states and 4099 transitions. [2018-09-23 21:19:04,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:19:04,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 4099 transitions. [2018-09-23 21:19:04,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:19:04,261 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:19:04,261 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:19:04,261 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:19:04,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:19:04,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1867882049, now seen corresponding path program 1 times [2018-09-23 21:19:04,262 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:19:04,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:19:04,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:19:04,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:19:04,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:19:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:19:04,419 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-23 21:19:04,419 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:19:04,419 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:19:04,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:19:04,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:19:04,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:19:04,420 INFO L87 Difference]: Start difference. First operand 1152 states and 4099 transitions. Second operand 8 states. [2018-09-23 21:19:08,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:19:08,690 INFO L93 Difference]: Finished difference Result 2160 states and 6516 transitions. [2018-09-23 21:19:08,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-23 21:19:08,690 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 21:19:08,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:19:08,696 INFO L225 Difference]: With dead ends: 2160 [2018-09-23 21:19:08,696 INFO L226 Difference]: Without dead ends: 2154 [2018-09-23 21:19:08,697 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2018-09-23 21:19:08,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2018-09-23 21:19:09,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1174. [2018-09-23 21:19:09,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2018-09-23 21:19:09,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 4164 transitions. [2018-09-23 21:19:09,338 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 4164 transitions. Word has length 8 [2018-09-23 21:19:09,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:19:09,338 INFO L480 AbstractCegarLoop]: Abstraction has 1174 states and 4164 transitions. [2018-09-23 21:19:09,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:19:09,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 4164 transitions. [2018-09-23 21:19:09,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:19:09,339 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:19:09,339 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:19:09,340 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:19:09,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:19:09,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1867881922, now seen corresponding path program 1 times [2018-09-23 21:19:09,340 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:19:09,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:19:09,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:19:09,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:19:09,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:19:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:19:09,494 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-23 21:19:09,494 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:19:09,494 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:19:09,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:19:09,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:19:09,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:19:09,495 INFO L87 Difference]: Start difference. First operand 1174 states and 4164 transitions. Second operand 8 states. [2018-09-23 21:19:13,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:19:13,792 INFO L93 Difference]: Finished difference Result 2094 states and 6271 transitions. [2018-09-23 21:19:13,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 21:19:13,793 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 21:19:13,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:19:13,797 INFO L225 Difference]: With dead ends: 2094 [2018-09-23 21:19:13,797 INFO L226 Difference]: Without dead ends: 2088 [2018-09-23 21:19:13,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-09-23 21:19:13,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2018-09-23 21:19:14,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 1153. [2018-09-23 21:19:14,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2018-09-23 21:19:14,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 4095 transitions. [2018-09-23 21:19:14,457 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 4095 transitions. Word has length 8 [2018-09-23 21:19:14,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:19:14,458 INFO L480 AbstractCegarLoop]: Abstraction has 1153 states and 4095 transitions. [2018-09-23 21:19:14,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:19:14,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 4095 transitions. [2018-09-23 21:19:14,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:19:14,459 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:19:14,459 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-09-23 21:19:14,459 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:19:14,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:19:14,459 INFO L82 PathProgramCache]: Analyzing trace with hash -896988374, now seen corresponding path program 1 times [2018-09-23 21:19:14,460 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:19:14,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:19:14,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:19:14,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:19:14,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:19:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:19:14,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:19:14,554 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:19:14,554 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-23 21:19:14,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-23 21:19:14,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-23 21:19:14,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-23 21:19:14,555 INFO L87 Difference]: Start difference. First operand 1153 states and 4095 transitions. Second operand 4 states. [2018-09-23 21:19:15,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:19:15,548 INFO L93 Difference]: Finished difference Result 1929 states and 6604 transitions. [2018-09-23 21:19:15,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-23 21:19:15,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-09-23 21:19:15,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:19:15,551 INFO L225 Difference]: With dead ends: 1929 [2018-09-23 21:19:15,551 INFO L226 Difference]: Without dead ends: 1400 [2018-09-23 21:19:15,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-23 21:19:15,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2018-09-23 21:19:16,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1083. [2018-09-23 21:19:16,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2018-09-23 21:19:16,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 3765 transitions. [2018-09-23 21:19:16,320 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 3765 transitions. Word has length 8 [2018-09-23 21:19:16,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:19:16,320 INFO L480 AbstractCegarLoop]: Abstraction has 1083 states and 3765 transitions. [2018-09-23 21:19:16,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-23 21:19:16,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 3765 transitions. [2018-09-23 21:19:16,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:19:16,321 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:19:16,321 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:19:16,321 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:19:16,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:19:16,322 INFO L82 PathProgramCache]: Analyzing trace with hash -896379114, now seen corresponding path program 1 times [2018-09-23 21:19:16,322 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:19:16,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:19:16,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:19:16,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:19:16,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:19:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:19:16,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:19:16,446 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:19:16,446 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:19:16,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:19:16,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:19:16,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:19:16,447 INFO L87 Difference]: Start difference. First operand 1083 states and 3765 transitions. Second operand 8 states. [2018-09-23 21:19:20,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:19:20,279 INFO L93 Difference]: Finished difference Result 2276 states and 6948 transitions. [2018-09-23 21:19:20,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-23 21:19:20,279 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 21:19:20,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:19:20,284 INFO L225 Difference]: With dead ends: 2276 [2018-09-23 21:19:20,284 INFO L226 Difference]: Without dead ends: 2270 [2018-09-23 21:19:20,285 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-09-23 21:19:20,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2018-09-23 21:19:21,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 1266. [2018-09-23 21:19:21,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2018-09-23 21:19:21,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 4418 transitions. [2018-09-23 21:19:21,071 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 4418 transitions. Word has length 8 [2018-09-23 21:19:21,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:19:21,071 INFO L480 AbstractCegarLoop]: Abstraction has 1266 states and 4418 transitions. [2018-09-23 21:19:21,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:19:21,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 4418 transitions. [2018-09-23 21:19:21,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:19:21,072 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:19:21,073 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:19:21,073 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:19:21,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:19:21,073 INFO L82 PathProgramCache]: Analyzing trace with hash -896379111, now seen corresponding path program 1 times [2018-09-23 21:19:21,073 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:19:21,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:19:21,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:19:21,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:19:21,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:19:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:19:21,172 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-23 21:19:21,173 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:19:21,173 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:19:21,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:19:21,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:19:21,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:19:21,174 INFO L87 Difference]: Start difference. First operand 1266 states and 4418 transitions. Second operand 8 states. [2018-09-23 21:19:25,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:19:25,497 INFO L93 Difference]: Finished difference Result 2425 states and 7363 transitions. [2018-09-23 21:19:25,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-23 21:19:25,497 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 21:19:25,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:19:25,503 INFO L225 Difference]: With dead ends: 2425 [2018-09-23 21:19:25,503 INFO L226 Difference]: Without dead ends: 2419 [2018-09-23 21:19:25,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2018-09-23 21:19:25,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2018-09-23 21:19:26,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 1373. [2018-09-23 21:19:26,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2018-09-23 21:19:26,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 4822 transitions. [2018-09-23 21:19:26,520 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 4822 transitions. Word has length 8 [2018-09-23 21:19:26,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:19:26,520 INFO L480 AbstractCegarLoop]: Abstraction has 1373 states and 4822 transitions. [2018-09-23 21:19:26,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:19:26,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 4822 transitions. [2018-09-23 21:19:26,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:19:26,522 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:19:26,522 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:19:26,522 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:19:26,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:19:26,522 INFO L82 PathProgramCache]: Analyzing trace with hash -881085998, now seen corresponding path program 1 times [2018-09-23 21:19:26,523 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:19:26,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:19:26,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:19:26,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:19:26,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:19:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:19:26,615 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-23 21:19:26,615 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:19:26,615 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:19:26,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:19:26,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:19:26,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:19:26,616 INFO L87 Difference]: Start difference. First operand 1373 states and 4822 transitions. Second operand 8 states. [2018-09-23 21:19:31,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:19:31,321 INFO L93 Difference]: Finished difference Result 2278 states and 6952 transitions. [2018-09-23 21:19:31,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-23 21:19:31,321 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 21:19:31,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:19:31,327 INFO L225 Difference]: With dead ends: 2278 [2018-09-23 21:19:31,327 INFO L226 Difference]: Without dead ends: 2272 [2018-09-23 21:19:31,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-09-23 21:19:31,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2018-09-23 21:19:32,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1421. [2018-09-23 21:19:32,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2018-09-23 21:19:32,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 4963 transitions. [2018-09-23 21:19:32,356 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 4963 transitions. Word has length 8 [2018-09-23 21:19:32,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:19:32,356 INFO L480 AbstractCegarLoop]: Abstraction has 1421 states and 4963 transitions. [2018-09-23 21:19:32,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:19:32,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 4963 transitions. [2018-09-23 21:19:32,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:19:32,358 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:19:32,358 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:19:32,358 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:19:32,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:19:32,358 INFO L82 PathProgramCache]: Analyzing trace with hash -881086125, now seen corresponding path program 1 times [2018-09-23 21:19:32,358 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:19:32,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:19:32,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:19:32,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:19:32,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:19:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:19:32,496 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-23 21:19:32,497 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:19:32,497 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:19:32,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:19:32,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:19:32,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:19:32,498 INFO L87 Difference]: Start difference. First operand 1421 states and 4963 transitions. Second operand 8 states. [2018-09-23 21:19:36,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:19:36,758 INFO L93 Difference]: Finished difference Result 2233 states and 6848 transitions. [2018-09-23 21:19:36,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-23 21:19:36,758 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 21:19:36,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:19:36,763 INFO L225 Difference]: With dead ends: 2233 [2018-09-23 21:19:36,763 INFO L226 Difference]: Without dead ends: 2227 [2018-09-23 21:19:36,764 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-09-23 21:19:36,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2018-09-23 21:19:37,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 1411. [2018-09-23 21:19:37,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2018-09-23 21:19:37,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 4926 transitions. [2018-09-23 21:19:37,774 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 4926 transitions. Word has length 8 [2018-09-23 21:19:37,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:19:37,774 INFO L480 AbstractCegarLoop]: Abstraction has 1411 states and 4926 transitions. [2018-09-23 21:19:37,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:19:37,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 4926 transitions. [2018-09-23 21:19:37,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:19:37,775 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:19:37,775 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:19:37,776 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:19:37,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:19:37,776 INFO L82 PathProgramCache]: Analyzing trace with hash 2077099334, now seen corresponding path program 1 times [2018-09-23 21:19:37,776 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:19:37,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:19:37,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:19:37,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:19:37,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:19:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:19:38,053 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-23 21:19:38,053 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:19:38,053 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:19:38,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:19:38,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:19:38,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:19:38,055 INFO L87 Difference]: Start difference. First operand 1411 states and 4926 transitions. Second operand 8 states. [2018-09-23 21:19:42,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:19:42,731 INFO L93 Difference]: Finished difference Result 2558 states and 7836 transitions. [2018-09-23 21:19:42,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-23 21:19:42,732 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 21:19:42,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:19:42,737 INFO L225 Difference]: With dead ends: 2558 [2018-09-23 21:19:42,737 INFO L226 Difference]: Without dead ends: 2552 [2018-09-23 21:19:42,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-09-23 21:19:42,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2018-09-23 21:19:43,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 1471. [2018-09-23 21:19:43,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2018-09-23 21:19:43,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 5183 transitions. [2018-09-23 21:19:43,807 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 5183 transitions. Word has length 8 [2018-09-23 21:19:43,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:19:43,807 INFO L480 AbstractCegarLoop]: Abstraction has 1471 states and 5183 transitions. [2018-09-23 21:19:43,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:19:43,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 5183 transitions. [2018-09-23 21:19:43,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:19:43,808 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:19:43,808 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:19:43,809 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:19:43,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:19:43,809 INFO L82 PathProgramCache]: Analyzing trace with hash 2077099337, now seen corresponding path program 1 times [2018-09-23 21:19:43,809 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:19:43,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:19:43,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:19:43,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:19:43,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:19:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:19:43,957 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-23 21:19:43,957 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:19:43,957 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:19:43,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:19:43,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:19:43,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:19:43,958 INFO L87 Difference]: Start difference. First operand 1471 states and 5183 transitions. Second operand 8 states. [2018-09-23 21:19:48,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:19:48,783 INFO L93 Difference]: Finished difference Result 2703 states and 8278 transitions. [2018-09-23 21:19:48,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 21:19:48,783 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 21:19:48,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:19:48,789 INFO L225 Difference]: With dead ends: 2703 [2018-09-23 21:19:48,789 INFO L226 Difference]: Without dead ends: 2697 [2018-09-23 21:19:48,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-09-23 21:19:48,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2018-09-23 21:19:49,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1480. [2018-09-23 21:19:49,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-09-23 21:19:49,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 5200 transitions. [2018-09-23 21:19:49,908 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 5200 transitions. Word has length 8 [2018-09-23 21:19:49,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:19:49,908 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 5200 transitions. [2018-09-23 21:19:49,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:19:49,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 5200 transitions. [2018-09-23 21:19:49,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:19:49,909 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:19:49,909 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:19:49,909 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:19:49,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:19:49,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1638629971, now seen corresponding path program 1 times [2018-09-23 21:19:49,910 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:19:49,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:19:49,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:19:49,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:19:49,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:19:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:19:50,030 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-23 21:19:50,031 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:19:50,031 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:19:50,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:19:50,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:19:50,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:19:50,032 INFO L87 Difference]: Start difference. First operand 1480 states and 5200 transitions. Second operand 8 states. [2018-09-23 21:19:55,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:19:55,260 INFO L93 Difference]: Finished difference Result 2674 states and 8171 transitions. [2018-09-23 21:19:55,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 21:19:55,261 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 21:19:55,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:19:55,267 INFO L225 Difference]: With dead ends: 2674 [2018-09-23 21:19:55,267 INFO L226 Difference]: Without dead ends: 2668 [2018-09-23 21:19:55,268 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-09-23 21:19:55,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2018-09-23 21:19:56,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 1480. [2018-09-23 21:19:56,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-09-23 21:19:56,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 5196 transitions. [2018-09-23 21:19:56,467 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 5196 transitions. Word has length 8 [2018-09-23 21:19:56,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:19:56,467 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 5196 transitions. [2018-09-23 21:19:56,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:19:56,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 5196 transitions. [2018-09-23 21:19:56,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:19:56,468 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:19:56,468 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:19:56,468 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:19:56,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:19:56,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1638629974, now seen corresponding path program 1 times [2018-09-23 21:19:56,469 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:19:56,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:19:56,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:19:56,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:19:56,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:19:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:19:56,934 WARN L178 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 7 [2018-09-23 21:19:57,010 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-23 21:19:57,010 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:19:57,010 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:19:57,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:19:57,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:19:57,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:19:57,011 INFO L87 Difference]: Start difference. First operand 1480 states and 5196 transitions. Second operand 8 states. [2018-09-23 21:20:02,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:20:02,552 INFO L93 Difference]: Finished difference Result 2722 states and 8299 transitions. [2018-09-23 21:20:02,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-23 21:20:02,552 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 21:20:02,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:20:02,558 INFO L225 Difference]: With dead ends: 2722 [2018-09-23 21:20:02,558 INFO L226 Difference]: Without dead ends: 2716 [2018-09-23 21:20:02,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2018-09-23 21:20:02,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2018-09-23 21:20:03,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 1462. [2018-09-23 21:20:03,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1462 states. [2018-09-23 21:20:03,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 5124 transitions. [2018-09-23 21:20:03,782 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 5124 transitions. Word has length 8 [2018-09-23 21:20:03,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:20:03,782 INFO L480 AbstractCegarLoop]: Abstraction has 1462 states and 5124 transitions. [2018-09-23 21:20:03,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:20:03,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 5124 transitions. [2018-09-23 21:20:03,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 21:20:03,783 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:20:03,783 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:20:03,784 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:20:03,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:20:03,784 INFO L82 PathProgramCache]: Analyzing trace with hash 278041308, now seen corresponding path program 1 times [2018-09-23 21:20:03,784 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:20:03,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:20:03,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:20:03,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:20:03,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:20:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:20:04,075 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-23 21:20:04,075 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:20:04,075 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:20:04,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:20:04,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:20:04,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:20:04,076 INFO L87 Difference]: Start difference. First operand 1462 states and 5124 transitions. Second operand 8 states. [2018-09-23 21:20:09,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:20:09,164 INFO L93 Difference]: Finished difference Result 2962 states and 9218 transitions. [2018-09-23 21:20:09,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-23 21:20:09,164 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-23 21:20:09,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:20:09,170 INFO L225 Difference]: With dead ends: 2962 [2018-09-23 21:20:09,170 INFO L226 Difference]: Without dead ends: 2956 [2018-09-23 21:20:09,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-09-23 21:20:09,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2018-09-23 21:20:10,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1776. [2018-09-23 21:20:10,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1776 states. [2018-09-23 21:20:10,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 6236 transitions. [2018-09-23 21:20:10,655 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 6236 transitions. Word has length 9 [2018-09-23 21:20:10,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:20:10,655 INFO L480 AbstractCegarLoop]: Abstraction has 1776 states and 6236 transitions. [2018-09-23 21:20:10,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:20:10,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 6236 transitions. [2018-09-23 21:20:10,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 21:20:10,656 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:20:10,657 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:20:10,657 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:20:10,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:20:10,657 INFO L82 PathProgramCache]: Analyzing trace with hash 278041683, now seen corresponding path program 1 times [2018-09-23 21:20:10,657 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:20:10,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:20:10,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:20:10,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:20:10,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:20:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:20:10,733 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-23 21:20:10,733 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:20:10,733 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:20:10,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:20:10,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:20:10,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:20:10,734 INFO L87 Difference]: Start difference. First operand 1776 states and 6236 transitions. Second operand 8 states. [2018-09-23 21:20:15,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:20:15,911 INFO L93 Difference]: Finished difference Result 2948 states and 9162 transitions. [2018-09-23 21:20:15,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-23 21:20:15,912 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-23 21:20:15,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:20:15,917 INFO L225 Difference]: With dead ends: 2948 [2018-09-23 21:20:15,917 INFO L226 Difference]: Without dead ends: 2942 [2018-09-23 21:20:15,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-09-23 21:20:15,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2018-09-23 21:20:17,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1772. [2018-09-23 21:20:17,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2018-09-23 21:20:17,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 6220 transitions. [2018-09-23 21:20:17,331 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 6220 transitions. Word has length 9 [2018-09-23 21:20:17,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:20:17,331 INFO L480 AbstractCegarLoop]: Abstraction has 1772 states and 6220 transitions. [2018-09-23 21:20:17,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:20:17,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 6220 transitions. [2018-09-23 21:20:17,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 21:20:17,333 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:20:17,333 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:20:17,333 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:20:17,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:20:17,333 INFO L82 PathProgramCache]: Analyzing trace with hash 541105076, now seen corresponding path program 1 times [2018-09-23 21:20:17,333 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:20:17,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:20:17,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:20:17,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:20:17,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:20:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:20:17,444 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-23 21:20:17,444 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:20:17,444 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:20:17,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:20:17,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:20:17,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:20:17,445 INFO L87 Difference]: Start difference. First operand 1772 states and 6220 transitions. Second operand 8 states. [2018-09-23 21:20:23,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:20:23,597 INFO L93 Difference]: Finished difference Result 3238 states and 9970 transitions. [2018-09-23 21:20:23,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 21:20:23,597 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-23 21:20:23,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:20:23,604 INFO L225 Difference]: With dead ends: 3238 [2018-09-23 21:20:23,604 INFO L226 Difference]: Without dead ends: 3232 [2018-09-23 21:20:23,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-09-23 21:20:23,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2018-09-23 21:20:25,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 1799. [2018-09-23 21:20:25,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2018-09-23 21:20:25,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 6288 transitions. [2018-09-23 21:20:25,304 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 6288 transitions. Word has length 9 [2018-09-23 21:20:25,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:20:25,305 INFO L480 AbstractCegarLoop]: Abstraction has 1799 states and 6288 transitions. [2018-09-23 21:20:25,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:20:25,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 6288 transitions. [2018-09-23 21:20:25,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 21:20:25,306 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:20:25,306 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:20:25,307 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:20:25,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:20:25,307 INFO L82 PathProgramCache]: Analyzing trace with hash 541105451, now seen corresponding path program 1 times [2018-09-23 21:20:25,307 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:20:25,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:20:25,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:20:25,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:20:25,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:20:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:20:25,401 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-23 21:20:25,402 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:20:25,402 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:20:25,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:20:25,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:20:25,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:20:25,403 INFO L87 Difference]: Start difference. First operand 1799 states and 6288 transitions. Second operand 8 states. [2018-09-23 21:20:31,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:20:31,851 INFO L93 Difference]: Finished difference Result 3212 states and 9854 transitions. [2018-09-23 21:20:31,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 21:20:31,851 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-23 21:20:31,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:20:31,857 INFO L225 Difference]: With dead ends: 3212 [2018-09-23 21:20:31,857 INFO L226 Difference]: Without dead ends: 3206 [2018-09-23 21:20:31,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-09-23 21:20:31,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2018-09-23 21:20:33,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 1737. [2018-09-23 21:20:33,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1737 states. [2018-09-23 21:20:33,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 6062 transitions. [2018-09-23 21:20:33,471 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 6062 transitions. Word has length 9 [2018-09-23 21:20:33,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:20:33,471 INFO L480 AbstractCegarLoop]: Abstraction has 1737 states and 6062 transitions. [2018-09-23 21:20:33,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:20:33,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 6062 transitions. [2018-09-23 21:20:33,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 21:20:33,472 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:20:33,472 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:20:33,472 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:20:33,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:20:33,473 INFO L82 PathProgramCache]: Analyzing trace with hash 825189368, now seen corresponding path program 1 times [2018-09-23 21:20:33,473 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:20:33,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:20:33,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:20:33,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:20:33,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:20:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:20:33,641 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-23 21:20:33,641 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:20:33,642 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:20:33,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:20:33,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:20:33,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:20:33,643 INFO L87 Difference]: Start difference. First operand 1737 states and 6062 transitions. Second operand 8 states. [2018-09-23 21:20:39,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:20:39,579 INFO L93 Difference]: Finished difference Result 3315 states and 10043 transitions. [2018-09-23 21:20:39,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-23 21:20:39,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-23 21:20:39,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:20:39,585 INFO L225 Difference]: With dead ends: 3315 [2018-09-23 21:20:39,585 INFO L226 Difference]: Without dead ends: 3309 [2018-09-23 21:20:39,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-09-23 21:20:39,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2018-09-23 21:20:41,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 1985. [2018-09-23 21:20:41,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1985 states. [2018-09-23 21:20:41,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 6886 transitions. [2018-09-23 21:20:41,440 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 6886 transitions. Word has length 9 [2018-09-23 21:20:41,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:20:41,440 INFO L480 AbstractCegarLoop]: Abstraction has 1985 states and 6886 transitions. [2018-09-23 21:20:41,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:20:41,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 6886 transitions. [2018-09-23 21:20:41,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 21:20:41,442 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:20:41,442 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:20:41,442 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:20:41,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:20:41,442 INFO L82 PathProgramCache]: Analyzing trace with hash 825189371, now seen corresponding path program 1 times [2018-09-23 21:20:41,442 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:20:41,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:20:41,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:20:41,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:20:41,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:20:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:20:41,551 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-23 21:20:41,551 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:20:41,552 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:20:41,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:20:41,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:20:41,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:20:41,553 INFO L87 Difference]: Start difference. First operand 1985 states and 6886 transitions. Second operand 8 states. [2018-09-23 21:20:48,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:20:48,138 INFO L93 Difference]: Finished difference Result 3446 states and 10415 transitions. [2018-09-23 21:20:48,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-23 21:20:48,138 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-23 21:20:48,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:20:48,145 INFO L225 Difference]: With dead ends: 3446 [2018-09-23 21:20:48,145 INFO L226 Difference]: Without dead ends: 3440 [2018-09-23 21:20:48,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-09-23 21:20:48,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3440 states. [2018-09-23 21:20:50,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3440 to 1927. [2018-09-23 21:20:50,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1927 states. [2018-09-23 21:20:50,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 6663 transitions. [2018-09-23 21:20:50,139 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 6663 transitions. Word has length 9 [2018-09-23 21:20:50,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:20:50,139 INFO L480 AbstractCegarLoop]: Abstraction has 1927 states and 6663 transitions. [2018-09-23 21:20:50,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:20:50,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 6663 transitions. [2018-09-23 21:20:50,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 21:20:50,140 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:20:50,141 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:20:50,141 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:20:50,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:20:50,141 INFO L82 PathProgramCache]: Analyzing trace with hash 832700792, now seen corresponding path program 1 times [2018-09-23 21:20:50,141 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:20:50,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:20:50,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:20:50,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:20:50,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:20:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:20:50,222 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-23 21:20:50,222 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:20:50,222 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:20:50,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:20:50,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:20:50,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:20:50,223 INFO L87 Difference]: Start difference. First operand 1927 states and 6663 transitions. Second operand 8 states. [2018-09-23 21:20:55,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:20:55,800 INFO L93 Difference]: Finished difference Result 2832 states and 8631 transitions. [2018-09-23 21:20:55,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-23 21:20:55,801 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-23 21:20:55,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:20:55,807 INFO L225 Difference]: With dead ends: 2832 [2018-09-23 21:20:55,807 INFO L226 Difference]: Without dead ends: 2824 [2018-09-23 21:20:55,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-09-23 21:20:55,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2824 states. [2018-09-23 21:20:57,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2824 to 1904. [2018-09-23 21:20:57,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1904 states. [2018-09-23 21:20:57,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 6553 transitions. [2018-09-23 21:20:57,778 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 6553 transitions. Word has length 9 [2018-09-23 21:20:57,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:20:57,778 INFO L480 AbstractCegarLoop]: Abstraction has 1904 states and 6553 transitions. [2018-09-23 21:20:57,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:20:57,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 6553 transitions. [2018-09-23 21:20:57,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 21:20:57,779 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:20:57,779 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:20:57,780 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:20:57,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:20:57,780 INFO L82 PathProgramCache]: Analyzing trace with hash -595843680, now seen corresponding path program 1 times [2018-09-23 21:20:57,780 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:20:57,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:20:57,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:20:57,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:20:57,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:20:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:20:57,872 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-23 21:20:57,873 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:20:57,873 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 21:20:57,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 21:20:57,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 21:20:57,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-09-23 21:20:57,874 INFO L87 Difference]: Start difference. First operand 1904 states and 6553 transitions. Second operand 9 states. [2018-09-23 21:21:03,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:21:03,951 INFO L93 Difference]: Finished difference Result 3157 states and 9716 transitions. [2018-09-23 21:21:03,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 21:21:03,952 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-23 21:21:03,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:21:03,957 INFO L225 Difference]: With dead ends: 3157 [2018-09-23 21:21:03,957 INFO L226 Difference]: Without dead ends: 3151 [2018-09-23 21:21:03,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2018-09-23 21:21:03,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2018-09-23 21:21:05,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 1949. [2018-09-23 21:21:05,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2018-09-23 21:21:05,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 6722 transitions. [2018-09-23 21:21:05,962 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 6722 transitions. Word has length 9 [2018-09-23 21:21:05,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:21:05,962 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 6722 transitions. [2018-09-23 21:21:05,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 21:21:05,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 6722 transitions. [2018-09-23 21:21:05,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 21:21:05,963 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:21:05,963 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:21:05,964 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:21:05,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:21:05,964 INFO L82 PathProgramCache]: Analyzing trace with hash -595843677, now seen corresponding path program 1 times [2018-09-23 21:21:05,964 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:21:05,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:21:05,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:21:05,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:21:05,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:21:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:21:06,076 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-23 21:21:06,076 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:21:06,076 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 21:21:06,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 21:21:06,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 21:21:06,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-09-23 21:21:06,077 INFO L87 Difference]: Start difference. First operand 1949 states and 6722 transitions. Second operand 9 states. [2018-09-23 21:21:14,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:21:14,672 INFO L93 Difference]: Finished difference Result 3822 states and 11523 transitions. [2018-09-23 21:21:14,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-23 21:21:14,672 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-23 21:21:14,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:21:14,680 INFO L225 Difference]: With dead ends: 3822 [2018-09-23 21:21:14,680 INFO L226 Difference]: Without dead ends: 3816 [2018-09-23 21:21:14,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=672, Unknown=0, NotChecked=0, Total=930 [2018-09-23 21:21:14,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3816 states. [2018-09-23 21:21:16,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 2098. [2018-09-23 21:21:16,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2018-09-23 21:21:16,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 7405 transitions. [2018-09-23 21:21:16,755 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 7405 transitions. Word has length 9 [2018-09-23 21:21:16,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:21:16,755 INFO L480 AbstractCegarLoop]: Abstraction has 2098 states and 7405 transitions. [2018-09-23 21:21:16,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 21:21:16,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 7405 transitions. [2018-09-23 21:21:16,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 21:21:16,757 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:21:16,757 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:21:16,758 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:21:16,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:21:16,758 INFO L82 PathProgramCache]: Analyzing trace with hash -204435682, now seen corresponding path program 1 times [2018-09-23 21:21:16,758 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:21:16,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:21:16,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:21:16,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:21:16,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:21:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:21:16,876 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-23 21:21:16,876 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:21:16,876 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 21:21:16,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 21:21:16,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 21:21:16,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-23 21:21:16,877 INFO L87 Difference]: Start difference. First operand 2098 states and 7405 transitions. Second operand 9 states. [2018-09-23 21:21:26,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:21:26,221 INFO L93 Difference]: Finished difference Result 4144 states and 12499 transitions. [2018-09-23 21:21:26,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-23 21:21:26,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-23 21:21:26,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:21:26,229 INFO L225 Difference]: With dead ends: 4144 [2018-09-23 21:21:26,229 INFO L226 Difference]: Without dead ends: 4138 [2018-09-23 21:21:26,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2018-09-23 21:21:26,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4138 states. [2018-09-23 21:21:28,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4138 to 2260. [2018-09-23 21:21:28,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2260 states. [2018-09-23 21:21:28,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 7995 transitions. [2018-09-23 21:21:28,847 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 7995 transitions. Word has length 9 [2018-09-23 21:21:28,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:21:28,847 INFO L480 AbstractCegarLoop]: Abstraction has 2260 states and 7995 transitions. [2018-09-23 21:21:28,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 21:21:28,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 7995 transitions. [2018-09-23 21:21:28,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 21:21:28,849 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:21:28,849 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:21:28,849 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:21:28,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:21:28,849 INFO L82 PathProgramCache]: Analyzing trace with hash -204435307, now seen corresponding path program 1 times [2018-09-23 21:21:28,850 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:21:28,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:21:28,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:21:28,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:21:28,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:21:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:21:29,008 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-23 21:21:29,008 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:21:29,008 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 21:21:29,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 21:21:29,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 21:21:29,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-23 21:21:29,009 INFO L87 Difference]: Start difference. First operand 2260 states and 7995 transitions. Second operand 9 states. [2018-09-23 21:21:36,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:21:36,335 INFO L93 Difference]: Finished difference Result 3320 states and 10163 transitions. [2018-09-23 21:21:36,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-23 21:21:36,335 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-23 21:21:36,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:21:36,341 INFO L225 Difference]: With dead ends: 3320 [2018-09-23 21:21:36,342 INFO L226 Difference]: Without dead ends: 3314 [2018-09-23 21:21:36,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2018-09-23 21:21:36,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3314 states. [2018-09-23 21:21:38,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3314 to 2191. [2018-09-23 21:21:38,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2191 states. [2018-09-23 21:21:38,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 2191 states and 7721 transitions. [2018-09-23 21:21:38,946 INFO L78 Accepts]: Start accepts. Automaton has 2191 states and 7721 transitions. Word has length 9 [2018-09-23 21:21:38,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:21:38,946 INFO L480 AbstractCegarLoop]: Abstraction has 2191 states and 7721 transitions. [2018-09-23 21:21:38,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 21:21:38,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 7721 transitions. [2018-09-23 21:21:38,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 21:21:38,948 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:21:38,948 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:21:38,948 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:21:38,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:21:38,949 INFO L82 PathProgramCache]: Analyzing trace with hash -966522519, now seen corresponding path program 1 times [2018-09-23 21:21:38,949 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:21:38,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:21:38,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:21:38,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:21:38,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:21:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:21:39,055 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-23 21:21:39,055 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:21:39,056 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:21:39,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:21:39,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:21:39,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:21:39,057 INFO L87 Difference]: Start difference. First operand 2191 states and 7721 transitions. Second operand 8 states. [2018-09-23 21:21:48,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:21:48,563 INFO L93 Difference]: Finished difference Result 4113 states and 13014 transitions. [2018-09-23 21:21:48,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-23 21:21:48,563 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-23 21:21:48,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:21:48,571 INFO L225 Difference]: With dead ends: 4113 [2018-09-23 21:21:48,571 INFO L226 Difference]: Without dead ends: 4107 [2018-09-23 21:21:48,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2018-09-23 21:21:48,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2018-09-23 21:21:51,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 2224. [2018-09-23 21:21:51,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2224 states. [2018-09-23 21:21:51,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 7857 transitions. [2018-09-23 21:21:51,257 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 7857 transitions. Word has length 9 [2018-09-23 21:21:51,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:21:51,257 INFO L480 AbstractCegarLoop]: Abstraction has 2224 states and 7857 transitions. [2018-09-23 21:21:51,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:21:51,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 7857 transitions. [2018-09-23 21:21:51,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 21:21:51,258 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:21:51,259 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:21:51,259 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr1ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:21:51,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:21:51,259 INFO L82 PathProgramCache]: Analyzing trace with hash -966522144, now seen corresponding path program 1 times [2018-09-23 21:21:51,259 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:21:51,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:21:51,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:21:51,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:21:51,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:21:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:21:51,369 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-23 21:21:51,370 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:21:51,370 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 21:21:51,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:21:51,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:21:51,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:21:51,371 INFO L87 Difference]: Start difference. First operand 2224 states and 7857 transitions. Second operand 8 states. Received shutdown request... [2018-09-23 21:21:52,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-23 21:21:52,678 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-23 21:21:52,684 WARN L206 ceAbstractionStarter]: Timeout [2018-09-23 21:21:52,684 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.09 09:21:52 BoogieIcfgContainer [2018-09-23 21:21:52,684 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-23 21:21:52,685 INFO L168 Benchmark]: Toolchain (without parser) took 262490.66 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.5 GB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 65.5 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-09-23 21:21:52,686 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 21:21:52,686 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.65 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-23 21:21:52,686 INFO L168 Benchmark]: Boogie Preprocessor took 52.49 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-23 21:21:52,687 INFO L168 Benchmark]: RCFGBuilder took 1105.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-23 21:21:52,687 INFO L168 Benchmark]: TraceAbstraction took 261268.28 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 23.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-09-23 21:21:52,690 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 56.65 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 52.49 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 1105.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 261268.28 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 23.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 95). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (299 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 816]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 816). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (299 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (299 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 194]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 194). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (299 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 584]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 584). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (299 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (299 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 800]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 800). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (299 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 574]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (299 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 624]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 624). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (299 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (299 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 316]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 316). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (299 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 599]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 599). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (299 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 847]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 847). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (299 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 223]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 223). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (299 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (299 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 337]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 337). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (299 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 199]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 199). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (299 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 604]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 604). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (299 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 71). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (299 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 470]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 470). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (299 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (299 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 446]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 446). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (299 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 263]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 263). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (299 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 832]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 832). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (299 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 594]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (299 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (299 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (299 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 27 error locations. TIMEOUT Result, 261.1s OverallTime, 53 OverallIterations, 2 TraceHistogramMax, 208.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14757 SDtfs, 26302 SDslu, 28253 SDs, 0 SdLazy, 100935 SolverSat, 9424 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 101.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 816 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 812 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2128 ImplicationChecksByTransitivity, 18.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2260occurred in iteration=50, 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: 42.6s AutomataMinimizationTime, 52 MinimizatonAttempts, 43801 StatesRemovedByMinimization, 52 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 428 NumberOfCodeBlocks, 428 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 375 ConstructedInterpolants, 0 QuantifiedInterpolants, 25219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 53 InterpolantComputations, 53 PerfectInterpolantSequences, 6/6 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_out3.mover.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-23_21-21-52-702.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out3.mover.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-23_21-21-52-702.csv Completed graceful shutdown