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-9f4048f [2018-10-04 12:42:02,427 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:42:02,429 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:42:02,441 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:42:02,441 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:42:02,442 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:42:02,444 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:42:02,446 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:42:02,447 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:42:02,448 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:42:02,449 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:42:02,449 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:42:02,450 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:42:02,451 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:42:02,452 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:42:02,453 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:42:02,454 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:42:02,456 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:42:02,458 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:42:02,460 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:42:02,461 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:42:02,462 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:42:02,464 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:42:02,465 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:42:02,465 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:42:02,466 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:42:02,467 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:42:02,468 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:42:02,468 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:42:02,470 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:42:02,470 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:42:02,471 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:42:02,471 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:42:02,471 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:42:02,472 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:42:02,473 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:42:02,473 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-04 12:42:02,496 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:42:02,496 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:42:02,497 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:42:02,497 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:42:02,498 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:42:02,498 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:42:02,498 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:42:02,499 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:42:02,499 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:42:02,499 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:42:02,499 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:42:02,499 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:42:02,500 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:42:02,500 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:42:02,500 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:42:02,500 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:42:02,500 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:42:02,500 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:42:02,501 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:42:02,501 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:42:02,501 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:42:02,501 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:42:02,502 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:42:02,502 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:42:02,502 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:42:02,502 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:42:02,502 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:42:02,503 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:42:02,503 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:42:02,503 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:42:02,503 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:42:02,547 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:42:02,564 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:42:02,573 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:42:02,576 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:42:02,577 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:42:02,577 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-04 12:42:02,578 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl' [2018-10-04 12:42:02,677 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:42:02,678 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:42:02,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:42:02,679 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:42:02,680 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:42:02,702 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 04.10 12:42:02" (1/1) ... [2018-10-04 12:42:02,726 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 04.10 12:42:02" (1/1) ... [2018-10-04 12:42:02,735 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:42:02,736 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:42:02,736 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:42:02,742 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:42:02,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:42:02,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:42:02,746 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:42:02,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:02" (1/1) ... [2018-10-04 12:42:02,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:02" (1/1) ... [2018-10-04 12:42:02,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:02" (1/1) ... [2018-10-04 12:42:02,768 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:02" (1/1) ... [2018-10-04 12:42:02,785 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:02" (1/1) ... [2018-10-04 12:42:02,802 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:02" (1/1) ... [2018-10-04 12:42:02,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:02" (1/1) ... [2018-10-04 12:42:02,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:42:02,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:42:02,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:42:02,819 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:42:02,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:02" (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-04 12:42:02,912 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-04 12:42:02,912 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-04 12:42:02,912 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-04 12:42:04,129 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:42:04,130 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:42:04 BoogieIcfgContainer [2018-10-04 12:42:04,130 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:42:04,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:42:04,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:42:04,135 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:42:04,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:02" (1/2) ... [2018-10-04 12:42:04,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c4a9c4 and model type threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:42:04, skipping insertion in model container [2018-10-04 12:42:04,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:42:04" (2/2) ... [2018-10-04 12:42:04,138 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out3.mover.bpl [2018-10-04 12:42:04,147 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:42:04,156 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-10-04 12:42:04,210 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:42:04,211 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:42:04,211 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:42:04,211 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:42:04,211 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:42:04,211 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:42:04,212 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:42:04,212 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:42:04,212 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:42:04,231 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-10-04 12:42:04,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:42:04,238 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:04,239 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 12:42:04,241 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:04,248 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:04,248 INFO L82 PathProgramCache]: Analyzing trace with hash 45506320, now seen corresponding path program 1 times [2018-10-04 12:42:04,251 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:04,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:04,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:04,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:04,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:04,465 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-04 12:42:04,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:04,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:04,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:42:04,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:42:04,488 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:04,490 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 5 states. [2018-10-04 12:42:06,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:06,184 INFO L93 Difference]: Finished difference Result 142 states and 303 transitions. [2018-10-04 12:42:06,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:42:06,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 12:42:06,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:06,205 INFO L225 Difference]: With dead ends: 142 [2018-10-04 12:42:06,205 INFO L226 Difference]: Without dead ends: 138 [2018-10-04 12:42:06,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 12:42:06,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-04 12:42:06,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 98. [2018-10-04 12:42:06,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-04 12:42:06,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 219 transitions. [2018-10-04 12:42:06,273 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 219 transitions. Word has length 5 [2018-10-04 12:42:06,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:06,275 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 219 transitions. [2018-10-04 12:42:06,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:42:06,276 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 219 transitions. [2018-10-04 12:42:06,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:42:06,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:06,277 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 12:42:06,279 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:06,279 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:06,280 INFO L82 PathProgramCache]: Analyzing trace with hash 45756290, now seen corresponding path program 1 times [2018-10-04 12:42:06,282 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:06,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:06,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:06,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:06,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:06,383 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-04 12:42:06,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:06,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:06,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:42:06,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:42:06,385 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:06,386 INFO L87 Difference]: Start difference. First operand 98 states and 219 transitions. Second operand 5 states. [2018-10-04 12:42:08,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:08,021 INFO L93 Difference]: Finished difference Result 241 states and 539 transitions. [2018-10-04 12:42:08,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:42:08,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 12:42:08,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:08,030 INFO L225 Difference]: With dead ends: 241 [2018-10-04 12:42:08,031 INFO L226 Difference]: Without dead ends: 237 [2018-10-04 12:42:08,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 12:42:08,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-04 12:42:08,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 134. [2018-10-04 12:42:08,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-04 12:42:08,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 355 transitions. [2018-10-04 12:42:08,071 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 355 transitions. Word has length 5 [2018-10-04 12:42:08,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:08,072 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 355 transitions. [2018-10-04 12:42:08,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:42:08,072 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 355 transitions. [2018-10-04 12:42:08,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:42:08,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:08,073 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 12:42:08,074 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:08,074 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:08,075 INFO L82 PathProgramCache]: Analyzing trace with hash 28948051, now seen corresponding path program 1 times [2018-10-04 12:42:08,075 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:08,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:08,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:08,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:08,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:08,170 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-04 12:42:08,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:08,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:08,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:42:08,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:42:08,172 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:08,172 INFO L87 Difference]: Start difference. First operand 134 states and 355 transitions. Second operand 5 states. [2018-10-04 12:42:10,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:10,064 INFO L93 Difference]: Finished difference Result 269 states and 639 transitions. [2018-10-04 12:42:10,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:42:10,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 12:42:10,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:10,076 INFO L225 Difference]: With dead ends: 269 [2018-10-04 12:42:10,077 INFO L226 Difference]: Without dead ends: 265 [2018-10-04 12:42:10,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 12:42:10,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-10-04 12:42:10,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 162. [2018-10-04 12:42:10,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-04 12:42:10,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 455 transitions. [2018-10-04 12:42:10,143 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 455 transitions. Word has length 5 [2018-10-04 12:42:10,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:10,149 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 455 transitions. [2018-10-04 12:42:10,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:42:10,150 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 455 transitions. [2018-10-04 12:42:10,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:10,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:10,151 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:10,153 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:10,155 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:10,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558066, now seen corresponding path program 1 times [2018-10-04 12:42:10,156 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:10,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:10,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:10,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:10,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:10,455 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-04 12:42:10,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:10,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:42:10,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:10,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:10,457 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:10,458 INFO L87 Difference]: Start difference. First operand 162 states and 455 transitions. Second operand 8 states. [2018-10-04 12:42:14,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:14,706 INFO L93 Difference]: Finished difference Result 790 states and 2085 transitions. [2018-10-04 12:42:14,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:42:14,707 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:42:14,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:14,714 INFO L225 Difference]: With dead ends: 790 [2018-10-04 12:42:14,714 INFO L226 Difference]: Without dead ends: 629 [2018-10-04 12:42:14,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 10 [2018-10-04 12:42:14,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-10-04 12:42:14,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 278. [2018-10-04 12:42:14,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-10-04 12:42:14,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 854 transitions. [2018-10-04 12:42:14,774 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 854 transitions. Word has length 8 [2018-10-04 12:42:14,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:14,774 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 854 transitions. [2018-10-04 12:42:14,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:14,775 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 854 transitions. [2018-10-04 12:42:14,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:14,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:14,777 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:14,778 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:14,778 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:14,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558063, now seen corresponding path program 1 times [2018-10-04 12:42:14,778 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:14,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:14,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:14,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:14,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:14,951 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-04 12:42:14,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:14,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:42:14,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:14,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:14,952 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:14,952 INFO L87 Difference]: Start difference. First operand 278 states and 854 transitions. Second operand 8 states. [2018-10-04 12:42:18,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:18,519 INFO L93 Difference]: Finished difference Result 634 states and 1540 transitions. [2018-10-04 12:42:18,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:42:18,520 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:42:18,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:18,525 INFO L225 Difference]: With dead ends: 634 [2018-10-04 12:42:18,526 INFO L226 Difference]: Without dead ends: 628 [2018-10-04 12:42:18,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 16 [2018-10-04 12:42:18,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-10-04 12:42:18,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 310. [2018-10-04 12:42:18,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-10-04 12:42:18,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 963 transitions. [2018-10-04 12:42:18,595 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 963 transitions. Word has length 8 [2018-10-04 12:42:18,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:18,595 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 963 transitions. [2018-10-04 12:42:18,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:18,595 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 963 transitions. [2018-10-04 12:42:18,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:18,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:18,597 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:18,598 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:18,599 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:18,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1080099218, now seen corresponding path program 1 times [2018-10-04 12:42:18,599 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:18,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:18,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:18,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:18,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:18,714 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-04 12:42:18,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:18,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:42:18,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:18,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:18,715 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:18,716 INFO L87 Difference]: Start difference. First operand 310 states and 963 transitions. Second operand 8 states. [2018-10-04 12:42:22,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:22,772 INFO L93 Difference]: Finished difference Result 768 states and 2087 transitions. [2018-10-04 12:42:22,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:42:22,774 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:42:22,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:22,779 INFO L225 Difference]: With dead ends: 768 [2018-10-04 12:42:22,780 INFO L226 Difference]: Without dead ends: 537 [2018-10-04 12:42:22,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime 9 [2018-10-04 12:42:22,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-10-04 12:42:22,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 334. [2018-10-04 12:42:22,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-10-04 12:42:22,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1037 transitions. [2018-10-04 12:42:22,844 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1037 transitions. Word has length 8 [2018-10-04 12:42:22,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:22,845 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 1037 transitions. [2018-10-04 12:42:22,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:22,845 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1037 transitions. [2018-10-04 12:42:22,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:22,846 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:22,846 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:22,847 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:22,848 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:22,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595081, now seen corresponding path program 1 times [2018-10-04 12:42:22,848 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:22,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:22,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:22,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:22,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:22,983 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-04 12:42:22,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:22,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:42:22,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:22,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:22,984 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:22,985 INFO L87 Difference]: Start difference. First operand 334 states and 1037 transitions. Second operand 8 states. [2018-10-04 12:42:25,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:25,604 INFO L93 Difference]: Finished difference Result 1145 states and 3146 transitions. [2018-10-04 12:42:25,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:42:25,609 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:42:25,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:25,615 INFO L225 Difference]: With dead ends: 1145 [2018-10-04 12:42:25,616 INFO L226 Difference]: Without dead ends: 812 [2018-10-04 12:42:25,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 17 [2018-10-04 12:42:25,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2018-10-04 12:42:25,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 450. [2018-10-04 12:42:25,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-10-04 12:42:25,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1432 transitions. [2018-10-04 12:42:25,717 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1432 transitions. Word has length 8 [2018-10-04 12:42:25,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:25,717 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 1432 transitions. [2018-10-04 12:42:25,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:25,718 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1432 transitions. [2018-10-04 12:42:25,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:25,719 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:25,719 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:25,720 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:25,720 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:25,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595078, now seen corresponding path program 1 times [2018-10-04 12:42:25,721 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:25,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:25,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:25,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:25,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:25,817 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-04 12:42:25,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:25,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:42:25,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:25,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:25,820 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:25,820 INFO L87 Difference]: Start difference. First operand 450 states and 1432 transitions. Second operand 8 states. [2018-10-04 12:42:27,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:27,936 INFO L93 Difference]: Finished difference Result 877 states and 2260 transitions. [2018-10-04 12:42:27,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:42:27,936 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:42:27,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:27,942 INFO L225 Difference]: With dead ends: 877 [2018-10-04 12:42:27,942 INFO L226 Difference]: Without dead ends: 871 [2018-10-04 12:42:27,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 10 [2018-10-04 12:42:27,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-10-04 12:42:28,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 478. [2018-10-04 12:42:28,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-10-04 12:42:28,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1531 transitions. [2018-10-04 12:42:28,050 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1531 transitions. Word has length 8 [2018-10-04 12:42:28,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:28,051 INFO L480 AbstractCegarLoop]: Abstraction has 478 states and 1531 transitions. [2018-10-04 12:42:28,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:28,051 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1531 transitions. [2018-10-04 12:42:28,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:28,052 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:28,052 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:28,053 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:28,053 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:28,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064444, now seen corresponding path program 1 times [2018-10-04 12:42:28,053 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:28,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:28,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:28,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:28,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:28,234 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-04 12:42:28,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:28,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:42:28,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:28,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:28,235 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:28,235 INFO L87 Difference]: Start difference. First operand 478 states and 1531 transitions. Second operand 8 states. [2018-10-04 12:42:30,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:30,508 INFO L93 Difference]: Finished difference Result 1049 states and 2854 transitions. [2018-10-04 12:42:30,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:42:30,508 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:42:30,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:30,513 INFO L225 Difference]: With dead ends: 1049 [2018-10-04 12:42:30,514 INFO L226 Difference]: Without dead ends: 818 [2018-10-04 12:42:30,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 14 [2018-10-04 12:42:30,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2018-10-04 12:42:30,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 524. [2018-10-04 12:42:30,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-10-04 12:42:30,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1684 transitions. [2018-10-04 12:42:30,652 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1684 transitions. Word has length 8 [2018-10-04 12:42:30,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:30,653 INFO L480 AbstractCegarLoop]: Abstraction has 524 states and 1684 transitions. [2018-10-04 12:42:30,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:30,653 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1684 transitions. [2018-10-04 12:42:30,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:30,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:30,654 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:30,655 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:30,655 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:30,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064441, now seen corresponding path program 1 times [2018-10-04 12:42:30,655 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:30,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:30,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:30,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:30,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:30,740 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-04 12:42:30,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:30,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:42:30,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:30,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:30,741 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:30,741 INFO L87 Difference]: Start difference. First operand 524 states and 1684 transitions. Second operand 8 states. [2018-10-04 12:42:32,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:32,738 INFO L93 Difference]: Finished difference Result 733 states and 1997 transitions. [2018-10-04 12:42:32,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:42:32,738 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:42:32,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:32,743 INFO L225 Difference]: With dead ends: 733 [2018-10-04 12:42:32,744 INFO L226 Difference]: Without dead ends: 727 [2018-10-04 12:42:32,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:42:32,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-10-04 12:42:32,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 530. [2018-10-04 12:42:32,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-10-04 12:42:32,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1690 transitions. [2018-10-04 12:42:32,910 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1690 transitions. Word has length 8 [2018-10-04 12:42:32,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:32,910 INFO L480 AbstractCegarLoop]: Abstraction has 530 states and 1690 transitions. [2018-10-04 12:42:32,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:32,910 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1690 transitions. [2018-10-04 12:42:32,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:32,911 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:32,912 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:32,912 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:32,913 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:32,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656691, now seen corresponding path program 1 times [2018-10-04 12:42:32,913 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:32,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:32,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:32,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:32,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:33,243 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-04 12:42:33,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:33,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:42:33,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:33,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:33,244 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:33,245 INFO L87 Difference]: Start difference. First operand 530 states and 1690 transitions. Second operand 8 states. [2018-10-04 12:42:34,098 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:42:36,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:36,541 INFO L93 Difference]: Finished difference Result 1329 states and 3609 transitions. [2018-10-04 12:42:36,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 12:42:36,541 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:42:36,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:36,550 INFO L225 Difference]: With dead ends: 1329 [2018-10-04 12:42:36,551 INFO L226 Difference]: Without dead ends: 1323 [2018-10-04 12:42:36,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 10 [2018-10-04 12:42:36,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2018-10-04 12:42:36,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 626. [2018-10-04 12:42:36,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-10-04 12:42:36,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 2087 transitions. [2018-10-04 12:42:36,758 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 2087 transitions. Word has length 8 [2018-10-04 12:42:36,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:36,758 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 2087 transitions. [2018-10-04 12:42:36,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:36,758 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 2087 transitions. [2018-10-04 12:42:36,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:36,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:36,760 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:36,761 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:36,761 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:36,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656688, now seen corresponding path program 1 times [2018-10-04 12:42:36,761 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:36,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:36,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:36,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:36,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:36,844 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-04 12:42:36,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:36,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:42:36,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:36,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:36,845 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:36,845 INFO L87 Difference]: Start difference. First operand 626 states and 2087 transitions. Second operand 8 states. [2018-10-04 12:42:39,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:39,184 INFO L93 Difference]: Finished difference Result 1268 states and 3539 transitions. [2018-10-04 12:42:39,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:42:39,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:42:39,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:39,190 INFO L225 Difference]: With dead ends: 1268 [2018-10-04 12:42:39,190 INFO L226 Difference]: Without dead ends: 1262 [2018-10-04 12:42:39,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 15 [2018-10-04 12:42:39,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2018-10-04 12:42:39,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 618. [2018-10-04 12:42:39,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-10-04 12:42:39,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 2056 transitions. [2018-10-04 12:42:39,402 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 2056 transitions. Word has length 8 [2018-10-04 12:42:39,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:39,403 INFO L480 AbstractCegarLoop]: Abstraction has 618 states and 2056 transitions. [2018-10-04 12:42:39,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:39,403 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 2056 transitions. [2018-10-04 12:42:39,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:39,404 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:39,405 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:39,405 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:39,406 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:39,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285639, now seen corresponding path program 1 times [2018-10-04 12:42:39,406 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:39,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:39,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:39,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:39,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:39,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-04 12:42:39,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:39,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:42:39,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:39,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:39,511 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:39,512 INFO L87 Difference]: Start difference. First operand 618 states and 2056 transitions. Second operand 8 states. [2018-10-04 12:42:42,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:42,207 INFO L93 Difference]: Finished difference Result 1367 states and 3876 transitions. [2018-10-04 12:42:42,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:42:42,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:42:42,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:42,216 INFO L225 Difference]: With dead ends: 1367 [2018-10-04 12:42:42,217 INFO L226 Difference]: Without dead ends: 1361 [2018-10-04 12:42:42,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 15 [2018-10-04 12:42:42,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2018-10-04 12:42:42,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 671. [2018-10-04 12:42:42,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2018-10-04 12:42:42,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 2249 transitions. [2018-10-04 12:42:42,472 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 2249 transitions. Word has length 8 [2018-10-04 12:42:42,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:42,473 INFO L480 AbstractCegarLoop]: Abstraction has 671 states and 2249 transitions. [2018-10-04 12:42:42,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:42,473 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 2249 transitions. [2018-10-04 12:42:42,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:42,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:42,474 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:42,474 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:42,474 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:42,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285636, now seen corresponding path program 1 times [2018-10-04 12:42:42,475 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:42,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:42,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:42,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:42,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:42,563 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-04 12:42:42,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:42,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:42:42,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:42,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:42,565 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:42,565 INFO L87 Difference]: Start difference. First operand 671 states and 2249 transitions. Second operand 8 states. [2018-10-04 12:42:45,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:45,853 INFO L93 Difference]: Finished difference Result 1373 states and 3787 transitions. [2018-10-04 12:42:45,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:42:45,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:42:45,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:45,863 INFO L225 Difference]: With dead ends: 1373 [2018-10-04 12:42:45,863 INFO L226 Difference]: Without dead ends: 1367 [2018-10-04 12:42:45,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 17 [2018-10-04 12:42:45,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-10-04 12:42:46,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 698. [2018-10-04 12:42:46,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-10-04 12:42:46,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 2344 transitions. [2018-10-04 12:42:46,105 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 2344 transitions. Word has length 8 [2018-10-04 12:42:46,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:46,105 INFO L480 AbstractCegarLoop]: Abstraction has 698 states and 2344 transitions. [2018-10-04 12:42:46,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:46,106 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 2344 transitions. [2018-10-04 12:42:46,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:46,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:46,107 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:46,108 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:46,108 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:46,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280348, now seen corresponding path program 1 times [2018-10-04 12:42:46,108 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:46,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:46,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:46,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:46,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:46,193 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-04 12:42:46,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:46,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:42:46,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:42:46,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:42:46,195 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:46,195 INFO L87 Difference]: Start difference. First operand 698 states and 2344 transitions. Second operand 7 states. [2018-10-04 12:42:48,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:48,560 INFO L93 Difference]: Finished difference Result 1526 states and 4298 transitions. [2018-10-04 12:42:48,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:42:48,561 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:42:48,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:48,569 INFO L225 Difference]: With dead ends: 1526 [2018-10-04 12:42:48,569 INFO L226 Difference]: Without dead ends: 1520 [2018-10-04 12:42:48,570 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 14 [2018-10-04 12:42:48,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2018-10-04 12:42:48,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 789. [2018-10-04 12:42:48,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-10-04 12:42:48,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 2673 transitions. [2018-10-04 12:42:48,823 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 2673 transitions. Word has length 8 [2018-10-04 12:42:48,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:48,823 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 2673 transitions. [2018-10-04 12:42:48,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:42:48,823 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 2673 transitions. [2018-10-04 12:42:48,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:48,824 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:48,824 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:48,825 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:48,825 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:48,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280221, now seen corresponding path program 1 times [2018-10-04 12:42:48,825 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:48,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:48,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:48,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:48,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:48,907 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-04 12:42:48,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:48,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:42:48,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:42:48,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:42:48,908 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:48,908 INFO L87 Difference]: Start difference. First operand 789 states and 2673 transitions. Second operand 7 states. [2018-10-04 12:42:51,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:51,449 INFO L93 Difference]: Finished difference Result 1548 states and 4356 transitions. [2018-10-04 12:42:51,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:42:51,450 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:42:51,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:51,457 INFO L225 Difference]: With dead ends: 1548 [2018-10-04 12:42:51,458 INFO L226 Difference]: Without dead ends: 1542 [2018-10-04 12:42:51,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 15 [2018-10-04 12:42:51,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2018-10-04 12:42:51,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 821. [2018-10-04 12:42:51,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-10-04 12:42:51,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 2801 transitions. [2018-10-04 12:42:51,756 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 2801 transitions. Word has length 8 [2018-10-04 12:42:51,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:51,757 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 2801 transitions. [2018-10-04 12:42:51,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:42:51,757 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 2801 transitions. [2018-10-04 12:42:51,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:51,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:51,758 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:51,758 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:51,759 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:51,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878937, now seen corresponding path program 1 times [2018-10-04 12:42:51,759 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:51,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:51,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:51,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:51,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:51,842 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-04 12:42:51,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:51,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:42:51,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:42:51,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:42:51,844 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:51,844 INFO L87 Difference]: Start difference. First operand 821 states and 2801 transitions. Second operand 7 states. [2018-10-04 12:42:54,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:54,506 INFO L93 Difference]: Finished difference Result 1575 states and 4539 transitions. [2018-10-04 12:42:54,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:42:54,506 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:42:54,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:54,514 INFO L225 Difference]: With dead ends: 1575 [2018-10-04 12:42:54,514 INFO L226 Difference]: Without dead ends: 1569 [2018-10-04 12:42:54,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 14 [2018-10-04 12:42:54,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2018-10-04 12:42:54,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 849. [2018-10-04 12:42:54,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-10-04 12:42:54,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2913 transitions. [2018-10-04 12:42:54,834 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 2913 transitions. Word has length 8 [2018-10-04 12:42:54,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:54,834 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 2913 transitions. [2018-10-04 12:42:54,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:42:54,834 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 2913 transitions. [2018-10-04 12:42:54,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:54,835 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:54,835 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:54,836 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:54,836 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:54,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878810, now seen corresponding path program 1 times [2018-10-04 12:42:54,836 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:54,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:54,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:54,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:54,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:54,915 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-04 12:42:54,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:54,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:42:54,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:42:54,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:42:54,916 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:54,916 INFO L87 Difference]: Start difference. First operand 849 states and 2913 transitions. Second operand 7 states. [2018-10-04 12:42:57,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:57,382 INFO L93 Difference]: Finished difference Result 1597 states and 4579 transitions. [2018-10-04 12:42:57,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:42:57,383 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:42:57,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:57,393 INFO L225 Difference]: With dead ends: 1597 [2018-10-04 12:42:57,393 INFO L226 Difference]: Without dead ends: 1591 [2018-10-04 12:42:57,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 12 [2018-10-04 12:42:57,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-10-04 12:42:57,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 873. [2018-10-04 12:42:57,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-10-04 12:42:57,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 2993 transitions. [2018-10-04 12:42:57,725 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 2993 transitions. Word has length 8 [2018-10-04 12:42:57,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:57,725 INFO L480 AbstractCegarLoop]: Abstraction has 873 states and 2993 transitions. [2018-10-04 12:42:57,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:42:57,725 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 2993 transitions. [2018-10-04 12:42:57,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:57,726 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:57,727 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:57,728 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:57,728 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:57,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288024, now seen corresponding path program 1 times [2018-10-04 12:42:57,728 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:57,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:57,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:57,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:57,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:57,906 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-04 12:42:57,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:57,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:42:57,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:42:57,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:42:57,907 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:57,908 INFO L87 Difference]: Start difference. First operand 873 states and 2993 transitions. Second operand 7 states. [2018-10-04 12:43:00,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:00,146 INFO L93 Difference]: Finished difference Result 1726 states and 5211 transitions. [2018-10-04 12:43:00,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:43:00,146 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:43:00,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:00,158 INFO L225 Difference]: With dead ends: 1726 [2018-10-04 12:43:00,158 INFO L226 Difference]: Without dead ends: 1720 [2018-10-04 12:43:00,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 11 [2018-10-04 12:43:00,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2018-10-04 12:43:00,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1006. [2018-10-04 12:43:00,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2018-10-04 12:43:00,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 3474 transitions. [2018-10-04 12:43:00,582 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 3474 transitions. Word has length 8 [2018-10-04 12:43:00,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:00,582 INFO L480 AbstractCegarLoop]: Abstraction has 1006 states and 3474 transitions. [2018-10-04 12:43:00,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:43:00,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 3474 transitions. [2018-10-04 12:43:00,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:43:00,583 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:00,583 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:00,584 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:00,584 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:00,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288027, now seen corresponding path program 1 times [2018-10-04 12:43:00,584 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:00,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:00,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:00,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:00,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:00,680 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-04 12:43:00,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:43:00,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:43:00,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:43:00,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:43:00,681 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:00,681 INFO L87 Difference]: Start difference. First operand 1006 states and 3474 transitions. Second operand 7 states. [2018-10-04 12:43:03,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:03,881 INFO L93 Difference]: Finished difference Result 1758 states and 5203 transitions. [2018-10-04 12:43:03,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:43:03,881 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:43:03,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:03,890 INFO L225 Difference]: With dead ends: 1758 [2018-10-04 12:43:03,890 INFO L226 Difference]: Without dead ends: 1752 [2018-10-04 12:43:03,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 12 [2018-10-04 12:43:03,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2018-10-04 12:43:04,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1011. [2018-10-04 12:43:04,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-10-04 12:43:04,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 3493 transitions. [2018-10-04 12:43:04,338 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 3493 transitions. Word has length 8 [2018-10-04 12:43:04,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:04,338 INFO L480 AbstractCegarLoop]: Abstraction has 1011 states and 3493 transitions. [2018-10-04 12:43:04,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:43:04,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 3493 transitions. [2018-10-04 12:43:04,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:43:04,339 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:04,339 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:04,340 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:04,340 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:04,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746872, now seen corresponding path program 1 times [2018-10-04 12:43:04,340 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:04,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:04,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:04,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:04,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:04,412 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-04 12:43:04,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:43:04,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:43:04,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:43:04,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:43:04,414 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:04,414 INFO L87 Difference]: Start difference. First operand 1011 states and 3493 transitions. Second operand 7 states. [2018-10-04 12:43:07,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:07,569 INFO L93 Difference]: Finished difference Result 1867 states and 5608 transitions. [2018-10-04 12:43:07,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:43:07,569 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:43:07,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:07,576 INFO L225 Difference]: With dead ends: 1867 [2018-10-04 12:43:07,576 INFO L226 Difference]: Without dead ends: 1861 [2018-10-04 12:43:07,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 12 [2018-10-04 12:43:07,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2018-10-04 12:43:08,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1119. [2018-10-04 12:43:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2018-10-04 12:43:08,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 3931 transitions. [2018-10-04 12:43:08,104 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 3931 transitions. Word has length 8 [2018-10-04 12:43:08,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:08,105 INFO L480 AbstractCegarLoop]: Abstraction has 1119 states and 3931 transitions. [2018-10-04 12:43:08,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:43:08,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 3931 transitions. [2018-10-04 12:43:08,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:43:08,106 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:08,106 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:08,106 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:08,106 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:08,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746875, now seen corresponding path program 1 times [2018-10-04 12:43:08,106 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:08,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:08,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:08,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:08,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:08,223 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-04 12:43:08,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:43:08,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:43:08,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:43:08,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:43:08,224 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:08,225 INFO L87 Difference]: Start difference. First operand 1119 states and 3931 transitions. Second operand 7 states. [2018-10-04 12:43:11,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:11,726 INFO L93 Difference]: Finished difference Result 1968 states and 5829 transitions. [2018-10-04 12:43:11,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:43:11,728 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:43:11,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:11,737 INFO L225 Difference]: With dead ends: 1968 [2018-10-04 12:43:11,737 INFO L226 Difference]: Without dead ends: 1962 [2018-10-04 12:43:11,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 14 [2018-10-04 12:43:11,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2018-10-04 12:43:12,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1111. [2018-10-04 12:43:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2018-10-04 12:43:12,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 3891 transitions. [2018-10-04 12:43:12,494 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 3891 transitions. Word has length 8 [2018-10-04 12:43:12,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:12,494 INFO L480 AbstractCegarLoop]: Abstraction has 1111 states and 3891 transitions. [2018-10-04 12:43:12,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:43:12,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 3891 transitions. [2018-10-04 12:43:12,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:43:12,495 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:12,495 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:12,496 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:12,496 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:12,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1616407055, now seen corresponding path program 1 times [2018-10-04 12:43:12,496 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:12,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:12,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:12,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:12,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:12,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:43:12,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:43:12,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:43:12,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:43:12,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:43:12,572 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:12,572 INFO L87 Difference]: Start difference. First operand 1111 states and 3891 transitions. Second operand 7 states. [2018-10-04 12:43:15,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:15,651 INFO L93 Difference]: Finished difference Result 2001 states and 6001 transitions. [2018-10-04 12:43:15,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:43:15,652 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:43:15,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:15,659 INFO L225 Difference]: With dead ends: 2001 [2018-10-04 12:43:15,659 INFO L226 Difference]: Without dead ends: 1995 [2018-10-04 12:43:15,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 13 [2018-10-04 12:43:15,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2018-10-04 12:43:16,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1117. [2018-10-04 12:43:16,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2018-10-04 12:43:16,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 3909 transitions. [2018-10-04 12:43:16,318 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 3909 transitions. Word has length 8 [2018-10-04 12:43:16,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:16,318 INFO L480 AbstractCegarLoop]: Abstraction has 1117 states and 3909 transitions. [2018-10-04 12:43:16,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:43:16,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 3909 transitions. [2018-10-04 12:43:16,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:43:16,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:16,319 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:16,320 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:16,320 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:16,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1616406928, now seen corresponding path program 1 times [2018-10-04 12:43:16,320 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:16,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:16,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:16,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:16,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:16,390 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-04 12:43:16,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:43:16,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:43:16,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:43:16,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:43:16,392 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:16,392 INFO L87 Difference]: Start difference. First operand 1117 states and 3909 transitions. Second operand 7 states. [2018-10-04 12:43:18,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:18,999 INFO L93 Difference]: Finished difference Result 1708 states and 5233 transitions. [2018-10-04 12:43:19,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:43:19,000 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:43:19,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:19,005 INFO L225 Difference]: With dead ends: 1708 [2018-10-04 12:43:19,006 INFO L226 Difference]: Without dead ends: 1702 [2018-10-04 12:43:19,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 10 [2018-10-04 12:43:19,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2018-10-04 12:43:19,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1210. [2018-10-04 12:43:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2018-10-04 12:43:19,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 4307 transitions. [2018-10-04 12:43:19,723 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 4307 transitions. Word has length 8 [2018-10-04 12:43:19,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:19,723 INFO L480 AbstractCegarLoop]: Abstraction has 1210 states and 4307 transitions. [2018-10-04 12:43:19,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:43:19,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 4307 transitions. [2018-10-04 12:43:19,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:43:19,725 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:19,725 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:19,725 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:19,725 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:19,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256941, now seen corresponding path program 1 times [2018-10-04 12:43:19,726 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:19,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:19,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:19,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:19,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:19,974 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-04 12:43:19,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:43:19,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:43:19,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:43:19,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:43:19,975 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:19,975 INFO L87 Difference]: Start difference. First operand 1210 states and 4307 transitions. Second operand 7 states. [2018-10-04 12:43:23,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:23,973 INFO L93 Difference]: Finished difference Result 2402 states and 7321 transitions. [2018-10-04 12:43:23,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:43:23,974 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:43:23,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:23,979 INFO L225 Difference]: With dead ends: 2402 [2018-10-04 12:43:23,979 INFO L226 Difference]: Without dead ends: 2396 [2018-10-04 12:43:23,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 14 [2018-10-04 12:43:23,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2018-10-04 12:43:24,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1341. [2018-10-04 12:43:24,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-10-04 12:43:24,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 4862 transitions. [2018-10-04 12:43:24,780 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 4862 transitions. Word has length 8 [2018-10-04 12:43:24,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:24,780 INFO L480 AbstractCegarLoop]: Abstraction has 1341 states and 4862 transitions. [2018-10-04 12:43:24,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:43:24,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 4862 transitions. [2018-10-04 12:43:24,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:43:24,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:24,782 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:24,782 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:24,782 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:24,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256944, now seen corresponding path program 1 times [2018-10-04 12:43:24,782 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:24,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:24,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:24,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:24,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:24,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-04 12:43:24,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:43:24,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:43:24,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:43:24,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:43:24,881 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:24,881 INFO L87 Difference]: Start difference. First operand 1341 states and 4862 transitions. Second operand 7 states. [2018-10-04 12:43:28,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:28,520 INFO L93 Difference]: Finished difference Result 2274 states and 6934 transitions. [2018-10-04 12:43:28,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:43:28,520 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:43:28,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:28,525 INFO L225 Difference]: With dead ends: 2274 [2018-10-04 12:43:28,525 INFO L226 Difference]: Without dead ends: 2268 [2018-10-04 12:43:28,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 15 [2018-10-04 12:43:28,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2018-10-04 12:43:29,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 1337. [2018-10-04 12:43:29,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-10-04 12:43:29,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 4840 transitions. [2018-10-04 12:43:29,298 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 4840 transitions. Word has length 8 [2018-10-04 12:43:29,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:29,298 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 4840 transitions. [2018-10-04 12:43:29,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:43:29,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 4840 transitions. [2018-10-04 12:43:29,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:43:29,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:29,299 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-10-04 12:43:29,300 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:29,300 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:29,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1621267991, now seen corresponding path program 1 times [2018-10-04 12:43:29,300 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:29,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:29,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:29,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:29,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:29,329 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-04 12:43:29,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:43:29,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:43:29,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:43:29,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:43:29,330 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:29,330 INFO L87 Difference]: Start difference. First operand 1337 states and 4840 transitions. Second operand 4 states. [2018-10-04 12:43:30,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:30,298 INFO L93 Difference]: Finished difference Result 2170 states and 7637 transitions. [2018-10-04 12:43:30,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:43:30,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-10-04 12:43:30,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:30,302 INFO L225 Difference]: With dead ends: 2170 [2018-10-04 12:43:30,302 INFO L226 Difference]: Without dead ends: 1253 [2018-10-04 12:43:30,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 2 [2018-10-04 12:43:30,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2018-10-04 12:43:30,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1080. [2018-10-04 12:43:30,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2018-10-04 12:43:30,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 3769 transitions. [2018-10-04 12:43:30,953 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 3769 transitions. Word has length 8 [2018-10-04 12:43:30,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:30,954 INFO L480 AbstractCegarLoop]: Abstraction has 1080 states and 3769 transitions. [2018-10-04 12:43:30,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:43:30,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 3769 transitions. [2018-10-04 12:43:30,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:43:30,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:30,955 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:30,955 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:30,955 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:30,956 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283460, now seen corresponding path program 1 times [2018-10-04 12:43:30,956 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:30,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:30,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:30,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:30,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:30,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:31,046 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-04 12:43:31,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:43:31,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:43:31,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:43:31,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:43:31,048 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:31,048 INFO L87 Difference]: Start difference. First operand 1080 states and 3769 transitions. Second operand 8 states. [2018-10-04 12:43:35,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:35,453 INFO L93 Difference]: Finished difference Result 2095 states and 6316 transitions. [2018-10-04 12:43:35,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:43:35,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:43:35,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:35,458 INFO L225 Difference]: With dead ends: 2095 [2018-10-04 12:43:35,458 INFO L226 Difference]: Without dead ends: 2093 [2018-10-04 12:43:35,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 16 [2018-10-04 12:43:35,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2018-10-04 12:43:36,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1161. [2018-10-04 12:43:36,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2018-10-04 12:43:36,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 4123 transitions. [2018-10-04 12:43:36,205 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 4123 transitions. Word has length 8 [2018-10-04 12:43:36,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:36,205 INFO L480 AbstractCegarLoop]: Abstraction has 1161 states and 4123 transitions. [2018-10-04 12:43:36,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:43:36,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 4123 transitions. [2018-10-04 12:43:36,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:43:36,206 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:36,206 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:36,206 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:36,206 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:36,207 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283333, now seen corresponding path program 1 times [2018-10-04 12:43:36,207 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:36,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:36,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:36,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:36,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:36,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:43:36,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:43:36,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:43:36,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:43:36,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:43:36,948 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:36,948 INFO L87 Difference]: Start difference. First operand 1161 states and 4123 transitions. Second operand 8 states. [2018-10-04 12:43:41,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:41,101 INFO L93 Difference]: Finished difference Result 1994 states and 5988 transitions. [2018-10-04 12:43:41,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:43:41,102 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:43:41,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:41,106 INFO L225 Difference]: With dead ends: 1994 [2018-10-04 12:43:41,106 INFO L226 Difference]: Without dead ends: 1988 [2018-10-04 12:43:41,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 15 [2018-10-04 12:43:41,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2018-10-04 12:43:41,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1152. [2018-10-04 12:43:41,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2018-10-04 12:43:41,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 4099 transitions. [2018-10-04 12:43:41,885 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 4099 transitions. Word has length 8 [2018-10-04 12:43:41,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:41,885 INFO L480 AbstractCegarLoop]: Abstraction has 1152 states and 4099 transitions. [2018-10-04 12:43:41,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:43:41,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 4099 transitions. [2018-10-04 12:43:41,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:43:41,887 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:41,887 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:41,887 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:41,887 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:41,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1867882049, now seen corresponding path program 1 times [2018-10-04 12:43:41,887 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:41,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:41,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:41,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:41,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:41,970 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-04 12:43:41,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:43:41,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:43:41,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:43:41,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:43:41,971 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:41,971 INFO L87 Difference]: Start difference. First operand 1152 states and 4099 transitions. Second operand 8 states. [2018-10-04 12:43:46,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:46,766 INFO L93 Difference]: Finished difference Result 2160 states and 6516 transitions. [2018-10-04 12:43:46,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:43:46,767 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:43:46,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:46,771 INFO L225 Difference]: With dead ends: 2160 [2018-10-04 12:43:46,772 INFO L226 Difference]: Without dead ends: 2154 [2018-10-04 12:43:46,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 15 [2018-10-04 12:43:46,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2018-10-04 12:43:47,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1174. [2018-10-04 12:43:47,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2018-10-04 12:43:47,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 4164 transitions. [2018-10-04 12:43:47,555 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 4164 transitions. Word has length 8 [2018-10-04 12:43:47,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:47,556 INFO L480 AbstractCegarLoop]: Abstraction has 1174 states and 4164 transitions. [2018-10-04 12:43:47,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:43:47,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 4164 transitions. [2018-10-04 12:43:47,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:43:47,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:47,557 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:47,558 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:47,558 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:47,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1867881922, now seen corresponding path program 1 times [2018-10-04 12:43:47,558 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:47,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:47,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:47,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:47,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:47,669 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-04 12:43:47,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:43:47,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:43:47,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:43:47,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:43:47,671 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:47,671 INFO L87 Difference]: Start difference. First operand 1174 states and 4164 transitions. Second operand 8 states. [2018-10-04 12:43:52,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:52,495 INFO L93 Difference]: Finished difference Result 2094 states and 6271 transitions. [2018-10-04 12:43:52,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:43:52,495 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:43:52,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:52,499 INFO L225 Difference]: With dead ends: 2094 [2018-10-04 12:43:52,499 INFO L226 Difference]: Without dead ends: 2088 [2018-10-04 12:43:52,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 14 [2018-10-04 12:43:52,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2018-10-04 12:43:53,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 1153. [2018-10-04 12:43:53,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2018-10-04 12:43:53,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 4095 transitions. [2018-10-04 12:43:53,338 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 4095 transitions. Word has length 8 [2018-10-04 12:43:53,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:53,338 INFO L480 AbstractCegarLoop]: Abstraction has 1153 states and 4095 transitions. [2018-10-04 12:43:53,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:43:53,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 4095 transitions. [2018-10-04 12:43:53,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:43:53,339 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:53,339 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-10-04 12:43:53,339 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:53,339 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:53,339 INFO L82 PathProgramCache]: Analyzing trace with hash -896988374, now seen corresponding path program 1 times [2018-10-04 12:43:53,340 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:53,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:53,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:53,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:53,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:53,368 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-04 12:43:53,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:43:53,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:43:53,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:43:53,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:43:53,369 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:53,370 INFO L87 Difference]: Start difference. First operand 1153 states and 4095 transitions. Second operand 4 states. [2018-10-04 12:43:54,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:54,650 INFO L93 Difference]: Finished difference Result 1929 states and 6604 transitions. [2018-10-04 12:43:54,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:43:54,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-10-04 12:43:54,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:54,654 INFO L225 Difference]: With dead ends: 1929 [2018-10-04 12:43:54,654 INFO L226 Difference]: Without dead ends: 1400 [2018-10-04 12:43:54,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 2 [2018-10-04 12:43:54,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2018-10-04 12:43:55,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1083. [2018-10-04 12:43:55,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2018-10-04 12:43:55,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 3765 transitions. [2018-10-04 12:43:55,718 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 3765 transitions. Word has length 8 [2018-10-04 12:43:55,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:55,718 INFO L480 AbstractCegarLoop]: Abstraction has 1083 states and 3765 transitions. [2018-10-04 12:43:55,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:43:55,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 3765 transitions. [2018-10-04 12:43:55,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:43:55,719 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:55,719 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:55,719 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:55,719 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:55,719 INFO L82 PathProgramCache]: Analyzing trace with hash -896379114, now seen corresponding path program 1 times [2018-10-04 12:43:55,719 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:55,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:55,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:55,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:55,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:55,796 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-04 12:43:55,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:43:55,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:43:55,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:43:55,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:43:55,798 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:55,798 INFO L87 Difference]: Start difference. First operand 1083 states and 3765 transitions. Second operand 8 states. [2018-10-04 12:44:00,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:44:00,213 INFO L93 Difference]: Finished difference Result 2276 states and 6948 transitions. [2018-10-04 12:44:00,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:44:00,213 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:44:00,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:44:00,217 INFO L225 Difference]: With dead ends: 2276 [2018-10-04 12:44:00,217 INFO L226 Difference]: Without dead ends: 2270 [2018-10-04 12:44:00,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 14 [2018-10-04 12:44:00,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2018-10-04 12:44:01,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 1266. [2018-10-04 12:44:01,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2018-10-04 12:44:01,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 4418 transitions. [2018-10-04 12:44:01,224 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 4418 transitions. Word has length 8 [2018-10-04 12:44:01,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:44:01,224 INFO L480 AbstractCegarLoop]: Abstraction has 1266 states and 4418 transitions. [2018-10-04 12:44:01,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:44:01,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 4418 transitions. [2018-10-04 12:44:01,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:44:01,228 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:44:01,228 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:44:01,228 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:44:01,228 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:44:01,229 INFO L82 PathProgramCache]: Analyzing trace with hash -896379111, now seen corresponding path program 1 times [2018-10-04 12:44:01,229 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:44:01,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:44:01,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:01,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:01,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:01,330 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-04 12:44:01,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:44:01,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:44:01,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:44:01,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:44:01,332 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:44:01,332 INFO L87 Difference]: Start difference. First operand 1266 states and 4418 transitions. Second operand 8 states. [2018-10-04 12:44:06,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:44:06,329 INFO L93 Difference]: Finished difference Result 2425 states and 7363 transitions. [2018-10-04 12:44:06,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:44:06,329 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:44:06,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:44:06,335 INFO L225 Difference]: With dead ends: 2425 [2018-10-04 12:44:06,335 INFO L226 Difference]: Without dead ends: 2419 [2018-10-04 12:44:06,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 18 [2018-10-04 12:44:06,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2018-10-04 12:44:07,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 1373. [2018-10-04 12:44:07,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2018-10-04 12:44:07,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 4822 transitions. [2018-10-04 12:44:07,591 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 4822 transitions. Word has length 8 [2018-10-04 12:44:07,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:44:07,592 INFO L480 AbstractCegarLoop]: Abstraction has 1373 states and 4822 transitions. [2018-10-04 12:44:07,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:44:07,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 4822 transitions. [2018-10-04 12:44:07,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:44:07,593 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:44:07,593 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:44:07,593 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:44:07,593 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:44:07,594 INFO L82 PathProgramCache]: Analyzing trace with hash -881085998, now seen corresponding path program 1 times [2018-10-04 12:44:07,594 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:44:07,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:44:07,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:07,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:07,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:07,671 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-04 12:44:07,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:44:07,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:44:07,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:44:07,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:44:07,672 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:44:07,672 INFO L87 Difference]: Start difference. First operand 1373 states and 4822 transitions. Second operand 8 states. [2018-10-04 12:44:12,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:44:12,846 INFO L93 Difference]: Finished difference Result 2278 states and 6952 transitions. [2018-10-04 12:44:12,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:44:12,847 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:44:12,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:44:12,852 INFO L225 Difference]: With dead ends: 2278 [2018-10-04 12:44:12,852 INFO L226 Difference]: Without dead ends: 2272 [2018-10-04 12:44:12,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 14 [2018-10-04 12:44:12,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2018-10-04 12:44:14,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1421. [2018-10-04 12:44:14,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2018-10-04 12:44:14,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 4963 transitions. [2018-10-04 12:44:14,063 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 4963 transitions. Word has length 8 [2018-10-04 12:44:14,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:44:14,063 INFO L480 AbstractCegarLoop]: Abstraction has 1421 states and 4963 transitions. [2018-10-04 12:44:14,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:44:14,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 4963 transitions. [2018-10-04 12:44:14,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:44:14,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:44:14,064 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:44:14,064 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:44:14,065 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:44:14,065 INFO L82 PathProgramCache]: Analyzing trace with hash -881086125, now seen corresponding path program 1 times [2018-10-04 12:44:14,065 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:44:14,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:44:14,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:14,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:14,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:14,325 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-04 12:44:14,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:44:14,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:44:14,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:44:14,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:44:14,327 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:44:14,329 INFO L87 Difference]: Start difference. First operand 1421 states and 4963 transitions. Second operand 8 states. [2018-10-04 12:44:19,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:44:19,394 INFO L93 Difference]: Finished difference Result 2233 states and 6848 transitions. [2018-10-04 12:44:19,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:44:19,394 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:44:19,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:44:19,399 INFO L225 Difference]: With dead ends: 2233 [2018-10-04 12:44:19,399 INFO L226 Difference]: Without dead ends: 2227 [2018-10-04 12:44:19,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 13 [2018-10-04 12:44:19,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2018-10-04 12:44:20,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 1411. [2018-10-04 12:44:20,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2018-10-04 12:44:20,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 4926 transitions. [2018-10-04 12:44:20,739 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 4926 transitions. Word has length 8 [2018-10-04 12:44:20,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:44:20,739 INFO L480 AbstractCegarLoop]: Abstraction has 1411 states and 4926 transitions. [2018-10-04 12:44:20,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:44:20,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 4926 transitions. [2018-10-04 12:44:20,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:44:20,740 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:44:20,740 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:44:20,740 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:44:20,740 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:44:20,740 INFO L82 PathProgramCache]: Analyzing trace with hash 2077099334, now seen corresponding path program 1 times [2018-10-04 12:44:20,740 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:44:20,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:44:20,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:20,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:20,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:20,820 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-04 12:44:20,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:44:20,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:44:20,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:44:20,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:44:20,821 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:44:20,822 INFO L87 Difference]: Start difference. First operand 1411 states and 4926 transitions. Second operand 8 states. [2018-10-04 12:44:26,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:44:26,422 INFO L93 Difference]: Finished difference Result 2558 states and 7836 transitions. [2018-10-04 12:44:26,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:44:26,423 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:44:26,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:44:26,428 INFO L225 Difference]: With dead ends: 2558 [2018-10-04 12:44:26,428 INFO L226 Difference]: Without dead ends: 2552 [2018-10-04 12:44:26,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 16 [2018-10-04 12:44:26,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2018-10-04 12:44:27,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 1471. [2018-10-04 12:44:27,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2018-10-04 12:44:27,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 5183 transitions. [2018-10-04 12:44:27,875 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 5183 transitions. Word has length 8 [2018-10-04 12:44:27,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:44:27,875 INFO L480 AbstractCegarLoop]: Abstraction has 1471 states and 5183 transitions. [2018-10-04 12:44:27,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:44:27,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 5183 transitions. [2018-10-04 12:44:27,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:44:27,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:44:27,877 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:44:27,877 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:44:27,877 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:44:27,877 INFO L82 PathProgramCache]: Analyzing trace with hash 2077099337, now seen corresponding path program 1 times [2018-10-04 12:44:27,877 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:44:27,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:44:27,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:27,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:27,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:27,978 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-04 12:44:27,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:44:27,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:44:27,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:44:27,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:44:27,979 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:44:27,979 INFO L87 Difference]: Start difference. First operand 1471 states and 5183 transitions. Second operand 8 states. [2018-10-04 12:44:33,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:44:33,861 INFO L93 Difference]: Finished difference Result 2703 states and 8278 transitions. [2018-10-04 12:44:33,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:44:33,862 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:44:33,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:44:33,866 INFO L225 Difference]: With dead ends: 2703 [2018-10-04 12:44:33,867 INFO L226 Difference]: Without dead ends: 2697 [2018-10-04 12:44:33,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 14 [2018-10-04 12:44:33,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2018-10-04 12:44:35,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1480. [2018-10-04 12:44:35,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-10-04 12:44:35,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 5200 transitions. [2018-10-04 12:44:35,227 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 5200 transitions. Word has length 8 [2018-10-04 12:44:35,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:44:35,227 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 5200 transitions. [2018-10-04 12:44:35,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:44:35,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 5200 transitions. [2018-10-04 12:44:35,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:44:35,228 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:44:35,228 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:44:35,229 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:44:35,229 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:44:35,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1638629971, now seen corresponding path program 1 times [2018-10-04 12:44:35,229 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:44:35,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:44:35,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:35,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:35,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:35,306 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-04 12:44:35,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:44:35,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:44:35,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:44:35,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:44:35,307 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:44:35,307 INFO L87 Difference]: Start difference. First operand 1480 states and 5200 transitions. Second operand 8 states. [2018-10-04 12:44:41,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:44:41,673 INFO L93 Difference]: Finished difference Result 2674 states and 8171 transitions. [2018-10-04 12:44:41,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:44:41,674 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:44:41,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:44:41,679 INFO L225 Difference]: With dead ends: 2674 [2018-10-04 12:44:41,679 INFO L226 Difference]: Without dead ends: 2668 [2018-10-04 12:44:41,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 16 [2018-10-04 12:44:41,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2018-10-04 12:44:43,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 1480. [2018-10-04 12:44:43,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-10-04 12:44:43,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 5196 transitions. [2018-10-04 12:44:43,078 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 5196 transitions. Word has length 8 [2018-10-04 12:44:43,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:44:43,078 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 5196 transitions. [2018-10-04 12:44:43,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:44:43,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 5196 transitions. [2018-10-04 12:44:43,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:44:43,079 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:44:43,079 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:44:43,079 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:44:43,079 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:44:43,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1638629974, now seen corresponding path program 1 times [2018-10-04 12:44:43,080 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:44:43,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:44:43,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:43,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:43,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:43,563 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-04 12:44:43,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:44:43,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:44:43,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:44:43,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:44:43,565 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:44:43,565 INFO L87 Difference]: Start difference. First operand 1480 states and 5196 transitions. Second operand 8 states. [2018-10-04 12:44:50,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:44:50,188 INFO L93 Difference]: Finished difference Result 2722 states and 8299 transitions. [2018-10-04 12:44:50,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 12:44:50,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:44:50,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:44:50,201 INFO L225 Difference]: With dead ends: 2722 [2018-10-04 12:44:50,202 INFO L226 Difference]: Without dead ends: 2716 [2018-10-04 12:44:50,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 14 [2018-10-04 12:44:50,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2018-10-04 12:44:51,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 1462. [2018-10-04 12:44:51,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1462 states. [2018-10-04 12:44:51,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 5124 transitions. [2018-10-04 12:44:51,698 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 5124 transitions. Word has length 8 [2018-10-04 12:44:51,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:44:51,698 INFO L480 AbstractCegarLoop]: Abstraction has 1462 states and 5124 transitions. [2018-10-04 12:44:51,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:44:51,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 5124 transitions. [2018-10-04 12:44:51,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:44:51,699 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:44:51,699 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:44:51,699 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:44:51,699 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:44:51,699 INFO L82 PathProgramCache]: Analyzing trace with hash 278041308, now seen corresponding path program 1 times [2018-10-04 12:44:51,699 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:44:51,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:44:51,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:51,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:51,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:51,771 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-04 12:44:51,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:44:51,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:44:51,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:44:51,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:44:51,772 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:44:51,773 INFO L87 Difference]: Start difference. First operand 1462 states and 5124 transitions. Second operand 8 states. [2018-10-04 12:44:57,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:44:57,598 INFO L93 Difference]: Finished difference Result 2962 states and 9218 transitions. [2018-10-04 12:44:57,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:44:57,599 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-04 12:44:57,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:44:57,604 INFO L225 Difference]: With dead ends: 2962 [2018-10-04 12:44:57,605 INFO L226 Difference]: Without dead ends: 2956 [2018-10-04 12:44:57,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 12 [2018-10-04 12:44:57,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2018-10-04 12:44:59,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1776. [2018-10-04 12:44:59,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1776 states. [2018-10-04 12:44:59,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 6236 transitions. [2018-10-04 12:44:59,465 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 6236 transitions. Word has length 9 [2018-10-04 12:44:59,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:44:59,465 INFO L480 AbstractCegarLoop]: Abstraction has 1776 states and 6236 transitions. [2018-10-04 12:44:59,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:44:59,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 6236 transitions. [2018-10-04 12:44:59,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:44:59,466 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:44:59,466 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:44:59,466 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:44:59,466 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:44:59,467 INFO L82 PathProgramCache]: Analyzing trace with hash 278041683, now seen corresponding path program 1 times [2018-10-04 12:44:59,467 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:44:59,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:44:59,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:59,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:59,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:59,531 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-04 12:44:59,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:44:59,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:44:59,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:44:59,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:44:59,532 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:44:59,533 INFO L87 Difference]: Start difference. First operand 1776 states and 6236 transitions. Second operand 8 states. [2018-10-04 12:45:05,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:45:05,618 INFO L93 Difference]: Finished difference Result 2948 states and 9162 transitions. [2018-10-04 12:45:05,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:45:05,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-04 12:45:05,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:45:05,624 INFO L225 Difference]: With dead ends: 2948 [2018-10-04 12:45:05,624 INFO L226 Difference]: Without dead ends: 2942 [2018-10-04 12:45:05,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 12 [2018-10-04 12:45:05,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2018-10-04 12:45:07,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1772. [2018-10-04 12:45:07,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2018-10-04 12:45:07,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 6220 transitions. [2018-10-04 12:45:07,447 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 6220 transitions. Word has length 9 [2018-10-04 12:45:07,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:45:07,448 INFO L480 AbstractCegarLoop]: Abstraction has 1772 states and 6220 transitions. [2018-10-04 12:45:07,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:45:07,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 6220 transitions. [2018-10-04 12:45:07,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:45:07,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:45:07,449 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:45:07,449 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:45:07,449 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:45:07,449 INFO L82 PathProgramCache]: Analyzing trace with hash 541105076, now seen corresponding path program 1 times [2018-10-04 12:45:07,449 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:45:07,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:45:07,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:45:07,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:45:07,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:45:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:45:07,614 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-04 12:45:07,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:45:07,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:45:07,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:45:07,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:45:07,616 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:45:07,616 INFO L87 Difference]: Start difference. First operand 1772 states and 6220 transitions. Second operand 8 states. [2018-10-04 12:45:14,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:45:14,669 INFO L93 Difference]: Finished difference Result 3238 states and 9970 transitions. [2018-10-04 12:45:14,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:45:14,669 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-04 12:45:14,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:45:14,676 INFO L225 Difference]: With dead ends: 3238 [2018-10-04 12:45:14,676 INFO L226 Difference]: Without dead ends: 3232 [2018-10-04 12:45:14,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 13 [2018-10-04 12:45:14,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2018-10-04 12:45:16,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 1799. [2018-10-04 12:45:16,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2018-10-04 12:45:16,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 6288 transitions. [2018-10-04 12:45:16,616 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 6288 transitions. Word has length 9 [2018-10-04 12:45:16,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:45:16,617 INFO L480 AbstractCegarLoop]: Abstraction has 1799 states and 6288 transitions. [2018-10-04 12:45:16,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:45:16,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 6288 transitions. [2018-10-04 12:45:16,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:45:16,618 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:45:16,618 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:45:16,618 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:45:16,618 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:45:16,618 INFO L82 PathProgramCache]: Analyzing trace with hash 541105451, now seen corresponding path program 1 times [2018-10-04 12:45:16,619 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:45:16,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:45:16,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:45:16,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:45:16,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:45:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:45:16,681 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-04 12:45:16,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:45:16,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:45:16,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:45:16,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:45:16,682 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:45:16,683 INFO L87 Difference]: Start difference. First operand 1799 states and 6288 transitions. Second operand 8 states. [2018-10-04 12:45:24,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:45:24,047 INFO L93 Difference]: Finished difference Result 3212 states and 9854 transitions. [2018-10-04 12:45:24,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:45:24,047 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-04 12:45:24,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:45:24,054 INFO L225 Difference]: With dead ends: 3212 [2018-10-04 12:45:24,054 INFO L226 Difference]: Without dead ends: 3206 [2018-10-04 12:45:24,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 13 [2018-10-04 12:45:24,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2018-10-04 12:45:25,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 1737. [2018-10-04 12:45:25,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1737 states. [2018-10-04 12:45:25,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 6062 transitions. [2018-10-04 12:45:25,999 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 6062 transitions. Word has length 9 [2018-10-04 12:45:25,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:45:25,999 INFO L480 AbstractCegarLoop]: Abstraction has 1737 states and 6062 transitions. [2018-10-04 12:45:25,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:45:25,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 6062 transitions. [2018-10-04 12:45:26,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:45:26,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:45:26,000 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:45:26,001 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:45:26,001 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:45:26,001 INFO L82 PathProgramCache]: Analyzing trace with hash 825189368, now seen corresponding path program 1 times [2018-10-04 12:45:26,001 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:45:26,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:45:26,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:45:26,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:45:26,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:45:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:45:26,098 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-04 12:45:26,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:45:26,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:45:26,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:45:26,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:45:26,099 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:45:26,099 INFO L87 Difference]: Start difference. First operand 1737 states and 6062 transitions. Second operand 8 states. [2018-10-04 12:45:32,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:45:32,873 INFO L93 Difference]: Finished difference Result 3315 states and 10043 transitions. [2018-10-04 12:45:32,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:45:32,874 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-04 12:45:32,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:45:32,880 INFO L225 Difference]: With dead ends: 3315 [2018-10-04 12:45:32,880 INFO L226 Difference]: Without dead ends: 3309 [2018-10-04 12:45:32,881 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 12 [2018-10-04 12:45:32,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2018-10-04 12:45:35,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 1985. [2018-10-04 12:45:35,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1985 states. [2018-10-04 12:45:35,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 6886 transitions. [2018-10-04 12:45:35,252 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 6886 transitions. Word has length 9 [2018-10-04 12:45:35,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:45:35,252 INFO L480 AbstractCegarLoop]: Abstraction has 1985 states and 6886 transitions. [2018-10-04 12:45:35,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:45:35,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 6886 transitions. [2018-10-04 12:45:35,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:45:35,254 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:45:35,254 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:45:35,254 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:45:35,255 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:45:35,255 INFO L82 PathProgramCache]: Analyzing trace with hash 825189371, now seen corresponding path program 1 times [2018-10-04 12:45:35,255 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:45:35,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:45:35,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:45:35,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:45:35,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:45:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:45:35,326 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-04 12:45:35,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:45:35,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:45:35,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:45:35,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:45:35,327 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:45:35,328 INFO L87 Difference]: Start difference. First operand 1985 states and 6886 transitions. Second operand 8 states. [2018-10-04 12:45:43,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:45:43,087 INFO L93 Difference]: Finished difference Result 3446 states and 10415 transitions. [2018-10-04 12:45:43,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:45:43,088 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-04 12:45:43,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:45:43,096 INFO L225 Difference]: With dead ends: 3446 [2018-10-04 12:45:43,096 INFO L226 Difference]: Without dead ends: 3440 [2018-10-04 12:45:43,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 15 [2018-10-04 12:45:43,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3440 states. [2018-10-04 12:45:45,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3440 to 1927. [2018-10-04 12:45:45,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1927 states. [2018-10-04 12:45:45,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 6663 transitions. [2018-10-04 12:45:45,423 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 6663 transitions. Word has length 9 [2018-10-04 12:45:45,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:45:45,424 INFO L480 AbstractCegarLoop]: Abstraction has 1927 states and 6663 transitions. [2018-10-04 12:45:45,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:45:45,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 6663 transitions. [2018-10-04 12:45:45,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:45:45,425 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:45:45,425 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:45:45,425 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:45:45,425 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:45:45,426 INFO L82 PathProgramCache]: Analyzing trace with hash 832700792, now seen corresponding path program 1 times [2018-10-04 12:45:45,426 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:45:45,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:45:45,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:45:45,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:45:45,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:45:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:45:45,522 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-04 12:45:45,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:45:45,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:45:45,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:45:45,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:45:45,523 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:45:45,523 INFO L87 Difference]: Start difference. First operand 1927 states and 6663 transitions. Second operand 8 states. [2018-10-04 12:45:52,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:45:52,118 INFO L93 Difference]: Finished difference Result 2832 states and 8631 transitions. [2018-10-04 12:45:52,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:45:52,118 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-04 12:45:52,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:45:52,124 INFO L225 Difference]: With dead ends: 2832 [2018-10-04 12:45:52,124 INFO L226 Difference]: Without dead ends: 2824 [2018-10-04 12:45:52,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 12 [2018-10-04 12:45:52,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2824 states. [2018-10-04 12:45:54,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2824 to 1904. [2018-10-04 12:45:54,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1904 states. [2018-10-04 12:45:54,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 6553 transitions. [2018-10-04 12:45:54,490 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 6553 transitions. Word has length 9 [2018-10-04 12:45:54,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:45:54,490 INFO L480 AbstractCegarLoop]: Abstraction has 1904 states and 6553 transitions. [2018-10-04 12:45:54,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:45:54,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 6553 transitions. [2018-10-04 12:45:54,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:45:54,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:45:54,492 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:45:54,492 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:45:54,492 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:45:54,492 INFO L82 PathProgramCache]: Analyzing trace with hash -595843680, now seen corresponding path program 1 times [2018-10-04 12:45:54,492 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:45:54,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:45:54,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:45:54,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:45:54,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:45:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:45:54,973 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-04 12:45:54,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:45:54,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:45:54,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:45:54,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:45:54,974 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:45:54,974 INFO L87 Difference]: Start difference. First operand 1904 states and 6553 transitions. Second operand 9 states. [2018-10-04 12:46:01,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:46:01,943 INFO L93 Difference]: Finished difference Result 3157 states and 9716 transitions. [2018-10-04 12:46:01,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:46:01,944 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-04 12:46:01,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:46:01,949 INFO L225 Difference]: With dead ends: 3157 [2018-10-04 12:46:01,950 INFO L226 Difference]: Without dead ends: 3151 [2018-10-04 12:46:01,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 14 [2018-10-04 12:46:01,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2018-10-04 12:46:04,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 1949. [2018-10-04 12:46:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2018-10-04 12:46:04,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 6722 transitions. [2018-10-04 12:46:04,410 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 6722 transitions. Word has length 9 [2018-10-04 12:46:04,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:46:04,410 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 6722 transitions. [2018-10-04 12:46:04,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:46:04,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 6722 transitions. [2018-10-04 12:46:04,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:46:04,411 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:46:04,411 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:46:04,412 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:46:04,412 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:46:04,412 INFO L82 PathProgramCache]: Analyzing trace with hash -595843677, now seen corresponding path program 1 times [2018-10-04 12:46:04,412 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:46:04,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:46:04,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:04,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:46:04,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:46:04,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-04 12:46:04,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:46:04,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:46:04,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:46:04,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:46:04,503 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:46:04,503 INFO L87 Difference]: Start difference. First operand 1949 states and 6722 transitions. Second operand 9 states. [2018-10-04 12:46:05,509 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:46:14,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:46:14,167 INFO L93 Difference]: Finished difference Result 3822 states and 11523 transitions. [2018-10-04 12:46:14,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 12:46:14,167 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-04 12:46:14,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:46:14,174 INFO L225 Difference]: With dead ends: 3822 [2018-10-04 12:46:14,175 INFO L226 Difference]: Without dead ends: 3816 [2018-10-04 12:46:14,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 13 [2018-10-04 12:46:14,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3816 states. [2018-10-04 12:46:16,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 2098. [2018-10-04 12:46:16,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2018-10-04 12:46:16,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 7405 transitions. [2018-10-04 12:46:16,912 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 7405 transitions. Word has length 9 [2018-10-04 12:46:16,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:46:16,913 INFO L480 AbstractCegarLoop]: Abstraction has 2098 states and 7405 transitions. [2018-10-04 12:46:16,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:46:16,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 7405 transitions. [2018-10-04 12:46:16,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:46:16,914 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:46:16,914 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:46:16,914 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:46:16,915 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:46:16,915 INFO L82 PathProgramCache]: Analyzing trace with hash -204435682, now seen corresponding path program 1 times [2018-10-04 12:46:16,915 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:46:16,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:46:16,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:16,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:46:16,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:46:16,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:46:16,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:46:16,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:46:16,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:46:16,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:46:16,995 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:46:16,995 INFO L87 Difference]: Start difference. First operand 2098 states and 7405 transitions. Second operand 9 states. [2018-10-04 12:46:19,060 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:46:27,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:46:27,735 INFO L93 Difference]: Finished difference Result 4144 states and 12499 transitions. [2018-10-04 12:46:27,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 12:46:27,735 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-04 12:46:27,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:46:27,744 INFO L225 Difference]: With dead ends: 4144 [2018-10-04 12:46:27,744 INFO L226 Difference]: Without dead ends: 4138 [2018-10-04 12:46:27,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 10 [2018-10-04 12:46:27,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4138 states. Received shutdown request... [2018-10-04 12:46:30,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4138 to 2260. [2018-10-04 12:46:30,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2260 states. [2018-10-04 12:46:30,860 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 12:46:30,865 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 12:46:30,866 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:46:30 BoogieIcfgContainer [2018-10-04 12:46:30,866 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:46:30,867 INFO L168 Benchmark]: Toolchain (without parser) took 268189.71 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-10-04 12:46:30,871 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:46:30,871 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:46:30,872 INFO L168 Benchmark]: Boogie Preprocessor took 69.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:46:30,875 INFO L168 Benchmark]: RCFGBuilder took 1314.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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-04 12:46:30,876 INFO L168 Benchmark]: TraceAbstraction took 266734.66 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-10-04 12:46:30,882 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 69.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1314.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 266734.66 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 199]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 199). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 95). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 574]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 574). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 624]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 624). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 816]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 816). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 446]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 446). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 645). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 660). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 316]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 316). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 675). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 640). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 569). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 579). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 470]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 470). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 194]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 194). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 71). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 594]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 594). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 263]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 263). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 599]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 599). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 584]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 584). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 832]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 832). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 337]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 337). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 589). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 223]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 223). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 604]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 604). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 847]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 847). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 800]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 800). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 27 error locations. TIMEOUT Result, 266.6s OverallTime, 50 OverallIterations, 2 TraceHistogramMax, 213.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13957 SDtfs, 25016 SDslu, 26630 SDs, 0 SdLazy, 96106 SolverSat, 9058 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 102.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 765 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 761 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2098occurred in iteration=49, 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: 46.3s AutomataMinimizationTime, 50 MinimizatonAttempts, 38917 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 401 NumberOfCodeBlocks, 401 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 351 ConstructedInterpolants, 0 QuantifiedInterpolants, 34870 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 50 InterpolantComputations, 50 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-04_12-46-30-901.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-04_12-46-30-901.csv Completed graceful shutdown