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_PUPT.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:24:45,929 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:24:45,931 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:24:45,949 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:24:45,950 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:24:45,951 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:24:45,954 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:24:45,956 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:24:45,959 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:24:45,968 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:24:45,969 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:24:45,970 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:24:45,973 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:24:45,975 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:24:45,976 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:24:45,977 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:24:45,980 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:24:45,981 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:24:45,986 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:24:45,989 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:24:45,990 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:24:45,991 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:24:45,999 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:24:46,001 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:24:46,001 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:24:46,002 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:24:46,003 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:24:46,004 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:24:46,009 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:24:46,010 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:24:46,010 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:24:46,011 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:24:46,011 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:24:46,012 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:24:46,013 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:24:46,013 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:24:46,015 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-01 00:24:46,041 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:24:46,041 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:24:46,042 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:24:46,043 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:24:46,044 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:24:46,044 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:24:46,044 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:24:46,045 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:24:46,045 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:24:46,045 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:24:46,045 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:24:46,046 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:24:46,046 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:24:46,047 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:24:46,047 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:24:46,047 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:24:46,047 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:24:46,048 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:24:46,049 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:24:46,049 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:24:46,049 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:24:46,049 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:24:46,049 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:24:46,050 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:24:46,050 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:24:46,050 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:24:46,050 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:24:46,050 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:24:46,051 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:24:46,051 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:24:46,051 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:24:46,105 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:24:46,121 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:24:46,127 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:24:46,129 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:24:46,130 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:24:46,130 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-10-01 00:24:46,131 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl' [2018-10-01 00:24:46,215 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:24:46,220 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:24:46,221 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:24:46,221 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:24:46,221 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:24:46,241 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 01.10 12:24:46" (1/1) ... [2018-10-01 00:24:46,257 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 01.10 12:24:46" (1/1) ... [2018-10-01 00:24:46,262 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-01 00:24:46,262 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-01 00:24:46,263 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-01 00:24:46,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:24:46,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:24:46,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:24:46,267 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:24:46,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:46" (1/1) ... [2018-10-01 00:24:46,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:46" (1/1) ... [2018-10-01 00:24:46,281 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:46" (1/1) ... [2018-10-01 00:24:46,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:46" (1/1) ... [2018-10-01 00:24:46,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:46" (1/1) ... [2018-10-01 00:24:46,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:46" (1/1) ... [2018-10-01 00:24:46,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:46" (1/1) ... [2018-10-01 00:24:46,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:24:46,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:24:46,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:24:46,318 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:24:46,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:46" (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-10-01 00:24:46,399 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-01 00:24:46,399 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-01 00:24:46,399 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-01 00:24:47,519 INFO L345 CfgBuilder]: Using library mode [2018-10-01 00:24:47,520 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:24:47 BoogieIcfgContainer [2018-10-01 00:24:47,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:24:47,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:24:47,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:24:47,524 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:24:47,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:46" (1/2) ... [2018-10-01 00:24:47,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@828c456 and model type threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:24:47, skipping insertion in model container [2018-10-01 00:24:47,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:24:47" (2/2) ... [2018-10-01 00:24:47,528 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out3.mover.bpl [2018-10-01 00:24:47,538 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:24:47,547 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-10-01 00:24:47,601 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:24:47,601 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:24:47,602 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:24:47,602 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:24:47,602 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:24:47,602 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:24:47,602 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:24:47,602 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:24:47,603 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:24:47,625 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-10-01 00:24:47,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-01 00:24:47,633 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:47,634 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-01 00:24:47,636 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:47,643 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:47,643 INFO L82 PathProgramCache]: Analyzing trace with hash 45506320, now seen corresponding path program 1 times [2018-10-01 00:24:47,646 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:47,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:47,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:47,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:47,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:47,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:47,890 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:47,890 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:24:47,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:24:47,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:24:47,911 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:47,913 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 5 states. [2018-10-01 00:24:51,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:51,185 INFO L93 Difference]: Finished difference Result 142 states and 303 transitions. [2018-10-01 00:24:51,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:24:51,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-01 00:24:51,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:51,205 INFO L225 Difference]: With dead ends: 142 [2018-10-01 00:24:51,206 INFO L226 Difference]: Without dead ends: 138 [2018-10-01 00:24:51,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:24:51,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-01 00:24:51,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 98. [2018-10-01 00:24:51,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-01 00:24:51,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 219 transitions. [2018-10-01 00:24:51,272 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 219 transitions. Word has length 5 [2018-10-01 00:24:51,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:51,273 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 219 transitions. [2018-10-01 00:24:51,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:24:51,274 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 219 transitions. [2018-10-01 00:24:51,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-01 00:24:51,275 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:51,275 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-01 00:24:51,276 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:51,277 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:51,277 INFO L82 PathProgramCache]: Analyzing trace with hash 45756290, now seen corresponding path program 1 times [2018-10-01 00:24:51,277 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:51,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:51,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:51,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:51,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:51,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:51,400 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:51,400 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:24:51,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:24:51,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:24:51,403 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:51,403 INFO L87 Difference]: Start difference. First operand 98 states and 219 transitions. Second operand 5 states. [2018-10-01 00:24:55,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:55,385 INFO L93 Difference]: Finished difference Result 241 states and 539 transitions. [2018-10-01 00:24:55,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-01 00:24:55,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-01 00:24:55,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:55,392 INFO L225 Difference]: With dead ends: 241 [2018-10-01 00:24:55,392 INFO L226 Difference]: Without dead ends: 237 [2018-10-01 00:24:55,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:24:55,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-01 00:24:55,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 134. [2018-10-01 00:24:55,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-01 00:24:55,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 355 transitions. [2018-10-01 00:24:55,427 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 355 transitions. Word has length 5 [2018-10-01 00:24:55,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:55,427 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 355 transitions. [2018-10-01 00:24:55,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:24:55,427 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 355 transitions. [2018-10-01 00:24:55,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-01 00:24:55,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:55,428 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-01 00:24:55,429 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:55,429 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:55,430 INFO L82 PathProgramCache]: Analyzing trace with hash 28948051, now seen corresponding path program 1 times [2018-10-01 00:24:55,430 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:55,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:55,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:55,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:55,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:55,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:55,508 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:55,509 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:24:55,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:24:55,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:24:55,509 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:55,509 INFO L87 Difference]: Start difference. First operand 134 states and 355 transitions. Second operand 5 states. [2018-10-01 00:24:59,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:59,286 INFO L93 Difference]: Finished difference Result 269 states and 639 transitions. [2018-10-01 00:24:59,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-01 00:24:59,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-01 00:24:59,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:59,299 INFO L225 Difference]: With dead ends: 269 [2018-10-01 00:24:59,299 INFO L226 Difference]: Without dead ends: 265 [2018-10-01 00:24:59,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:24:59,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-10-01 00:24:59,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 162. [2018-10-01 00:24:59,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-01 00:24:59,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 455 transitions. [2018-10-01 00:24:59,342 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 455 transitions. Word has length 5 [2018-10-01 00:24:59,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:59,343 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 455 transitions. [2018-10-01 00:24:59,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:24:59,343 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 455 transitions. [2018-10-01 00:24:59,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:24:59,345 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:59,345 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:24:59,346 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:59,347 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:59,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558066, now seen corresponding path program 1 times [2018-10-01 00:24:59,347 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:59,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:59,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:59,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:59,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:59,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:59,456 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:59,457 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:24:59,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:24:59,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:24:59,457 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:59,458 INFO L87 Difference]: Start difference. First operand 162 states and 455 transitions. Second operand 8 states. [2018-10-01 00:25:09,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:09,359 INFO L93 Difference]: Finished difference Result 790 states and 2085 transitions. [2018-10-01 00:25:09,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-01 00:25:09,360 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-01 00:25:09,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:09,366 INFO L225 Difference]: With dead ends: 790 [2018-10-01 00:25:09,366 INFO L226 Difference]: Without dead ends: 629 [2018-10-01 00:25:09,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:25:09,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-10-01 00:25:09,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 278. [2018-10-01 00:25:09,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-10-01 00:25:09,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 854 transitions. [2018-10-01 00:25:09,426 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 854 transitions. Word has length 8 [2018-10-01 00:25:09,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:09,427 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 854 transitions. [2018-10-01 00:25:09,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:25:09,427 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 854 transitions. [2018-10-01 00:25:09,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:25:09,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:09,429 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:09,430 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:09,430 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:09,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558063, now seen corresponding path program 1 times [2018-10-01 00:25:09,431 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:09,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:09,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:09,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:09,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:09,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:09,548 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:25:09,548 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:25:09,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:25:09,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:25:09,549 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:09,550 INFO L87 Difference]: Start difference. First operand 278 states and 854 transitions. Second operand 8 states. [2018-10-01 00:25:20,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:20,193 INFO L93 Difference]: Finished difference Result 634 states and 1540 transitions. [2018-10-01 00:25:20,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:25:20,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-01 00:25:20,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:20,199 INFO L225 Difference]: With dead ends: 634 [2018-10-01 00:25:20,199 INFO L226 Difference]: Without dead ends: 628 [2018-10-01 00:25:20,200 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:25:20,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-10-01 00:25:20,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 310. [2018-10-01 00:25:20,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-10-01 00:25:20,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 963 transitions. [2018-10-01 00:25:20,255 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 963 transitions. Word has length 8 [2018-10-01 00:25:20,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:20,255 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 963 transitions. [2018-10-01 00:25:20,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:25:20,256 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 963 transitions. [2018-10-01 00:25:20,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:25:20,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:20,258 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:20,259 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:20,259 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:20,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1080099218, now seen corresponding path program 1 times [2018-10-01 00:25:20,259 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:20,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:20,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:20,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:20,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:20,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:20,362 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:25:20,362 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:25:20,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:25:20,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:25:20,363 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:20,363 INFO L87 Difference]: Start difference. First operand 310 states and 963 transitions. Second operand 8 states. [2018-10-01 00:25:29,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:29,132 INFO L93 Difference]: Finished difference Result 768 states and 2087 transitions. [2018-10-01 00:25:29,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-01 00:25:29,133 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-01 00:25:29,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:29,138 INFO L225 Difference]: With dead ends: 768 [2018-10-01 00:25:29,139 INFO L226 Difference]: Without dead ends: 537 [2018-10-01 00:25:29,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:25:29,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-10-01 00:25:29,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 334. [2018-10-01 00:25:29,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-10-01 00:25:29,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1037 transitions. [2018-10-01 00:25:29,204 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1037 transitions. Word has length 8 [2018-10-01 00:25:29,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:29,204 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 1037 transitions. [2018-10-01 00:25:29,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:25:29,204 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1037 transitions. [2018-10-01 00:25:29,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:25:29,206 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:29,206 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:29,207 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:29,207 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:29,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595081, now seen corresponding path program 1 times [2018-10-01 00:25:29,207 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:29,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:29,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:29,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:29,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:29,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:29,308 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:25:29,309 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:25:29,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:25:29,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:25:29,309 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:29,310 INFO L87 Difference]: Start difference. First operand 334 states and 1037 transitions. Second operand 8 states. [2018-10-01 00:25:39,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:39,461 INFO L93 Difference]: Finished difference Result 1145 states and 3146 transitions. [2018-10-01 00:25:39,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:25:39,462 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-01 00:25:39,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:39,468 INFO L225 Difference]: With dead ends: 1145 [2018-10-01 00:25:39,468 INFO L226 Difference]: Without dead ends: 812 [2018-10-01 00:25:39,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:25:39,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2018-10-01 00:25:39,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 450. [2018-10-01 00:25:39,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-10-01 00:25:39,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1432 transitions. [2018-10-01 00:25:39,552 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1432 transitions. Word has length 8 [2018-10-01 00:25:39,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:39,553 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 1432 transitions. [2018-10-01 00:25:39,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:25:39,553 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1432 transitions. [2018-10-01 00:25:39,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:25:39,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:39,554 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:39,555 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:39,555 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:39,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595078, now seen corresponding path program 1 times [2018-10-01 00:25:39,556 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:39,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:39,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:39,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:39,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:39,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:39,649 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:25:39,649 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:25:39,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:25:39,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:25:39,650 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:39,650 INFO L87 Difference]: Start difference. First operand 450 states and 1432 transitions. Second operand 8 states. [2018-10-01 00:25:47,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:47,615 INFO L93 Difference]: Finished difference Result 877 states and 2260 transitions. [2018-10-01 00:25:47,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-01 00:25:47,615 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-01 00:25:47,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:47,621 INFO L225 Difference]: With dead ends: 877 [2018-10-01 00:25:47,621 INFO L226 Difference]: Without dead ends: 871 [2018-10-01 00:25:47,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:25:47,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-10-01 00:25:47,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 478. [2018-10-01 00:25:47,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-10-01 00:25:47,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1531 transitions. [2018-10-01 00:25:47,738 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1531 transitions. Word has length 8 [2018-10-01 00:25:47,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:47,739 INFO L480 AbstractCegarLoop]: Abstraction has 478 states and 1531 transitions. [2018-10-01 00:25:47,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:25:47,739 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1531 transitions. [2018-10-01 00:25:47,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:25:47,740 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:47,740 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:47,741 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:47,741 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:47,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064444, now seen corresponding path program 1 times [2018-10-01 00:25:47,741 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:47,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:47,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:47,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:47,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:47,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:47,880 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:25:47,880 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:25:47,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:25:47,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:25:47,881 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:47,881 INFO L87 Difference]: Start difference. First operand 478 states and 1531 transitions. Second operand 8 states. [2018-10-01 00:25:57,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:57,022 INFO L93 Difference]: Finished difference Result 1049 states and 2854 transitions. [2018-10-01 00:25:57,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-01 00:25:57,023 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-01 00:25:57,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:57,028 INFO L225 Difference]: With dead ends: 1049 [2018-10-01 00:25:57,028 INFO L226 Difference]: Without dead ends: 818 [2018-10-01 00:25:57,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:25:57,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2018-10-01 00:25:57,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 524. [2018-10-01 00:25:57,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-10-01 00:25:57,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1684 transitions. [2018-10-01 00:25:57,167 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1684 transitions. Word has length 8 [2018-10-01 00:25:57,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:57,167 INFO L480 AbstractCegarLoop]: Abstraction has 524 states and 1684 transitions. [2018-10-01 00:25:57,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:25:57,167 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1684 transitions. [2018-10-01 00:25:57,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:25:57,169 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:57,169 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:57,170 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:57,170 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:57,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064441, now seen corresponding path program 1 times [2018-10-01 00:25:57,170 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:57,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:57,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:57,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:57,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:57,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:57,287 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:25:57,288 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:25:57,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:25:57,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:25:57,288 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:57,289 INFO L87 Difference]: Start difference. First operand 524 states and 1684 transitions. Second operand 8 states. [2018-10-01 00:26:04,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:04,527 INFO L93 Difference]: Finished difference Result 733 states and 1997 transitions. [2018-10-01 00:26:04,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-01 00:26:04,527 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-01 00:26:04,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:04,532 INFO L225 Difference]: With dead ends: 733 [2018-10-01 00:26:04,533 INFO L226 Difference]: Without dead ends: 727 [2018-10-01 00:26:04,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:26:04,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-10-01 00:26:04,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 530. [2018-10-01 00:26:04,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-10-01 00:26:04,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1690 transitions. [2018-10-01 00:26:04,724 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1690 transitions. Word has length 8 [2018-10-01 00:26:04,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:04,724 INFO L480 AbstractCegarLoop]: Abstraction has 530 states and 1690 transitions. [2018-10-01 00:26:04,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:26:04,724 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1690 transitions. [2018-10-01 00:26:04,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:26:04,725 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:04,726 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:04,726 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:04,727 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:04,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656691, now seen corresponding path program 1 times [2018-10-01 00:26:04,727 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:04,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:04,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:04,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:04,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:04,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:04,971 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:26:04,971 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:26:04,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:26:04,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:26:04,972 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:04,973 INFO L87 Difference]: Start difference. First operand 530 states and 1690 transitions. Second operand 8 states. [2018-10-01 00:26:16,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:16,435 INFO L93 Difference]: Finished difference Result 1329 states and 3609 transitions. [2018-10-01 00:26:16,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-01 00:26:16,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-01 00:26:16,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:16,444 INFO L225 Difference]: With dead ends: 1329 [2018-10-01 00:26:16,445 INFO L226 Difference]: Without dead ends: 1323 [2018-10-01 00:26:16,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:26:16,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2018-10-01 00:26:16,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 626. [2018-10-01 00:26:16,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-10-01 00:26:16,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 2087 transitions. [2018-10-01 00:26:16,630 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 2087 transitions. Word has length 8 [2018-10-01 00:26:16,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:16,631 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 2087 transitions. [2018-10-01 00:26:16,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:26:16,631 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 2087 transitions. [2018-10-01 00:26:16,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:26:16,632 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:16,632 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:16,633 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:16,633 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:16,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656688, now seen corresponding path program 1 times [2018-10-01 00:26:16,634 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:16,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:16,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:16,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:16,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:16,759 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:26:16,759 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:26:16,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:26:16,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:26:16,760 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:16,760 INFO L87 Difference]: Start difference. First operand 626 states and 2087 transitions. Second operand 8 states. [2018-10-01 00:26:25,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:25,236 INFO L93 Difference]: Finished difference Result 1268 states and 3539 transitions. [2018-10-01 00:26:25,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-01 00:26:25,236 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-01 00:26:25,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:25,242 INFO L225 Difference]: With dead ends: 1268 [2018-10-01 00:26:25,242 INFO L226 Difference]: Without dead ends: 1262 [2018-10-01 00:26:25,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:26:25,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2018-10-01 00:26:25,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 618. [2018-10-01 00:26:25,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-10-01 00:26:25,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 2056 transitions. [2018-10-01 00:26:25,439 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 2056 transitions. Word has length 8 [2018-10-01 00:26:25,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:25,439 INFO L480 AbstractCegarLoop]: Abstraction has 618 states and 2056 transitions. [2018-10-01 00:26:25,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:26:25,439 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 2056 transitions. [2018-10-01 00:26:25,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:26:25,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:25,441 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:25,442 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:25,442 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:25,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285639, now seen corresponding path program 1 times [2018-10-01 00:26:25,442 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:25,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:25,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:25,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:25,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:25,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:25,595 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:26:25,595 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:26:25,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:26:25,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:26:25,596 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:25,596 INFO L87 Difference]: Start difference. First operand 618 states and 2056 transitions. Second operand 8 states. [2018-10-01 00:26:34,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:34,141 INFO L93 Difference]: Finished difference Result 1367 states and 3876 transitions. [2018-10-01 00:26:34,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-01 00:26:34,141 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-01 00:26:34,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:34,148 INFO L225 Difference]: With dead ends: 1367 [2018-10-01 00:26:34,148 INFO L226 Difference]: Without dead ends: 1361 [2018-10-01 00:26:34,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:26:34,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2018-10-01 00:26:34,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 671. [2018-10-01 00:26:34,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2018-10-01 00:26:34,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 2249 transitions. [2018-10-01 00:26:34,352 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 2249 transitions. Word has length 8 [2018-10-01 00:26:34,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:34,352 INFO L480 AbstractCegarLoop]: Abstraction has 671 states and 2249 transitions. [2018-10-01 00:26:34,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:26:34,352 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 2249 transitions. [2018-10-01 00:26:34,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:26:34,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:34,354 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:34,354 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:34,354 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:34,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285636, now seen corresponding path program 1 times [2018-10-01 00:26:34,354 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:34,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:34,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:34,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:34,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:34,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-10-01 00:26:34,444 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:26:34,444 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:26:34,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:26:34,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:26:34,445 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:34,445 INFO L87 Difference]: Start difference. First operand 671 states and 2249 transitions. Second operand 8 states. [2018-10-01 00:26:45,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:45,954 INFO L93 Difference]: Finished difference Result 1373 states and 3787 transitions. [2018-10-01 00:26:45,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-01 00:26:45,955 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-01 00:26:45,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:45,965 INFO L225 Difference]: With dead ends: 1373 [2018-10-01 00:26:45,965 INFO L226 Difference]: Without dead ends: 1367 [2018-10-01 00:26:45,966 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:26:45,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-10-01 00:26:46,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 698. [2018-10-01 00:26:46,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-10-01 00:26:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 2344 transitions. [2018-10-01 00:26:46,213 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 2344 transitions. Word has length 8 [2018-10-01 00:26:46,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:46,213 INFO L480 AbstractCegarLoop]: Abstraction has 698 states and 2344 transitions. [2018-10-01 00:26:46,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:26:46,213 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 2344 transitions. [2018-10-01 00:26:46,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:26:46,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:46,215 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:46,216 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:46,216 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:46,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280348, now seen corresponding path program 1 times [2018-10-01 00:26:46,216 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:46,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:46,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:46,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:46,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:46,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:46,354 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:26:46,354 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-01 00:26:46,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:26:46,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:26:46,355 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:46,355 INFO L87 Difference]: Start difference. First operand 698 states and 2344 transitions. Second operand 7 states. [2018-10-01 00:26:54,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:54,550 INFO L93 Difference]: Finished difference Result 1526 states and 4298 transitions. [2018-10-01 00:26:54,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:26:54,550 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-01 00:26:54,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:54,560 INFO L225 Difference]: With dead ends: 1526 [2018-10-01 00:26:54,560 INFO L226 Difference]: Without dead ends: 1520 [2018-10-01 00:26:54,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:26:54,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2018-10-01 00:26:54,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 789. [2018-10-01 00:26:54,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-10-01 00:26:54,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 2673 transitions. [2018-10-01 00:26:54,967 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 2673 transitions. Word has length 8 [2018-10-01 00:26:54,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:54,967 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 2673 transitions. [2018-10-01 00:26:54,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:26:54,967 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 2673 transitions. [2018-10-01 00:26:54,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:26:54,969 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:54,969 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:54,969 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:54,970 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:54,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280221, now seen corresponding path program 1 times [2018-10-01 00:26:54,970 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:54,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:54,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:54,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:54,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:55,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:55,526 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:26:55,526 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-01 00:26:55,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:26:55,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:26:55,530 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:55,530 INFO L87 Difference]: Start difference. First operand 789 states and 2673 transitions. Second operand 7 states. [2018-10-01 00:27:04,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:04,154 INFO L93 Difference]: Finished difference Result 1548 states and 4356 transitions. [2018-10-01 00:27:04,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:27:04,154 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-01 00:27:04,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:04,163 INFO L225 Difference]: With dead ends: 1548 [2018-10-01 00:27:04,163 INFO L226 Difference]: Without dead ends: 1542 [2018-10-01 00:27:04,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:27:04,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2018-10-01 00:27:04,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 821. [2018-10-01 00:27:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-10-01 00:27:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 2801 transitions. [2018-10-01 00:27:04,428 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 2801 transitions. Word has length 8 [2018-10-01 00:27:04,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:04,428 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 2801 transitions. [2018-10-01 00:27:04,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:27:04,428 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 2801 transitions. [2018-10-01 00:27:04,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:27:04,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:04,429 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:27:04,430 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:04,430 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:04,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878937, now seen corresponding path program 1 times [2018-10-01 00:27:04,430 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:04,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:04,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:04,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:04,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:04,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:04,513 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:27:04,514 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-01 00:27:04,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:27:04,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:27:04,514 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:04,514 INFO L87 Difference]: Start difference. First operand 821 states and 2801 transitions. Second operand 7 states. [2018-10-01 00:27:13,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:13,561 INFO L93 Difference]: Finished difference Result 1575 states and 4539 transitions. [2018-10-01 00:27:13,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:27:13,562 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-01 00:27:13,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:13,569 INFO L225 Difference]: With dead ends: 1575 [2018-10-01 00:27:13,569 INFO L226 Difference]: Without dead ends: 1569 [2018-10-01 00:27:13,570 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:27:13,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2018-10-01 00:27:13,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 849. [2018-10-01 00:27:13,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-10-01 00:27:13,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2913 transitions. [2018-10-01 00:27:13,875 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 2913 transitions. Word has length 8 [2018-10-01 00:27:13,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:13,875 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 2913 transitions. [2018-10-01 00:27:13,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:27:13,875 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 2913 transitions. [2018-10-01 00:27:13,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:27:13,876 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:13,876 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:27:13,877 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:13,877 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:13,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878810, now seen corresponding path program 1 times [2018-10-01 00:27:13,877 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:13,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:13,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:13,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:13,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:13,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:13,962 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:27:13,962 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-01 00:27:13,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:27:13,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:27:13,963 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:13,963 INFO L87 Difference]: Start difference. First operand 849 states and 2913 transitions. Second operand 7 states. [2018-10-01 00:27:20,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:20,754 INFO L93 Difference]: Finished difference Result 1597 states and 4579 transitions. [2018-10-01 00:27:20,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-01 00:27:20,754 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-01 00:27:20,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:20,764 INFO L225 Difference]: With dead ends: 1597 [2018-10-01 00:27:20,765 INFO L226 Difference]: Without dead ends: 1591 [2018-10-01 00:27:20,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:27:20,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-10-01 00:27:21,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 873. [2018-10-01 00:27:21,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-10-01 00:27:21,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 2993 transitions. [2018-10-01 00:27:21,094 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 2993 transitions. Word has length 8 [2018-10-01 00:27:21,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:21,094 INFO L480 AbstractCegarLoop]: Abstraction has 873 states and 2993 transitions. [2018-10-01 00:27:21,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:27:21,094 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 2993 transitions. [2018-10-01 00:27:21,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:27:21,095 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:21,095 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:27:21,096 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:21,097 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:21,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288024, now seen corresponding path program 1 times [2018-10-01 00:27:21,097 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:21,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:21,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:21,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:21,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:21,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:21,251 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:27:21,251 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-01 00:27:21,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:27:21,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:27:21,252 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:21,252 INFO L87 Difference]: Start difference. First operand 873 states and 2993 transitions. Second operand 7 states. [2018-10-01 00:27:27,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:27,615 INFO L93 Difference]: Finished difference Result 1726 states and 5211 transitions. [2018-10-01 00:27:27,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-01 00:27:27,615 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-01 00:27:27,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:27,625 INFO L225 Difference]: With dead ends: 1726 [2018-10-01 00:27:27,625 INFO L226 Difference]: Without dead ends: 1720 [2018-10-01 00:27:27,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:27:27,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2018-10-01 00:27:28,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1006. [2018-10-01 00:27:28,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2018-10-01 00:27:28,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 3474 transitions. [2018-10-01 00:27:28,063 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 3474 transitions. Word has length 8 [2018-10-01 00:27:28,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:28,063 INFO L480 AbstractCegarLoop]: Abstraction has 1006 states and 3474 transitions. [2018-10-01 00:27:28,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:27:28,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 3474 transitions. [2018-10-01 00:27:28,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:27:28,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:28,065 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:27:28,066 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:28,066 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:28,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288027, now seen corresponding path program 1 times [2018-10-01 00:27:28,066 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:28,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:28,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:28,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:28,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:28,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:28,148 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:27:28,148 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-01 00:27:28,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:27:28,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:27:28,149 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:28,149 INFO L87 Difference]: Start difference. First operand 1006 states and 3474 transitions. Second operand 7 states. [2018-10-01 00:27:36,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:36,883 INFO L93 Difference]: Finished difference Result 1758 states and 5203 transitions. [2018-10-01 00:27:36,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-01 00:27:36,884 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-01 00:27:36,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:36,891 INFO L225 Difference]: With dead ends: 1758 [2018-10-01 00:27:36,891 INFO L226 Difference]: Without dead ends: 1752 [2018-10-01 00:27:36,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:27:36,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2018-10-01 00:27:37,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1011. [2018-10-01 00:27:37,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-10-01 00:27:37,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 3493 transitions. [2018-10-01 00:27:37,392 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 3493 transitions. Word has length 8 [2018-10-01 00:27:37,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:37,392 INFO L480 AbstractCegarLoop]: Abstraction has 1011 states and 3493 transitions. [2018-10-01 00:27:37,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:27:37,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 3493 transitions. [2018-10-01 00:27:37,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:27:37,393 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:37,394 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:27:37,394 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:37,394 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:37,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746872, now seen corresponding path program 1 times [2018-10-01 00:27:37,394 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:37,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:37,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:37,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:37,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:37,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:37,503 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:27:37,503 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-01 00:27:37,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:27:37,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:27:37,504 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:37,504 INFO L87 Difference]: Start difference. First operand 1011 states and 3493 transitions. Second operand 7 states. [2018-10-01 00:27:45,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:45,986 INFO L93 Difference]: Finished difference Result 1867 states and 5608 transitions. [2018-10-01 00:27:45,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-01 00:27:45,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-01 00:27:45,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:45,994 INFO L225 Difference]: With dead ends: 1867 [2018-10-01 00:27:45,995 INFO L226 Difference]: Without dead ends: 1861 [2018-10-01 00:27:45,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:27:45,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2018-10-01 00:27:46,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1119. [2018-10-01 00:27:46,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2018-10-01 00:27:46,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 3931 transitions. [2018-10-01 00:27:46,511 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 3931 transitions. Word has length 8 [2018-10-01 00:27:46,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:46,511 INFO L480 AbstractCegarLoop]: Abstraction has 1119 states and 3931 transitions. [2018-10-01 00:27:46,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:27:46,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 3931 transitions. [2018-10-01 00:27:46,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:27:46,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:46,512 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:27:46,513 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:46,513 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:46,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746875, now seen corresponding path program 1 times [2018-10-01 00:27:46,513 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:46,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:46,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:46,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:46,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:46,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:46,729 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:27:46,729 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-01 00:27:46,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:27:46,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:27:46,730 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:46,730 INFO L87 Difference]: Start difference. First operand 1119 states and 3931 transitions. Second operand 7 states. [2018-10-01 00:27:56,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:56,647 INFO L93 Difference]: Finished difference Result 1968 states and 5829 transitions. [2018-10-01 00:27:56,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:27:56,649 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-01 00:27:56,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:56,657 INFO L225 Difference]: With dead ends: 1968 [2018-10-01 00:27:56,657 INFO L226 Difference]: Without dead ends: 1962 [2018-10-01 00:27:56,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:27:56,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2018-10-01 00:27:57,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1111. [2018-10-01 00:27:57,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2018-10-01 00:27:57,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 3891 transitions. [2018-10-01 00:27:57,332 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 3891 transitions. Word has length 8 [2018-10-01 00:27:57,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:57,333 INFO L480 AbstractCegarLoop]: Abstraction has 1111 states and 3891 transitions. [2018-10-01 00:27:57,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:27:57,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 3891 transitions. [2018-10-01 00:27:57,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:27:57,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:57,334 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:27:57,334 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:57,334 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:57,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1616407055, now seen corresponding path program 1 times [2018-10-01 00:27:57,334 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:57,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:57,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:57,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:57,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:57,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:57,432 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:27:57,432 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-01 00:27:57,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:27:57,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:27:57,432 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:57,433 INFO L87 Difference]: Start difference. First operand 1111 states and 3891 transitions. Second operand 7 states. [2018-10-01 00:28:05,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:05,383 INFO L93 Difference]: Finished difference Result 2001 states and 6001 transitions. [2018-10-01 00:28:05,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-01 00:28:05,386 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-01 00:28:05,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:05,392 INFO L225 Difference]: With dead ends: 2001 [2018-10-01 00:28:05,392 INFO L226 Difference]: Without dead ends: 1995 [2018-10-01 00:28:05,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:28:05,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2018-10-01 00:28:06,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1117. [2018-10-01 00:28:06,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2018-10-01 00:28:06,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 3909 transitions. [2018-10-01 00:28:06,028 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 3909 transitions. Word has length 8 [2018-10-01 00:28:06,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:06,029 INFO L480 AbstractCegarLoop]: Abstraction has 1117 states and 3909 transitions. [2018-10-01 00:28:06,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:28:06,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 3909 transitions. [2018-10-01 00:28:06,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:28:06,030 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:06,030 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:28:06,030 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:06,031 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:06,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1616406928, now seen corresponding path program 1 times [2018-10-01 00:28:06,031 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:06,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:06,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:06,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:06,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:06,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:06,096 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:28:06,096 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-01 00:28:06,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:28:06,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:28:06,097 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:06,097 INFO L87 Difference]: Start difference. First operand 1117 states and 3909 transitions. Second operand 7 states. [2018-10-01 00:28:12,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:12,809 INFO L93 Difference]: Finished difference Result 1708 states and 5233 transitions. [2018-10-01 00:28:12,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-01 00:28:12,809 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-01 00:28:12,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:12,814 INFO L225 Difference]: With dead ends: 1708 [2018-10-01 00:28:12,814 INFO L226 Difference]: Without dead ends: 1702 [2018-10-01 00:28:12,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:28:12,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2018-10-01 00:28:13,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1210. [2018-10-01 00:28:13,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2018-10-01 00:28:13,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 4307 transitions. [2018-10-01 00:28:13,519 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 4307 transitions. Word has length 8 [2018-10-01 00:28:13,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:13,519 INFO L480 AbstractCegarLoop]: Abstraction has 1210 states and 4307 transitions. [2018-10-01 00:28:13,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:28:13,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 4307 transitions. [2018-10-01 00:28:13,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:28:13,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:13,520 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:28:13,521 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:13,521 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:13,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256941, now seen corresponding path program 1 times [2018-10-01 00:28:13,521 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:13,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:13,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:13,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:13,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:13,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:13,609 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:28:13,609 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-01 00:28:13,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:28:13,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:28:13,610 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:13,610 INFO L87 Difference]: Start difference. First operand 1210 states and 4307 transitions. Second operand 7 states. [2018-10-01 00:28:23,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:23,068 INFO L93 Difference]: Finished difference Result 2402 states and 7321 transitions. [2018-10-01 00:28:23,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:28:23,069 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-01 00:28:23,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:23,075 INFO L225 Difference]: With dead ends: 2402 [2018-10-01 00:28:23,075 INFO L226 Difference]: Without dead ends: 2396 [2018-10-01 00:28:23,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:28:23,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2018-10-01 00:28:23,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1341. [2018-10-01 00:28:23,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-10-01 00:28:23,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 4862 transitions. [2018-10-01 00:28:23,892 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 4862 transitions. Word has length 8 [2018-10-01 00:28:23,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:23,893 INFO L480 AbstractCegarLoop]: Abstraction has 1341 states and 4862 transitions. [2018-10-01 00:28:23,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:28:23,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 4862 transitions. [2018-10-01 00:28:23,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:28:23,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:23,895 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:28:23,895 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:23,895 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:23,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256944, now seen corresponding path program 1 times [2018-10-01 00:28:23,895 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:23,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:23,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:23,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:23,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:23,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:23,991 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:28:23,991 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-01 00:28:23,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:28:23,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:28:23,992 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:23,992 INFO L87 Difference]: Start difference. First operand 1341 states and 4862 transitions. Second operand 7 states. [2018-10-01 00:28:32,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:32,521 INFO L93 Difference]: Finished difference Result 2274 states and 6934 transitions. [2018-10-01 00:28:32,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-01 00:28:32,521 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-01 00:28:32,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:32,526 INFO L225 Difference]: With dead ends: 2274 [2018-10-01 00:28:32,526 INFO L226 Difference]: Without dead ends: 2268 [2018-10-01 00:28:32,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:28:32,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2018-10-01 00:28:33,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 1337. [2018-10-01 00:28:33,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-10-01 00:28:33,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 4840 transitions. [2018-10-01 00:28:33,307 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 4840 transitions. Word has length 8 [2018-10-01 00:28:33,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:33,308 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 4840 transitions. [2018-10-01 00:28:33,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:28:33,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 4840 transitions. [2018-10-01 00:28:33,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:28:33,309 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:33,309 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-10-01 00:28:33,309 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:33,309 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:33,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1621267991, now seen corresponding path program 1 times [2018-10-01 00:28:33,309 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:33,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:33,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:33,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:33,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:33,345 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:28:33,345 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:28:33,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:28:33,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:28:33,345 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:33,346 INFO L87 Difference]: Start difference. First operand 1337 states and 4840 transitions. Second operand 4 states. [2018-10-01 00:28:34,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:34,664 INFO L93 Difference]: Finished difference Result 2170 states and 7637 transitions. [2018-10-01 00:28:34,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:28:34,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-10-01 00:28:34,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:34,667 INFO L225 Difference]: With dead ends: 2170 [2018-10-01 00:28:34,667 INFO L226 Difference]: Without dead ends: 1253 [2018-10-01 00:28:34,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:28:34,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2018-10-01 00:28:35,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1080. [2018-10-01 00:28:35,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2018-10-01 00:28:35,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 3769 transitions. [2018-10-01 00:28:35,282 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 3769 transitions. Word has length 8 [2018-10-01 00:28:35,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:35,282 INFO L480 AbstractCegarLoop]: Abstraction has 1080 states and 3769 transitions. [2018-10-01 00:28:35,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:28:35,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 3769 transitions. [2018-10-01 00:28:35,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:28:35,283 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:35,284 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:28:35,284 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:35,284 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:35,284 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283460, now seen corresponding path program 1 times [2018-10-01 00:28:35,284 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:35,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:35,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:35,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:35,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:35,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:35,443 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:28:35,443 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:28:35,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:28:35,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:28:35,444 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:35,444 INFO L87 Difference]: Start difference. First operand 1080 states and 3769 transitions. Second operand 8 states. [2018-10-01 00:28:47,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:47,825 INFO L93 Difference]: Finished difference Result 2095 states and 6316 transitions. [2018-10-01 00:28:47,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-01 00:28:47,825 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-01 00:28:47,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:47,829 INFO L225 Difference]: With dead ends: 2095 [2018-10-01 00:28:47,829 INFO L226 Difference]: Without dead ends: 2093 [2018-10-01 00:28:47,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:28:47,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2018-10-01 00:28:48,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1161. [2018-10-01 00:28:48,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2018-10-01 00:28:48,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 4123 transitions. [2018-10-01 00:28:48,599 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 4123 transitions. Word has length 8 [2018-10-01 00:28:48,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:48,599 INFO L480 AbstractCegarLoop]: Abstraction has 1161 states and 4123 transitions. [2018-10-01 00:28:48,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:28:48,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 4123 transitions. [2018-10-01 00:28:48,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:28:48,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:48,600 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:28:48,601 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:48,601 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:48,601 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283333, now seen corresponding path program 1 times [2018-10-01 00:28:48,601 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:48,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:48,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:48,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:48,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:48,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:48,760 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:28:48,760 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:28:48,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:28:48,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:28:48,761 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:48,761 INFO L87 Difference]: Start difference. First operand 1161 states and 4123 transitions. Second operand 8 states. [2018-10-01 00:29:00,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:00,972 INFO L93 Difference]: Finished difference Result 1994 states and 5988 transitions. [2018-10-01 00:29:00,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:29:00,972 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-01 00:29:00,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:00,976 INFO L225 Difference]: With dead ends: 1994 [2018-10-01 00:29:00,976 INFO L226 Difference]: Without dead ends: 1988 [2018-10-01 00:29:00,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:29:00,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2018-10-01 00:29:01,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1152. [2018-10-01 00:29:01,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2018-10-01 00:29:01,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 4099 transitions. [2018-10-01 00:29:01,758 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 4099 transitions. Word has length 8 [2018-10-01 00:29:01,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:01,758 INFO L480 AbstractCegarLoop]: Abstraction has 1152 states and 4099 transitions. [2018-10-01 00:29:01,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:29:01,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 4099 transitions. [2018-10-01 00:29:01,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:29:01,759 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:01,760 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:29:01,760 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:01,760 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:01,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1867882049, now seen corresponding path program 1 times [2018-10-01 00:29:01,760 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:01,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:01,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:01,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:29:01,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:01,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:29:01,931 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:29:01,931 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:29:01,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:29:01,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:29:01,932 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:01,932 INFO L87 Difference]: Start difference. First operand 1152 states and 4099 transitions. Second operand 8 states. [2018-10-01 00:29:15,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:15,762 INFO L93 Difference]: Finished difference Result 2160 states and 6516 transitions. [2018-10-01 00:29:15,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:29:15,762 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-01 00:29:15,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:15,767 INFO L225 Difference]: With dead ends: 2160 [2018-10-01 00:29:15,767 INFO L226 Difference]: Without dead ends: 2154 [2018-10-01 00:29:15,768 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:29:15,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2018-10-01 00:29:16,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1174. [2018-10-01 00:29:16,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2018-10-01 00:29:16,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 4164 transitions. [2018-10-01 00:29:16,602 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 4164 transitions. Word has length 8 [2018-10-01 00:29:16,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:16,602 INFO L480 AbstractCegarLoop]: Abstraction has 1174 states and 4164 transitions. [2018-10-01 00:29:16,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:29:16,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 4164 transitions. [2018-10-01 00:29:16,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:29:16,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:16,603 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:29:16,604 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:16,604 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:16,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1867881922, now seen corresponding path program 1 times [2018-10-01 00:29:16,604 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:16,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:16,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:16,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:29:16,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:16,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:29:16,684 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:29:16,684 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:29:16,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:29:16,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:29:16,685 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:16,685 INFO L87 Difference]: Start difference. First operand 1174 states and 4164 transitions. Second operand 8 states. [2018-10-01 00:29:30,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:30,529 INFO L93 Difference]: Finished difference Result 2094 states and 6271 transitions. [2018-10-01 00:29:30,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:29:30,529 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-01 00:29:30,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:30,532 INFO L225 Difference]: With dead ends: 2094 [2018-10-01 00:29:30,533 INFO L226 Difference]: Without dead ends: 2088 [2018-10-01 00:29:30,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:29:30,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2018-10-01 00:29:31,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 1153. [2018-10-01 00:29:31,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2018-10-01 00:29:31,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 4095 transitions. [2018-10-01 00:29:31,385 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 4095 transitions. Word has length 8 [2018-10-01 00:29:31,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:31,385 INFO L480 AbstractCegarLoop]: Abstraction has 1153 states and 4095 transitions. [2018-10-01 00:29:31,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:29:31,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 4095 transitions. [2018-10-01 00:29:31,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:29:31,386 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:31,386 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-10-01 00:29:31,387 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:31,387 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:31,387 INFO L82 PathProgramCache]: Analyzing trace with hash -896988374, now seen corresponding path program 1 times [2018-10-01 00:29:31,387 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:31,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:31,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:31,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:29:31,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:31,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:29:31,434 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:29:31,434 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:29:31,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:29:31,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:29:31,434 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:31,435 INFO L87 Difference]: Start difference. First operand 1153 states and 4095 transitions. Second operand 4 states. [2018-10-01 00:29:33,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:33,052 INFO L93 Difference]: Finished difference Result 1929 states and 6604 transitions. [2018-10-01 00:29:33,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:29:33,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-10-01 00:29:33,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:33,055 INFO L225 Difference]: With dead ends: 1929 [2018-10-01 00:29:33,055 INFO L226 Difference]: Without dead ends: 1400 [2018-10-01 00:29:33,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:29:33,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2018-10-01 00:29:33,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1083. [2018-10-01 00:29:33,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2018-10-01 00:29:33,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 3765 transitions. [2018-10-01 00:29:33,880 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 3765 transitions. Word has length 8 [2018-10-01 00:29:33,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:33,880 INFO L480 AbstractCegarLoop]: Abstraction has 1083 states and 3765 transitions. [2018-10-01 00:29:33,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:29:33,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 3765 transitions. [2018-10-01 00:29:33,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:29:33,881 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:33,881 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:29:33,881 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:33,882 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:33,882 INFO L82 PathProgramCache]: Analyzing trace with hash -896379114, now seen corresponding path program 1 times [2018-10-01 00:29:33,882 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:33,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:33,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:33,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:29:33,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:34,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:29:34,501 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:29:34,501 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:29:34,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:29:34,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:29:34,502 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:34,502 INFO L87 Difference]: Start difference. First operand 1083 states and 3765 transitions. Second operand 8 states. [2018-10-01 00:29:45,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:45,423 INFO L93 Difference]: Finished difference Result 2276 states and 6948 transitions. [2018-10-01 00:29:45,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-01 00:29:45,424 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-01 00:29:45,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:45,428 INFO L225 Difference]: With dead ends: 2276 [2018-10-01 00:29:45,428 INFO L226 Difference]: Without dead ends: 2270 [2018-10-01 00:29:45,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:29:45,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2018-10-01 00:29:46,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 1266. [2018-10-01 00:29:46,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2018-10-01 00:29:46,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 4418 transitions. [2018-10-01 00:29:46,449 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 4418 transitions. Word has length 8 [2018-10-01 00:29:46,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:46,450 INFO L480 AbstractCegarLoop]: Abstraction has 1266 states and 4418 transitions. [2018-10-01 00:29:46,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:29:46,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 4418 transitions. [2018-10-01 00:29:46,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:29:46,451 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:46,451 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:29:46,452 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:46,452 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:46,452 INFO L82 PathProgramCache]: Analyzing trace with hash -896379111, now seen corresponding path program 1 times [2018-10-01 00:29:46,452 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:46,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:46,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:46,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:29:46,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:46,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:29:46,539 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:29:46,539 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:29:46,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:29:46,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:29:46,540 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:46,540 INFO L87 Difference]: Start difference. First operand 1266 states and 4418 transitions. Second operand 8 states. [2018-10-01 00:29:59,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:59,061 INFO L93 Difference]: Finished difference Result 2425 states and 7363 transitions. [2018-10-01 00:29:59,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:29:59,061 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-01 00:29:59,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:59,068 INFO L225 Difference]: With dead ends: 2425 [2018-10-01 00:29:59,068 INFO L226 Difference]: Without dead ends: 2419 [2018-10-01 00:29:59,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:29:59,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2018-10-01 00:30:00,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 1373. [2018-10-01 00:30:00,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2018-10-01 00:30:00,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 4822 transitions. [2018-10-01 00:30:00,318 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 4822 transitions. Word has length 8 [2018-10-01 00:30:00,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:00,319 INFO L480 AbstractCegarLoop]: Abstraction has 1373 states and 4822 transitions. [2018-10-01 00:30:00,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:30:00,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 4822 transitions. [2018-10-01 00:30:00,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:30:00,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:00,320 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:30:00,320 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:00,321 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:00,321 INFO L82 PathProgramCache]: Analyzing trace with hash -881085998, now seen corresponding path program 1 times [2018-10-01 00:30:00,321 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:00,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:00,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:00,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:30:00,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:00,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:30:00,414 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:30:00,414 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:30:00,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:30:00,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:30:00,415 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:00,415 INFO L87 Difference]: Start difference. First operand 1373 states and 4822 transitions. Second operand 8 states. [2018-10-01 00:30:12,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:12,734 INFO L93 Difference]: Finished difference Result 2278 states and 6952 transitions. [2018-10-01 00:30:12,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-01 00:30:12,735 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-01 00:30:12,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:12,740 INFO L225 Difference]: With dead ends: 2278 [2018-10-01 00:30:12,741 INFO L226 Difference]: Without dead ends: 2272 [2018-10-01 00:30:12,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:30:12,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2018-10-01 00:30:14,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1421. [2018-10-01 00:30:14,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2018-10-01 00:30:14,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 4963 transitions. [2018-10-01 00:30:14,006 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 4963 transitions. Word has length 8 [2018-10-01 00:30:14,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:14,006 INFO L480 AbstractCegarLoop]: Abstraction has 1421 states and 4963 transitions. [2018-10-01 00:30:14,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:30:14,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 4963 transitions. [2018-10-01 00:30:14,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:30:14,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:14,007 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:30:14,007 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:14,007 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:14,007 INFO L82 PathProgramCache]: Analyzing trace with hash -881086125, now seen corresponding path program 1 times [2018-10-01 00:30:14,008 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:14,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:14,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:14,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:30:14,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:14,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:30:14,081 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:30:14,081 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:30:14,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:30:14,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:30:14,082 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:14,082 INFO L87 Difference]: Start difference. First operand 1421 states and 4963 transitions. Second operand 8 states. [2018-10-01 00:30:25,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:25,476 INFO L93 Difference]: Finished difference Result 2233 states and 6848 transitions. [2018-10-01 00:30:25,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-01 00:30:25,476 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-01 00:30:25,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:25,481 INFO L225 Difference]: With dead ends: 2233 [2018-10-01 00:30:25,481 INFO L226 Difference]: Without dead ends: 2227 [2018-10-01 00:30:25,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:30:25,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2018-10-01 00:30:26,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 1411. [2018-10-01 00:30:26,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2018-10-01 00:30:26,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 4926 transitions. [2018-10-01 00:30:26,714 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 4926 transitions. Word has length 8 [2018-10-01 00:30:26,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:26,714 INFO L480 AbstractCegarLoop]: Abstraction has 1411 states and 4926 transitions. [2018-10-01 00:30:26,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:30:26,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 4926 transitions. [2018-10-01 00:30:26,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:30:26,715 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:26,715 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:30:26,715 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:26,715 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:26,716 INFO L82 PathProgramCache]: Analyzing trace with hash 2077099334, now seen corresponding path program 1 times [2018-10-01 00:30:26,716 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:26,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:26,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:26,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:30:26,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:26,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:30:26,933 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:30:26,933 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:30:26,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:30:26,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:30:26,934 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:26,935 INFO L87 Difference]: Start difference. First operand 1411 states and 4926 transitions. Second operand 8 states. [2018-10-01 00:30:40,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:40,934 INFO L93 Difference]: Finished difference Result 2558 states and 7836 transitions. [2018-10-01 00:30:40,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-01 00:30:40,935 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-01 00:30:40,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:40,939 INFO L225 Difference]: With dead ends: 2558 [2018-10-01 00:30:40,939 INFO L226 Difference]: Without dead ends: 2552 [2018-10-01 00:30:40,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:30:40,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2018-10-01 00:30:42,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 1471. [2018-10-01 00:30:42,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2018-10-01 00:30:42,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 5183 transitions. [2018-10-01 00:30:42,318 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 5183 transitions. Word has length 8 [2018-10-01 00:30:42,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:42,319 INFO L480 AbstractCegarLoop]: Abstraction has 1471 states and 5183 transitions. [2018-10-01 00:30:42,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:30:42,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 5183 transitions. [2018-10-01 00:30:42,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:30:42,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:42,320 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:30:42,321 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:42,321 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:42,321 INFO L82 PathProgramCache]: Analyzing trace with hash 2077099337, now seen corresponding path program 1 times [2018-10-01 00:30:42,321 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:42,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:42,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:42,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:30:42,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:42,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:30:42,405 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:30:42,405 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:30:42,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:30:42,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:30:42,406 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:42,407 INFO L87 Difference]: Start difference. First operand 1471 states and 5183 transitions. Second operand 8 states. [2018-10-01 00:30:56,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:56,843 INFO L93 Difference]: Finished difference Result 2703 states and 8278 transitions. [2018-10-01 00:30:56,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:30:56,844 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-01 00:30:56,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:56,849 INFO L225 Difference]: With dead ends: 2703 [2018-10-01 00:30:56,849 INFO L226 Difference]: Without dead ends: 2697 [2018-10-01 00:30:56,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:30:56,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2018-10-01 00:30:58,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1480. [2018-10-01 00:30:58,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-10-01 00:30:58,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 5200 transitions. [2018-10-01 00:30:58,276 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 5200 transitions. Word has length 8 [2018-10-01 00:30:58,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:58,276 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 5200 transitions. [2018-10-01 00:30:58,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:30:58,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 5200 transitions. [2018-10-01 00:30:58,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:30:58,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:58,278 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:30:58,278 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:58,278 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:58,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1638629971, now seen corresponding path program 1 times [2018-10-01 00:30:58,278 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:58,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:58,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:58,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:30:58,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:58,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:30:58,364 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:30:58,365 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:30:58,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:30:58,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:30:58,365 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:58,365 INFO L87 Difference]: Start difference. First operand 1480 states and 5200 transitions. Second operand 8 states. [2018-10-01 00:31:13,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:31:13,646 INFO L93 Difference]: Finished difference Result 2674 states and 8171 transitions. [2018-10-01 00:31:13,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:31:13,646 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-01 00:31:13,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:31:13,651 INFO L225 Difference]: With dead ends: 2674 [2018-10-01 00:31:13,651 INFO L226 Difference]: Without dead ends: 2668 [2018-10-01 00:31:13,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:31:13,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2018-10-01 00:31:15,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 1480. [2018-10-01 00:31:15,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-10-01 00:31:15,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 5196 transitions. [2018-10-01 00:31:15,199 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 5196 transitions. Word has length 8 [2018-10-01 00:31:15,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:31:15,200 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 5196 transitions. [2018-10-01 00:31:15,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:31:15,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 5196 transitions. [2018-10-01 00:31:15,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:31:15,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:31:15,201 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:31:15,201 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:31:15,201 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:31:15,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1638629974, now seen corresponding path program 1 times [2018-10-01 00:31:15,201 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:31:15,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:31:15,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:15,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:31:15,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:15,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:31:15,686 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:31:15,686 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:31:15,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:31:15,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:31:15,687 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:31:15,687 INFO L87 Difference]: Start difference. First operand 1480 states and 5196 transitions. Second operand 8 states. [2018-10-01 00:31:31,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:31:31,746 INFO L93 Difference]: Finished difference Result 2722 states and 8299 transitions. [2018-10-01 00:31:31,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-01 00:31:31,746 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-01 00:31:31,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:31:31,752 INFO L225 Difference]: With dead ends: 2722 [2018-10-01 00:31:31,752 INFO L226 Difference]: Without dead ends: 2716 [2018-10-01 00:31:31,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:31:31,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2018-10-01 00:31:33,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 1462. [2018-10-01 00:31:33,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1462 states. [2018-10-01 00:31:33,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 5124 transitions. [2018-10-01 00:31:33,262 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 5124 transitions. Word has length 8 [2018-10-01 00:31:33,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:31:33,262 INFO L480 AbstractCegarLoop]: Abstraction has 1462 states and 5124 transitions. [2018-10-01 00:31:33,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:31:33,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 5124 transitions. [2018-10-01 00:31:33,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:31:33,263 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:31:33,263 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:31:33,263 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:31:33,263 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:31:33,263 INFO L82 PathProgramCache]: Analyzing trace with hash 278041308, now seen corresponding path program 1 times [2018-10-01 00:31:33,264 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:31:33,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:31:33,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:33,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:31:33,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:33,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:31:33,550 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:31:33,550 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:31:33,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:31:33,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:31:33,550 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:31:33,550 INFO L87 Difference]: Start difference. First operand 1462 states and 5124 transitions. Second operand 8 states. [2018-10-01 00:31:44,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:31:44,779 INFO L93 Difference]: Finished difference Result 2962 states and 9218 transitions. [2018-10-01 00:31:44,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 00:31:44,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-01 00:31:44,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:31:44,785 INFO L225 Difference]: With dead ends: 2962 [2018-10-01 00:31:44,785 INFO L226 Difference]: Without dead ends: 2956 [2018-10-01 00:31:44,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:31:44,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2018-10-01 00:31:46,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1776. [2018-10-01 00:31:46,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1776 states. [2018-10-01 00:31:46,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 6236 transitions. [2018-10-01 00:31:46,762 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 6236 transitions. Word has length 9 [2018-10-01 00:31:46,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:31:46,763 INFO L480 AbstractCegarLoop]: Abstraction has 1776 states and 6236 transitions. [2018-10-01 00:31:46,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:31:46,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 6236 transitions. [2018-10-01 00:31:46,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:31:46,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:31:46,764 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:31:46,764 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:31:46,764 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:31:46,764 INFO L82 PathProgramCache]: Analyzing trace with hash 278041683, now seen corresponding path program 1 times [2018-10-01 00:31:46,765 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:31:46,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:31:46,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:46,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:31:46,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:46,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:31:46,838 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:31:46,838 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:31:46,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:31:46,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:31:46,839 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:31:46,839 INFO L87 Difference]: Start difference. First operand 1776 states and 6236 transitions. Second operand 8 states. [2018-10-01 00:31:58,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:31:58,326 INFO L93 Difference]: Finished difference Result 2948 states and 9162 transitions. [2018-10-01 00:31:58,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 00:31:58,326 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-01 00:31:58,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:31:58,332 INFO L225 Difference]: With dead ends: 2948 [2018-10-01 00:31:58,332 INFO L226 Difference]: Without dead ends: 2942 [2018-10-01 00:31:58,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:31:58,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2018-10-01 00:32:00,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1772. [2018-10-01 00:32:00,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2018-10-01 00:32:00,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 6220 transitions. [2018-10-01 00:32:00,255 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 6220 transitions. Word has length 9 [2018-10-01 00:32:00,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:32:00,255 INFO L480 AbstractCegarLoop]: Abstraction has 1772 states and 6220 transitions. [2018-10-01 00:32:00,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:32:00,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 6220 transitions. [2018-10-01 00:32:00,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:32:00,257 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:32:00,257 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:32:00,257 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:32:00,257 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:32:00,257 INFO L82 PathProgramCache]: Analyzing trace with hash 541105076, now seen corresponding path program 1 times [2018-10-01 00:32:00,257 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:32:00,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:32:00,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:00,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:32:00,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:32:00,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:32:00,384 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:32:00,384 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:32:00,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:32:00,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:32:00,385 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:32:00,385 INFO L87 Difference]: Start difference. First operand 1772 states and 6220 transitions. Second operand 8 states. [2018-10-01 00:32:14,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:32:14,397 INFO L93 Difference]: Finished difference Result 3238 states and 9970 transitions. [2018-10-01 00:32:14,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:32:14,398 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-01 00:32:14,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:32:14,404 INFO L225 Difference]: With dead ends: 3238 [2018-10-01 00:32:14,404 INFO L226 Difference]: Without dead ends: 3232 [2018-10-01 00:32:14,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:32:14,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2018-10-01 00:32:16,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 1799. [2018-10-01 00:32:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2018-10-01 00:32:16,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 6288 transitions. [2018-10-01 00:32:16,356 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 6288 transitions. Word has length 9 [2018-10-01 00:32:16,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:32:16,356 INFO L480 AbstractCegarLoop]: Abstraction has 1799 states and 6288 transitions. [2018-10-01 00:32:16,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:32:16,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 6288 transitions. [2018-10-01 00:32:16,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:32:16,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:32:16,358 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:32:16,358 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:32:16,358 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:32:16,358 INFO L82 PathProgramCache]: Analyzing trace with hash 541105451, now seen corresponding path program 1 times [2018-10-01 00:32:16,358 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:32:16,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:32:16,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:16,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:32:16,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:32:16,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:32:16,427 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:32:16,427 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:32:16,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:32:16,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:32:16,427 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:32:16,428 INFO L87 Difference]: Start difference. First operand 1799 states and 6288 transitions. Second operand 8 states. [2018-10-01 00:32:30,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:32:30,330 INFO L93 Difference]: Finished difference Result 3212 states and 9854 transitions. [2018-10-01 00:32:30,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:32:30,330 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-01 00:32:30,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:32:30,336 INFO L225 Difference]: With dead ends: 3212 [2018-10-01 00:32:30,336 INFO L226 Difference]: Without dead ends: 3206 [2018-10-01 00:32:30,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:32:30,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2018-10-01 00:32:32,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 1737. [2018-10-01 00:32:32,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1737 states. [2018-10-01 00:32:32,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 6062 transitions. [2018-10-01 00:32:32,381 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 6062 transitions. Word has length 9 [2018-10-01 00:32:32,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:32:32,381 INFO L480 AbstractCegarLoop]: Abstraction has 1737 states and 6062 transitions. [2018-10-01 00:32:32,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:32:32,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 6062 transitions. [2018-10-01 00:32:32,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:32:32,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:32:32,383 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:32:32,383 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:32:32,383 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:32:32,383 INFO L82 PathProgramCache]: Analyzing trace with hash 825189368, now seen corresponding path program 1 times [2018-10-01 00:32:32,383 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:32:32,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:32:32,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:32,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:32:32,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:32:32,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:32:32,449 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:32:32,449 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:32:32,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:32:32,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:32:32,450 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:32:32,450 INFO L87 Difference]: Start difference. First operand 1737 states and 6062 transitions. Second operand 8 states. [2018-10-01 00:32:45,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:32:45,110 INFO L93 Difference]: Finished difference Result 3315 states and 10043 transitions. [2018-10-01 00:32:45,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:32:45,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-01 00:32:45,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:32:45,116 INFO L225 Difference]: With dead ends: 3315 [2018-10-01 00:32:45,116 INFO L226 Difference]: Without dead ends: 3309 [2018-10-01 00:32:45,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:32:45,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2018-10-01 00:32:47,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 1985. [2018-10-01 00:32:47,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1985 states. [2018-10-01 00:32:47,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 6886 transitions. [2018-10-01 00:32:47,317 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 6886 transitions. Word has length 9 [2018-10-01 00:32:47,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:32:47,317 INFO L480 AbstractCegarLoop]: Abstraction has 1985 states and 6886 transitions. [2018-10-01 00:32:47,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:32:47,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 6886 transitions. [2018-10-01 00:32:47,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:32:47,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:32:47,319 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:32:47,319 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:32:47,320 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:32:47,320 INFO L82 PathProgramCache]: Analyzing trace with hash 825189371, now seen corresponding path program 1 times [2018-10-01 00:32:47,320 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:32:47,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:32:47,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:47,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:32:47,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:32:47,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:32:47,398 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:32:47,398 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:32:47,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:32:47,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:32:47,399 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:32:47,399 INFO L87 Difference]: Start difference. First operand 1985 states and 6886 transitions. Second operand 8 states. [2018-10-01 00:33:02,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:33:02,586 INFO L93 Difference]: Finished difference Result 3446 states and 10415 transitions. [2018-10-01 00:33:02,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:33:02,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-01 00:33:02,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:33:02,592 INFO L225 Difference]: With dead ends: 3446 [2018-10-01 00:33:02,592 INFO L226 Difference]: Without dead ends: 3440 [2018-10-01 00:33:02,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:33:02,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3440 states. [2018-10-01 00:33:04,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3440 to 1927. [2018-10-01 00:33:04,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1927 states. [2018-10-01 00:33:04,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 6663 transitions. [2018-10-01 00:33:04,872 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 6663 transitions. Word has length 9 [2018-10-01 00:33:04,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:33:04,872 INFO L480 AbstractCegarLoop]: Abstraction has 1927 states and 6663 transitions. [2018-10-01 00:33:04,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:33:04,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 6663 transitions. [2018-10-01 00:33:04,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:33:04,873 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:33:04,873 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:33:04,873 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:33:04,873 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:33:04,874 INFO L82 PathProgramCache]: Analyzing trace with hash 832700792, now seen corresponding path program 1 times [2018-10-01 00:33:04,874 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:33:04,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:33:04,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:04,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:33:04,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:33:04,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:33:04,967 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:33:04,967 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:33:04,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:33:04,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:33:04,968 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:33:04,968 INFO L87 Difference]: Start difference. First operand 1927 states and 6663 transitions. Second operand 8 states. [2018-10-01 00:33:16,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:33:16,950 INFO L93 Difference]: Finished difference Result 2832 states and 8631 transitions. [2018-10-01 00:33:16,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 00:33:16,950 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-01 00:33:16,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:33:16,956 INFO L225 Difference]: With dead ends: 2832 [2018-10-01 00:33:16,956 INFO L226 Difference]: Without dead ends: 2824 [2018-10-01 00:33:16,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:33:16,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2824 states. [2018-10-01 00:33:19,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2824 to 1904. [2018-10-01 00:33:19,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1904 states. [2018-10-01 00:33:19,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 6553 transitions. [2018-10-01 00:33:19,263 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 6553 transitions. Word has length 9 [2018-10-01 00:33:19,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:33:19,263 INFO L480 AbstractCegarLoop]: Abstraction has 1904 states and 6553 transitions. [2018-10-01 00:33:19,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:33:19,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 6553 transitions. [2018-10-01 00:33:19,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:33:19,265 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:33:19,265 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:33:19,265 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:33:19,265 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:33:19,265 INFO L82 PathProgramCache]: Analyzing trace with hash -595843680, now seen corresponding path program 1 times [2018-10-01 00:33:19,265 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:33:19,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:33:19,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:19,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:33:19,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:33:19,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:33:19,355 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:33:19,355 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:33:19,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:33:19,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:33:19,356 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:33:19,356 INFO L87 Difference]: Start difference. First operand 1904 states and 6553 transitions. Second operand 9 states. [2018-10-01 00:33:32,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:33:32,013 INFO L93 Difference]: Finished difference Result 3157 states and 9716 transitions. [2018-10-01 00:33:32,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:33:32,013 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-01 00:33:32,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:33:32,019 INFO L225 Difference]: With dead ends: 3157 [2018-10-01 00:33:32,019 INFO L226 Difference]: Without dead ends: 3151 [2018-10-01 00:33:32,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:33:32,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2018-10-01 00:33:34,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 1949. [2018-10-01 00:33:34,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2018-10-01 00:33:34,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 6722 transitions. [2018-10-01 00:33:34,408 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 6722 transitions. Word has length 9 [2018-10-01 00:33:34,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:33:34,408 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 6722 transitions. [2018-10-01 00:33:34,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:33:34,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 6722 transitions. [2018-10-01 00:33:34,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:33:34,409 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:33:34,410 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:33:34,410 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:33:34,410 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:33:34,410 INFO L82 PathProgramCache]: Analyzing trace with hash -595843677, now seen corresponding path program 1 times [2018-10-01 00:33:34,410 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:33:34,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:33:34,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:34,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:33:34,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:33:34,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:33:34,499 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:33:34,499 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:33:34,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:33:34,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:33:34,499 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:33:34,500 INFO L87 Difference]: Start difference. First operand 1949 states and 6722 transitions. Second operand 9 states. [2018-10-01 00:33:52,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:33:52,604 INFO L93 Difference]: Finished difference Result 3822 states and 11523 transitions. [2018-10-01 00:33:52,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-01 00:33:52,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-01 00:33:52,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:33:52,611 INFO L225 Difference]: With dead ends: 3822 [2018-10-01 00:33:52,611 INFO L226 Difference]: Without dead ends: 3816 [2018-10-01 00:33:52,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:33:52,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3816 states. [2018-10-01 00:33:55,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 2098. [2018-10-01 00:33:55,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2018-10-01 00:33:55,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 7405 transitions. [2018-10-01 00:33:55,350 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 7405 transitions. Word has length 9 [2018-10-01 00:33:55,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:33:55,350 INFO L480 AbstractCegarLoop]: Abstraction has 2098 states and 7405 transitions. [2018-10-01 00:33:55,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:33:55,350 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 7405 transitions. [2018-10-01 00:33:55,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:33:55,352 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:33:55,352 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:33:55,352 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:33:55,352 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:33:55,353 INFO L82 PathProgramCache]: Analyzing trace with hash -204435682, now seen corresponding path program 1 times [2018-10-01 00:33:55,353 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:33:55,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:33:55,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:55,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:33:55,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:33:55,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:33:55,510 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:33:55,510 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:33:55,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:33:55,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:33:55,511 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:33:55,511 INFO L87 Difference]: Start difference. First operand 2098 states and 7405 transitions. Second operand 9 states. [2018-10-01 00:34:15,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:34:15,352 INFO L93 Difference]: Finished difference Result 4144 states and 12499 transitions. [2018-10-01 00:34:15,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-01 00:34:15,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-01 00:34:15,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:34:15,360 INFO L225 Difference]: With dead ends: 4144 [2018-10-01 00:34:15,360 INFO L226 Difference]: Without dead ends: 4138 [2018-10-01 00:34:15,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:34:15,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4138 states. [2018-10-01 00:34:18,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4138 to 2260. [2018-10-01 00:34:18,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2260 states. [2018-10-01 00:34:18,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 7995 transitions. [2018-10-01 00:34:18,507 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 7995 transitions. Word has length 9 [2018-10-01 00:34:18,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:34:18,507 INFO L480 AbstractCegarLoop]: Abstraction has 2260 states and 7995 transitions. [2018-10-01 00:34:18,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:34:18,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 7995 transitions. [2018-10-01 00:34:18,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:34:18,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:34:18,509 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:34:18,509 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:34:18,509 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:34:18,509 INFO L82 PathProgramCache]: Analyzing trace with hash -204435307, now seen corresponding path program 1 times [2018-10-01 00:34:18,509 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:34:18,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:34:18,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:18,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:34:18,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:18,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:34:18,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:34:18,686 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:34:18,686 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:34:18,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:34:18,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:34:18,687 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:34:18,687 INFO L87 Difference]: Start difference. First operand 2260 states and 7995 transitions. Second operand 9 states. [2018-10-01 00:34:33,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:34:33,966 INFO L93 Difference]: Finished difference Result 3320 states and 10163 transitions. [2018-10-01 00:34:33,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-01 00:34:33,966 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-01 00:34:33,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:34:33,973 INFO L225 Difference]: With dead ends: 3320 [2018-10-01 00:34:33,973 INFO L226 Difference]: Without dead ends: 3314 [2018-10-01 00:34:33,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:34:33,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3314 states. [2018-10-01 00:34:37,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3314 to 2191. [2018-10-01 00:34:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2191 states. [2018-10-01 00:34:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 2191 states and 7721 transitions. [2018-10-01 00:34:37,161 INFO L78 Accepts]: Start accepts. Automaton has 2191 states and 7721 transitions. Word has length 9 [2018-10-01 00:34:37,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:34:37,161 INFO L480 AbstractCegarLoop]: Abstraction has 2191 states and 7721 transitions. [2018-10-01 00:34:37,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:34:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 7721 transitions. [2018-10-01 00:34:37,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:34:37,163 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:34:37,163 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:34:37,163 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:34:37,163 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:34:37,163 INFO L82 PathProgramCache]: Analyzing trace with hash -966522519, now seen corresponding path program 1 times [2018-10-01 00:34:37,163 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:34:37,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:34:37,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:37,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:34:37,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:34:37,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:34:37,239 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:34:37,239 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:34:37,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:34:37,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:34:37,240 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:34:37,240 INFO L87 Difference]: Start difference. First operand 2191 states and 7721 transitions. Second operand 8 states. [2018-10-01 00:34:58,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:34:58,709 INFO L93 Difference]: Finished difference Result 4113 states and 13014 transitions. [2018-10-01 00:34:58,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-01 00:34:58,709 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-01 00:34:58,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:34:58,717 INFO L225 Difference]: With dead ends: 4113 [2018-10-01 00:34:58,717 INFO L226 Difference]: Without dead ends: 4107 [2018-10-01 00:34:58,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:34:58,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2018-10-01 00:35:01,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 2224. [2018-10-01 00:35:01,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2224 states. [2018-10-01 00:35:01,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 7857 transitions. [2018-10-01 00:35:01,885 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 7857 transitions. Word has length 9 [2018-10-01 00:35:01,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:35:01,885 INFO L480 AbstractCegarLoop]: Abstraction has 2224 states and 7857 transitions. [2018-10-01 00:35:01,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:35:01,885 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 7857 transitions. [2018-10-01 00:35:01,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:35:01,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:35:01,886 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:35:01,887 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:35:01,887 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:35:01,887 INFO L82 PathProgramCache]: Analyzing trace with hash -966522144, now seen corresponding path program 1 times [2018-10-01 00:35:01,887 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:35:01,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:35:01,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:01,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:35:01,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:35:01,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:35:01,959 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:35:01,959 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:35:01,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:35:01,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:35:01,960 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:35:01,960 INFO L87 Difference]: Start difference. First operand 2224 states and 7857 transitions. Second operand 8 states. [2018-10-01 00:35:22,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:35:22,102 INFO L93 Difference]: Finished difference Result 4521 states and 14364 transitions. [2018-10-01 00:35:22,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:35:22,103 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-01 00:35:22,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:35:22,111 INFO L225 Difference]: With dead ends: 4521 [2018-10-01 00:35:22,112 INFO L226 Difference]: Without dead ends: 4515 [2018-10-01 00:35:22,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:35:22,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4515 states. [2018-10-01 00:35:25,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4515 to 2187. [2018-10-01 00:35:25,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2187 states. [2018-10-01 00:35:25,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2187 states to 2187 states and 7764 transitions. [2018-10-01 00:35:25,393 INFO L78 Accepts]: Start accepts. Automaton has 2187 states and 7764 transitions. Word has length 9 [2018-10-01 00:35:25,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:35:25,393 INFO L480 AbstractCegarLoop]: Abstraction has 2187 states and 7764 transitions. [2018-10-01 00:35:25,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:35:25,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 7764 transitions. [2018-10-01 00:35:25,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:35:25,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:35:25,394 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:35:25,395 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:35:25,395 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:35:25,395 INFO L82 PathProgramCache]: Analyzing trace with hash -703458751, now seen corresponding path program 1 times [2018-10-01 00:35:25,395 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:35:25,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:35:25,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:25,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:35:25,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:35:25,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:35:25,475 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:35:25,475 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:35:25,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:35:25,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:35:25,475 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:35:25,475 INFO L87 Difference]: Start difference. First operand 2187 states and 7764 transitions. Second operand 8 states. [2018-10-01 00:35:46,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:35:46,284 INFO L93 Difference]: Finished difference Result 3855 states and 12150 transitions. [2018-10-01 00:35:46,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-01 00:35:46,284 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-01 00:35:46,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:35:46,290 INFO L225 Difference]: With dead ends: 3855 [2018-10-01 00:35:46,291 INFO L226 Difference]: Without dead ends: 3849 [2018-10-01 00:35:46,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:35:46,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3849 states. [2018-10-01 00:35:49,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3849 to 2143. [2018-10-01 00:35:49,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2143 states. [2018-10-01 00:35:49,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2143 states to 2143 states and 7583 transitions. [2018-10-01 00:35:49,527 INFO L78 Accepts]: Start accepts. Automaton has 2143 states and 7583 transitions. Word has length 9 [2018-10-01 00:35:49,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:35:49,527 INFO L480 AbstractCegarLoop]: Abstraction has 2143 states and 7583 transitions. [2018-10-01 00:35:49,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:35:49,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2143 states and 7583 transitions. [2018-10-01 00:35:49,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:35:49,528 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:35:49,528 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:35:49,528 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:35:49,528 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:35:49,529 INFO L82 PathProgramCache]: Analyzing trace with hash -703458376, now seen corresponding path program 1 times [2018-10-01 00:35:49,529 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:35:49,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:35:49,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:49,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:35:49,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:35:49,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:35:49,603 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:35:49,603 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:35:49,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:35:49,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:35:49,604 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:35:49,604 INFO L87 Difference]: Start difference. First operand 2143 states and 7583 transitions. Second operand 8 states. [2018-10-01 00:36:08,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:36:08,480 INFO L93 Difference]: Finished difference Result 4238 states and 13299 transitions. [2018-10-01 00:36:08,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-01 00:36:08,480 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-01 00:36:08,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:36:08,487 INFO L225 Difference]: With dead ends: 4238 [2018-10-01 00:36:08,488 INFO L226 Difference]: Without dead ends: 4236 [2018-10-01 00:36:08,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:36:08,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4236 states. [2018-10-01 00:36:11,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4236 to 2077. [2018-10-01 00:36:11,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2077 states. [2018-10-01 00:36:11,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 2077 states and 7307 transitions. [2018-10-01 00:36:11,687 INFO L78 Accepts]: Start accepts. Automaton has 2077 states and 7307 transitions. Word has length 9 [2018-10-01 00:36:11,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:36:11,687 INFO L480 AbstractCegarLoop]: Abstraction has 2077 states and 7307 transitions. [2018-10-01 00:36:11,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:36:11,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 7307 transitions. [2018-10-01 00:36:11,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:36:11,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:36:11,689 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:36:11,689 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:36:11,689 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:36:11,689 INFO L82 PathProgramCache]: Analyzing trace with hash 2069416361, now seen corresponding path program 1 times [2018-10-01 00:36:11,689 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:36:11,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:36:11,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:11,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:36:11,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:36:11,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:36:11,762 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:36:11,762 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:36:11,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:36:11,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:36:11,763 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:36:11,763 INFO L87 Difference]: Start difference. First operand 2077 states and 7307 transitions. Second operand 8 states. [2018-10-01 00:36:33,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:36:33,892 INFO L93 Difference]: Finished difference Result 4709 states and 14887 transitions. [2018-10-01 00:36:33,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-01 00:36:33,893 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-01 00:36:33,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:36:33,902 INFO L225 Difference]: With dead ends: 4709 [2018-10-01 00:36:33,902 INFO L226 Difference]: Without dead ends: 4703 [2018-10-01 00:36:33,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:36:33,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4703 states. [2018-10-01 00:36:37,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4703 to 2205. [2018-10-01 00:36:37,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2205 states. [2018-10-01 00:36:37,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 7795 transitions. [2018-10-01 00:36:37,286 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 7795 transitions. Word has length 9 [2018-10-01 00:36:37,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:36:37,286 INFO L480 AbstractCegarLoop]: Abstraction has 2205 states and 7795 transitions. [2018-10-01 00:36:37,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:36:37,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 7795 transitions. [2018-10-01 00:36:37,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:36:37,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:36:37,288 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:36:37,288 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:36:37,288 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:36:37,288 INFO L82 PathProgramCache]: Analyzing trace with hash 2069416736, now seen corresponding path program 1 times [2018-10-01 00:36:37,288 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:36:37,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:36:37,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:37,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:36:37,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:36:37,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:36:37,403 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:36:37,403 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:36:37,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:36:37,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:36:37,403 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:36:37,404 INFO L87 Difference]: Start difference. First operand 2205 states and 7795 transitions. Second operand 8 states. [2018-10-01 00:36:54,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:36:54,673 INFO L93 Difference]: Finished difference Result 4247 states and 13579 transitions. [2018-10-01 00:36:54,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 00:36:54,673 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-01 00:36:54,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:36:54,682 INFO L225 Difference]: With dead ends: 4247 [2018-10-01 00:36:54,682 INFO L226 Difference]: Without dead ends: 4241 [2018-10-01 00:36:54,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:36:54,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4241 states. [2018-10-01 00:36:58,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4241 to 2723. [2018-10-01 00:36:58,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2018-10-01 00:36:58,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 9843 transitions. [2018-10-01 00:36:58,964 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 9843 transitions. Word has length 9 [2018-10-01 00:36:58,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:36:58,964 INFO L480 AbstractCegarLoop]: Abstraction has 2723 states and 9843 transitions. [2018-10-01 00:36:58,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:36:58,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 9843 transitions. [2018-10-01 00:36:58,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:36:58,966 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:36:58,966 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:36:58,967 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:36:58,967 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:36:58,967 INFO L82 PathProgramCache]: Analyzing trace with hash -2017829461, now seen corresponding path program 1 times [2018-10-01 00:36:58,967 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:36:58,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:36:58,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:58,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:36:58,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:36:59,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:36:59,057 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:36:59,058 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:36:59,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:36:59,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:36:59,058 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:36:59,058 INFO L87 Difference]: Start difference. First operand 2723 states and 9843 transitions. Second operand 9 states. [2018-10-01 00:37:15,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:37:15,023 INFO L93 Difference]: Finished difference Result 6774 states and 23375 transitions. [2018-10-01 00:37:15,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-01 00:37:15,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-01 00:37:15,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:37:15,032 INFO L225 Difference]: With dead ends: 6774 [2018-10-01 00:37:15,032 INFO L226 Difference]: Without dead ends: 4052 [2018-10-01 00:37:15,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:37:15,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4052 states. [2018-10-01 00:37:19,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4052 to 2719. [2018-10-01 00:37:19,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2719 states. [2018-10-01 00:37:19,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2719 states and 9745 transitions. [2018-10-01 00:37:19,375 INFO L78 Accepts]: Start accepts. Automaton has 2719 states and 9745 transitions. Word has length 9 [2018-10-01 00:37:19,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:37:19,375 INFO L480 AbstractCegarLoop]: Abstraction has 2719 states and 9745 transitions. [2018-10-01 00:37:19,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:37:19,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2719 states and 9745 transitions. [2018-10-01 00:37:19,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:37:19,376 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:37:19,376 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:37:19,376 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:37:19,377 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:37:19,377 INFO L82 PathProgramCache]: Analyzing trace with hash -2017829350, now seen corresponding path program 1 times [2018-10-01 00:37:19,377 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:37:19,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:37:19,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:37:19,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:37:19,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:37:19,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:37:19,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:37:19,462 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:37:19,462 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:37:19,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:37:19,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:37:19,463 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:37:19,463 INFO L87 Difference]: Start difference. First operand 2719 states and 9745 transitions. Second operand 9 states. [2018-10-01 00:37:38,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:37:38,614 INFO L93 Difference]: Finished difference Result 3818 states and 12356 transitions. [2018-10-01 00:37:38,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-01 00:37:38,614 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-01 00:37:38,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:37:38,621 INFO L225 Difference]: With dead ends: 3818 [2018-10-01 00:37:38,621 INFO L226 Difference]: Without dead ends: 3812 [2018-10-01 00:37:38,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:37:38,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3812 states. [2018-10-01 00:37:42,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3812 to 2654. [2018-10-01 00:37:42,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2654 states. [2018-10-01 00:37:42,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 9529 transitions. [2018-10-01 00:37:42,939 INFO L78 Accepts]: Start accepts. Automaton has 2654 states and 9529 transitions. Word has length 9 [2018-10-01 00:37:42,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:37:42,940 INFO L480 AbstractCegarLoop]: Abstraction has 2654 states and 9529 transitions. [2018-10-01 00:37:42,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:37:42,940 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 9529 transitions. [2018-10-01 00:37:42,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:37:42,941 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:37:42,941 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:37:42,941 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:37:42,941 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:37:42,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1544214472, now seen corresponding path program 1 times [2018-10-01 00:37:42,941 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:37:42,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:37:42,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:37:42,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:37:42,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:37:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:37:43,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:37:43,051 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:37:43,052 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:37:43,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:37:43,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:37:43,052 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:37:43,052 INFO L87 Difference]: Start difference. First operand 2654 states and 9529 transitions. Second operand 9 states. [2018-10-01 00:37:59,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:37:59,629 INFO L93 Difference]: Finished difference Result 6017 states and 20262 transitions. [2018-10-01 00:37:59,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-01 00:37:59,629 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-01 00:37:59,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:37:59,636 INFO L225 Difference]: With dead ends: 6017 [2018-10-01 00:37:59,636 INFO L226 Difference]: Without dead ends: 3832 [2018-10-01 00:37:59,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:37:59,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3832 states. [2018-10-01 00:38:04,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3832 to 2609. [2018-10-01 00:38:04,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2609 states. [2018-10-01 00:38:04,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2609 states to 2609 states and 9097 transitions. [2018-10-01 00:38:04,063 INFO L78 Accepts]: Start accepts. Automaton has 2609 states and 9097 transitions. Word has length 9 [2018-10-01 00:38:04,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:04,063 INFO L480 AbstractCegarLoop]: Abstraction has 2609 states and 9097 transitions. [2018-10-01 00:38:04,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:38:04,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 9097 transitions. [2018-10-01 00:38:04,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:38:04,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:04,065 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:38:04,065 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr7ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:04,065 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:04,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1544214097, now seen corresponding path program 1 times [2018-10-01 00:38:04,065 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:04,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:04,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:04,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:04,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:04,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:04,153 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:38:04,153 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:38:04,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:38:04,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:38:04,154 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:04,154 INFO L87 Difference]: Start difference. First operand 2609 states and 9097 transitions. Second operand 9 states. Received shutdown request... [2018-10-01 00:38:24,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-01 00:38:24,241 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-01 00:38:24,246 WARN L206 ceAbstractionStarter]: Timeout [2018-10-01 00:38:24,247 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:38:24 BoogieIcfgContainer [2018-10-01 00:38:24,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:38:24,248 INFO L168 Benchmark]: Toolchain (without parser) took 818032.22 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.5 GB in the beginning and 915.3 MB in the end (delta: 563.5 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-10-01 00:38:24,250 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:38:24,251 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:38:24,251 INFO L168 Benchmark]: Boogie Preprocessor took 50.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:38:24,252 INFO L168 Benchmark]: RCFGBuilder took 1202.27 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-10-01 00:38:24,253 INFO L168 Benchmark]: TraceAbstraction took 816726.21 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 915.3 MB in the end (delta: 521.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-10-01 00:38:24,257 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.23 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 45.37 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 50.83 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 1202.27 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 816726.21 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 915.3 MB in the end (delta: 521.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: 337]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 337). Cancelled while BasicCegarLoop was constructing difference of abstraction (2609states) and FLOYD_HOARE automaton (currently 28 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (3893 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 (2609states) and FLOYD_HOARE automaton (currently 28 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (3893 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 (2609states) and FLOYD_HOARE automaton (currently 28 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (3893 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 (2609states) and FLOYD_HOARE automaton (currently 28 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (3893 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 (2609states) and FLOYD_HOARE automaton (currently 28 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (3893 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 (2609states) and FLOYD_HOARE automaton (currently 28 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (3893 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 (2609states) and FLOYD_HOARE automaton (currently 28 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (3893 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 (2609states) and FLOYD_HOARE automaton (currently 28 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (3893 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 (2609states) and FLOYD_HOARE automaton (currently 28 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (3893 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 (2609states) and FLOYD_HOARE automaton (currently 28 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (3893 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 (2609states) and FLOYD_HOARE automaton (currently 28 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (3893 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 (2609states) and FLOYD_HOARE automaton (currently 28 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (3893 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 (2609states) and FLOYD_HOARE automaton (currently 28 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (3893 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 (2609states) and FLOYD_HOARE automaton (currently 28 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (3893 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 (2609states) and FLOYD_HOARE automaton (currently 28 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (3893 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 (2609states) and FLOYD_HOARE automaton (currently 28 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (3893 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 95). Cancelled while BasicCegarLoop was constructing difference of abstraction (2609states) and FLOYD_HOARE automaton (currently 28 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (3893 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 (2609states) and FLOYD_HOARE automaton (currently 28 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (3893 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 (2609states) and FLOYD_HOARE automaton (currently 28 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (3893 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 (2609states) and FLOYD_HOARE automaton (currently 28 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (3893 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 (2609states) and FLOYD_HOARE automaton (currently 28 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (3893 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 (2609states) and FLOYD_HOARE automaton (currently 28 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (3893 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 (2609states) and FLOYD_HOARE automaton (currently 28 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (3893 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 (2609states) and FLOYD_HOARE automaton (currently 28 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (3893 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 (2609states) and FLOYD_HOARE automaton (currently 28 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (3893 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 (2609states) and FLOYD_HOARE automaton (currently 28 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (3893 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 (2609states) and FLOYD_HOARE automaton (currently 28 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (3893 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 27 error locations. TIMEOUT Result, 816.6s OverallTime, 61 OverallIterations, 2 TraceHistogramMax, 725.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 17686 SDtfs, 31496 SDslu, 33911 SDs, 0 SdLazy, 121663 SolverSat, 11440 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 153.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 980 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 976 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2723occurred in iteration=57, 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: 83.0s AutomataMinimizationTime, 60 MinimizatonAttempts, 57724 StatesRemovedByMinimization, 60 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 500 NumberOfCodeBlocks, 500 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 439 ConstructedInterpolants, 0 QuantifiedInterpolants, 45190 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 61 InterpolantComputations, 61 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_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-38-24-275.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out3.mover.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_00-38-24-275.csv Completed graceful shutdown