java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 20:34:18,380 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:34:18,382 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:34:18,394 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:34:18,395 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:34:18,398 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:34:18,400 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:34:18,402 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:34:18,403 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:34:18,404 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:34:18,405 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:34:18,406 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:34:18,407 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:34:18,408 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:34:18,409 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:34:18,410 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:34:18,411 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:34:18,413 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:34:18,415 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:34:18,416 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:34:18,420 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:34:18,421 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:34:18,425 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:34:18,425 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:34:18,425 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:34:18,428 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:34:18,429 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:34:18,430 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:34:18,435 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:34:18,437 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:34:18,437 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:34:18,439 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:34:18,439 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:34:18,439 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:34:18,441 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:34:18,442 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:34:18,442 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-09-30 20:34:18,473 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:34:18,473 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:34:18,474 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:34:18,474 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:34:18,476 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:34:18,476 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:34:18,476 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:34:18,476 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:34:18,477 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:34:18,477 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:34:18,477 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:34:18,477 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:34:18,478 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:34:18,479 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:34:18,479 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:34:18,479 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:34:18,479 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:34:18,479 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:34:18,480 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:34:18,480 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:34:18,480 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:34:18,481 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:34:18,482 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:34:18,482 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:34:18,482 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:34:18,482 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:34:18,483 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:34:18,483 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:34:18,483 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:34:18,483 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:34:18,483 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 20:34:18,550 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:34:18,565 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:34:18,571 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:34:18,573 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:34:18,573 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:34:18,574 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl [2018-09-30 20:34:18,574 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl' [2018-09-30 20:34:18,685 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:34:18,689 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:34:18,690 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:34:18,690 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:34:18,690 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:34:18,712 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 30.09 08:34:18" (1/1) ... [2018-09-30 20:34:18,729 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 30.09 08:34:18" (1/1) ... [2018-09-30 20:34:18,735 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 20:34:18,736 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 20:34:18,736 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 20:34:18,739 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:34:18,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:34:18,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:34:18,740 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:34:18,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:18" (1/1) ... [2018-09-30 20:34:18,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:18" (1/1) ... [2018-09-30 20:34:18,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:18" (1/1) ... [2018-09-30 20:34:18,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:18" (1/1) ... [2018-09-30 20:34:18,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:18" (1/1) ... [2018-09-30 20:34:18,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:18" (1/1) ... [2018-09-30 20:34:18,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:18" (1/1) ... [2018-09-30 20:34:18,795 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:34:18,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:34:18,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:34:18,797 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:34:18,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:34:18,861 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-30 20:34:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-30 20:34:18,861 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-30 20:34:20,000 INFO L345 CfgBuilder]: Using library mode [2018-09-30 20:34:20,000 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:34:20 BoogieIcfgContainer [2018-09-30 20:34:20,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:34:20,001 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:34:20,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:34:20,005 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:34:20,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:18" (1/2) ... [2018-09-30 20:34:20,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c20785e and model type threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:34:20, skipping insertion in model container [2018-09-30 20:34:20,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:34:20" (2/2) ... [2018-09-30 20:34:20,008 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out3.mover.bpl [2018-09-30 20:34:20,017 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:34:20,025 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-09-30 20:34:20,078 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:34:20,079 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:34:20,079 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:34:20,079 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:34:20,080 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:34:20,080 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:34:20,080 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:34:20,080 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:34:20,080 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:34:20,101 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-09-30 20:34:20,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 20:34:20,108 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:20,109 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 20:34:20,111 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:20,118 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:20,119 INFO L82 PathProgramCache]: Analyzing trace with hash 45506320, now seen corresponding path program 1 times [2018-09-30 20:34:20,121 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:20,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:20,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:20,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:20,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:20,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:20,343 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:20,343 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:34:20,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:34:20,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:34:20,362 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:20,364 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 5 states. [2018-09-30 20:34:23,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:23,862 INFO L93 Difference]: Finished difference Result 142 states and 303 transitions. [2018-09-30 20:34:23,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:34:23,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-30 20:34:23,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:23,883 INFO L225 Difference]: With dead ends: 142 [2018-09-30 20:34:23,884 INFO L226 Difference]: Without dead ends: 138 [2018-09-30 20:34:23,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:34:23,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-09-30 20:34:23,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 98. [2018-09-30 20:34:23,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-30 20:34:23,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 219 transitions. [2018-09-30 20:34:23,945 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 219 transitions. Word has length 5 [2018-09-30 20:34:23,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:23,947 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 219 transitions. [2018-09-30 20:34:23,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:34:23,947 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 219 transitions. [2018-09-30 20:34:23,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 20:34:23,948 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:23,949 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 20:34:23,950 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:23,950 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:23,951 INFO L82 PathProgramCache]: Analyzing trace with hash 45756290, now seen corresponding path program 1 times [2018-09-30 20:34:23,951 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:23,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:23,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:23,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:23,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:24,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:24,087 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:24,087 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:34:24,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:34:24,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:34:24,090 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:24,090 INFO L87 Difference]: Start difference. First operand 98 states and 219 transitions. Second operand 5 states. [2018-09-30 20:34:28,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:28,298 INFO L93 Difference]: Finished difference Result 241 states and 539 transitions. [2018-09-30 20:34:28,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 20:34:28,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-30 20:34:28,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:28,304 INFO L225 Difference]: With dead ends: 241 [2018-09-30 20:34:28,304 INFO L226 Difference]: Without dead ends: 237 [2018-09-30 20:34:28,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:34:28,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-09-30 20:34:28,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 134. [2018-09-30 20:34:28,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-09-30 20:34:28,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 355 transitions. [2018-09-30 20:34:28,338 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 355 transitions. Word has length 5 [2018-09-30 20:34:28,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:28,339 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 355 transitions. [2018-09-30 20:34:28,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:34:28,339 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 355 transitions. [2018-09-30 20:34:28,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 20:34:28,340 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:28,340 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 20:34:28,341 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:28,341 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:28,341 INFO L82 PathProgramCache]: Analyzing trace with hash 28948051, now seen corresponding path program 1 times [2018-09-30 20:34:28,342 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:28,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:28,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:28,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:28,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:28,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:28,416 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:28,416 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:34:28,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:34:28,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:34:28,417 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:28,417 INFO L87 Difference]: Start difference. First operand 134 states and 355 transitions. Second operand 5 states. [2018-09-30 20:34:32,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:32,210 INFO L93 Difference]: Finished difference Result 269 states and 639 transitions. [2018-09-30 20:34:32,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 20:34:32,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-30 20:34:32,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:32,215 INFO L225 Difference]: With dead ends: 269 [2018-09-30 20:34:32,216 INFO L226 Difference]: Without dead ends: 265 [2018-09-30 20:34:32,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:34:32,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-09-30 20:34:32,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 162. [2018-09-30 20:34:32,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-09-30 20:34:32,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 455 transitions. [2018-09-30 20:34:32,253 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 455 transitions. Word has length 5 [2018-09-30 20:34:32,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:32,253 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 455 transitions. [2018-09-30 20:34:32,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:34:32,253 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 455 transitions. [2018-09-30 20:34:32,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:34:32,255 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:32,255 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:32,257 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:32,257 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:32,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558066, now seen corresponding path program 1 times [2018-09-30 20:34:32,257 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:32,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:32,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:32,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:32,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:32,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:32,382 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:32,383 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:34:32,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:34:32,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:34:32,384 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:32,385 INFO L87 Difference]: Start difference. First operand 162 states and 455 transitions. Second operand 8 states. [2018-09-30 20:34:41,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:41,826 INFO L93 Difference]: Finished difference Result 790 states and 2085 transitions. [2018-09-30 20:34:41,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 20:34:41,827 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:34:41,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:41,833 INFO L225 Difference]: With dead ends: 790 [2018-09-30 20:34:41,834 INFO L226 Difference]: Without dead ends: 629 [2018-09-30 20:34:41,835 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-09-30 20:34:41,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-09-30 20:34:41,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 278. [2018-09-30 20:34:41,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-09-30 20:34:41,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 854 transitions. [2018-09-30 20:34:41,896 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 854 transitions. Word has length 8 [2018-09-30 20:34:41,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:41,896 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 854 transitions. [2018-09-30 20:34:41,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:34:41,896 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 854 transitions. [2018-09-30 20:34:41,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:34:41,898 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:41,898 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:41,899 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:41,900 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:41,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558063, now seen corresponding path program 1 times [2018-09-30 20:34:41,900 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:41,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:41,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:41,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:41,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:42,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:42,060 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:42,060 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:34:42,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:34:42,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:34:42,061 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:42,061 INFO L87 Difference]: Start difference. First operand 278 states and 854 transitions. Second operand 8 states. [2018-09-30 20:34:52,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:52,600 INFO L93 Difference]: Finished difference Result 634 states and 1540 transitions. [2018-09-30 20:34:52,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:34:52,601 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:34:52,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:52,607 INFO L225 Difference]: With dead ends: 634 [2018-09-30 20:34:52,607 INFO L226 Difference]: Without dead ends: 628 [2018-09-30 20:34:52,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-09-30 20:34:52,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-09-30 20:34:52,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 310. [2018-09-30 20:34:52,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-09-30 20:34:52,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 963 transitions. [2018-09-30 20:34:52,665 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 963 transitions. Word has length 8 [2018-09-30 20:34:52,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:52,665 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 963 transitions. [2018-09-30 20:34:52,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:34:52,666 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 963 transitions. [2018-09-30 20:34:52,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:34:52,668 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:52,668 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:52,669 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:52,669 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:52,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1080099218, now seen corresponding path program 1 times [2018-09-30 20:34:52,669 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:52,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:52,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:52,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:52,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:52,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:52,760 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:52,760 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:34:52,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:34:52,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:34:52,761 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:52,761 INFO L87 Difference]: Start difference. First operand 310 states and 963 transitions. Second operand 8 states. [2018-09-30 20:35:01,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:01,600 INFO L93 Difference]: Finished difference Result 768 states and 2087 transitions. [2018-09-30 20:35:01,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 20:35:01,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:35:01,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:01,605 INFO L225 Difference]: With dead ends: 768 [2018-09-30 20:35:01,605 INFO L226 Difference]: Without dead ends: 537 [2018-09-30 20:35:01,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:35:01,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-09-30 20:35:01,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 334. [2018-09-30 20:35:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-09-30 20:35:01,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1037 transitions. [2018-09-30 20:35:01,668 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1037 transitions. Word has length 8 [2018-09-30 20:35:01,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:01,668 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 1037 transitions. [2018-09-30 20:35:01,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:35:01,668 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1037 transitions. [2018-09-30 20:35:01,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:35:01,670 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:01,670 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:01,671 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:01,671 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:01,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595081, now seen corresponding path program 1 times [2018-09-30 20:35:01,672 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:01,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:01,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:01,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:01,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:01,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:01,768 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:35:01,768 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:35:01,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:35:01,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:35:01,769 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:01,769 INFO L87 Difference]: Start difference. First operand 334 states and 1037 transitions. Second operand 8 states. [2018-09-30 20:35:11,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:11,784 INFO L93 Difference]: Finished difference Result 1145 states and 3146 transitions. [2018-09-30 20:35:11,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:35:11,785 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:35:11,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:11,790 INFO L225 Difference]: With dead ends: 1145 [2018-09-30 20:35:11,790 INFO L226 Difference]: Without dead ends: 812 [2018-09-30 20:35:11,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:35:11,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2018-09-30 20:35:11,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 450. [2018-09-30 20:35:11,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-09-30 20:35:11,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1432 transitions. [2018-09-30 20:35:11,873 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1432 transitions. Word has length 8 [2018-09-30 20:35:11,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:11,873 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 1432 transitions. [2018-09-30 20:35:11,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:35:11,873 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1432 transitions. [2018-09-30 20:35:11,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:35:11,874 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:11,875 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:11,875 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:11,876 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:11,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595078, now seen corresponding path program 1 times [2018-09-30 20:35:11,876 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:11,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:11,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:11,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:11,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:11,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:11,970 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:35:11,970 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:35:11,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:35:11,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:35:11,971 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:11,971 INFO L87 Difference]: Start difference. First operand 450 states and 1432 transitions. Second operand 8 states. [2018-09-30 20:35:19,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:19,995 INFO L93 Difference]: Finished difference Result 877 states and 2260 transitions. [2018-09-30 20:35:19,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 20:35:19,995 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:35:19,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:20,001 INFO L225 Difference]: With dead ends: 877 [2018-09-30 20:35:20,001 INFO L226 Difference]: Without dead ends: 871 [2018-09-30 20:35:20,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:35:20,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-09-30 20:35:20,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 478. [2018-09-30 20:35:20,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-09-30 20:35:20,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1531 transitions. [2018-09-30 20:35:20,113 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1531 transitions. Word has length 8 [2018-09-30 20:35:20,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:20,113 INFO L480 AbstractCegarLoop]: Abstraction has 478 states and 1531 transitions. [2018-09-30 20:35:20,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:35:20,113 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1531 transitions. [2018-09-30 20:35:20,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:35:20,114 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:20,114 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:20,115 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:20,115 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:20,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064444, now seen corresponding path program 1 times [2018-09-30 20:35:20,116 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:20,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:20,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:20,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:20,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:20,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:20,258 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:35:20,259 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:35:20,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:35:20,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:35:20,260 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:20,260 INFO L87 Difference]: Start difference. First operand 478 states and 1531 transitions. Second operand 8 states. [2018-09-30 20:35:29,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:29,304 INFO L93 Difference]: Finished difference Result 1049 states and 2854 transitions. [2018-09-30 20:35:29,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 20:35:29,305 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:35:29,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:29,309 INFO L225 Difference]: With dead ends: 1049 [2018-09-30 20:35:29,310 INFO L226 Difference]: Without dead ends: 818 [2018-09-30 20:35:29,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:35:29,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2018-09-30 20:35:29,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 524. [2018-09-30 20:35:29,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-09-30 20:35:29,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1684 transitions. [2018-09-30 20:35:29,428 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1684 transitions. Word has length 8 [2018-09-30 20:35:29,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:29,428 INFO L480 AbstractCegarLoop]: Abstraction has 524 states and 1684 transitions. [2018-09-30 20:35:29,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:35:29,429 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1684 transitions. [2018-09-30 20:35:29,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:35:29,430 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:29,430 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:29,431 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:29,431 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:29,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064441, now seen corresponding path program 1 times [2018-09-30 20:35:29,431 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:29,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:29,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:29,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:29,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:29,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:29,519 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:35:29,519 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:35:29,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:35:29,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:35:29,520 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:29,520 INFO L87 Difference]: Start difference. First operand 524 states and 1684 transitions. Second operand 8 states. [2018-09-30 20:35:36,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:36,713 INFO L93 Difference]: Finished difference Result 733 states and 1997 transitions. [2018-09-30 20:35:36,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 20:35:36,714 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:35:36,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:36,719 INFO L225 Difference]: With dead ends: 733 [2018-09-30 20:35:36,720 INFO L226 Difference]: Without dead ends: 727 [2018-09-30 20:35:36,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:35:36,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-09-30 20:35:36,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 530. [2018-09-30 20:35:36,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-09-30 20:35:36,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1690 transitions. [2018-09-30 20:35:36,883 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1690 transitions. Word has length 8 [2018-09-30 20:35:36,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:36,883 INFO L480 AbstractCegarLoop]: Abstraction has 530 states and 1690 transitions. [2018-09-30 20:35:36,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:35:36,883 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1690 transitions. [2018-09-30 20:35:36,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:35:36,884 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:36,885 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:36,885 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:36,886 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:36,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656691, now seen corresponding path program 1 times [2018-09-30 20:35:36,886 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:36,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:36,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:36,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:36,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:37,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:37,220 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:35:37,220 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:35:37,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:35:37,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:35:37,221 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:37,221 INFO L87 Difference]: Start difference. First operand 530 states and 1690 transitions. Second operand 8 states. [2018-09-30 20:35:48,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:48,670 INFO L93 Difference]: Finished difference Result 1329 states and 3609 transitions. [2018-09-30 20:35:48,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 20:35:48,670 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:35:48,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:48,678 INFO L225 Difference]: With dead ends: 1329 [2018-09-30 20:35:48,678 INFO L226 Difference]: Without dead ends: 1323 [2018-09-30 20:35:48,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-09-30 20:35:48,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2018-09-30 20:35:48,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 626. [2018-09-30 20:35:48,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-09-30 20:35:48,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 2087 transitions. [2018-09-30 20:35:48,871 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 2087 transitions. Word has length 8 [2018-09-30 20:35:48,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:48,871 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 2087 transitions. [2018-09-30 20:35:48,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:35:48,871 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 2087 transitions. [2018-09-30 20:35:48,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:35:48,873 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:48,873 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:48,873 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:48,874 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:48,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656688, now seen corresponding path program 1 times [2018-09-30 20:35:48,874 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:48,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:48,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:48,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:48,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:48,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-09-30 20:35:48,970 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:35:48,971 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:35:48,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:35:48,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:35:48,971 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:48,971 INFO L87 Difference]: Start difference. First operand 626 states and 2087 transitions. Second operand 8 states. [2018-09-30 20:35:57,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:57,348 INFO L93 Difference]: Finished difference Result 1268 states and 3539 transitions. [2018-09-30 20:35:57,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 20:35:57,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:35:57,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:57,354 INFO L225 Difference]: With dead ends: 1268 [2018-09-30 20:35:57,354 INFO L226 Difference]: Without dead ends: 1262 [2018-09-30 20:35:57,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:35:57,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2018-09-30 20:35:57,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 618. [2018-09-30 20:35:57,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-09-30 20:35:57,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 2056 transitions. [2018-09-30 20:35:57,570 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 2056 transitions. Word has length 8 [2018-09-30 20:35:57,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:57,570 INFO L480 AbstractCegarLoop]: Abstraction has 618 states and 2056 transitions. [2018-09-30 20:35:57,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:35:57,570 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 2056 transitions. [2018-09-30 20:35:57,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:35:57,571 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:57,571 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:57,572 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:57,572 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:57,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285639, now seen corresponding path program 1 times [2018-09-30 20:35:57,573 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:57,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:57,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:57,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:57,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:57,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:57,708 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:35:57,708 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:35:57,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:35:57,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:35:57,709 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:57,709 INFO L87 Difference]: Start difference. First operand 618 states and 2056 transitions. Second operand 8 states. [2018-09-30 20:36:06,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:06,469 INFO L93 Difference]: Finished difference Result 1367 states and 3876 transitions. [2018-09-30 20:36:06,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 20:36:06,469 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:36:06,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:06,478 INFO L225 Difference]: With dead ends: 1367 [2018-09-30 20:36:06,478 INFO L226 Difference]: Without dead ends: 1361 [2018-09-30 20:36:06,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:36:06,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2018-09-30 20:36:06,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 671. [2018-09-30 20:36:06,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2018-09-30 20:36:06,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 2249 transitions. [2018-09-30 20:36:06,689 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 2249 transitions. Word has length 8 [2018-09-30 20:36:06,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:06,689 INFO L480 AbstractCegarLoop]: Abstraction has 671 states and 2249 transitions. [2018-09-30 20:36:06,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:36:06,690 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 2249 transitions. [2018-09-30 20:36:06,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:36:06,690 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:06,691 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:06,691 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:06,691 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:06,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285636, now seen corresponding path program 1 times [2018-09-30 20:36:06,692 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:06,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:06,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:06,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:06,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:06,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:06,788 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:36:06,788 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:36:06,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:36:06,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:36:06,789 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:06,789 INFO L87 Difference]: Start difference. First operand 671 states and 2249 transitions. Second operand 8 states. [2018-09-30 20:36:18,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:18,470 INFO L93 Difference]: Finished difference Result 1373 states and 3787 transitions. [2018-09-30 20:36:18,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 20:36:18,471 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:36:18,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:18,482 INFO L225 Difference]: With dead ends: 1373 [2018-09-30 20:36:18,482 INFO L226 Difference]: Without dead ends: 1367 [2018-09-30 20:36:18,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:36:18,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-09-30 20:36:18,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 698. [2018-09-30 20:36:18,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-09-30 20:36:18,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 2344 transitions. [2018-09-30 20:36:18,736 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 2344 transitions. Word has length 8 [2018-09-30 20:36:18,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:18,736 INFO L480 AbstractCegarLoop]: Abstraction has 698 states and 2344 transitions. [2018-09-30 20:36:18,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:36:18,736 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 2344 transitions. [2018-09-30 20:36:18,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:36:18,737 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:18,738 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:18,738 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:18,739 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:18,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280348, now seen corresponding path program 1 times [2018-09-30 20:36:18,739 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:18,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:18,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:18,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:18,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:18,883 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:36:18,884 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:36:18,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:36:18,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:36:18,884 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:18,885 INFO L87 Difference]: Start difference. First operand 698 states and 2344 transitions. Second operand 7 states. [2018-09-30 20:36:27,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:27,671 INFO L93 Difference]: Finished difference Result 1526 states and 4298 transitions. [2018-09-30 20:36:27,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:36:27,671 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:36:27,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:27,679 INFO L225 Difference]: With dead ends: 1526 [2018-09-30 20:36:27,679 INFO L226 Difference]: Without dead ends: 1520 [2018-09-30 20:36:27,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:36:27,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2018-09-30 20:36:27,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 789. [2018-09-30 20:36:27,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-09-30 20:36:27,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 2673 transitions. [2018-09-30 20:36:27,944 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 2673 transitions. Word has length 8 [2018-09-30 20:36:27,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:27,945 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 2673 transitions. [2018-09-30 20:36:27,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:36:27,945 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 2673 transitions. [2018-09-30 20:36:27,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:36:27,946 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:27,946 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:27,947 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:27,947 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:27,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280221, now seen corresponding path program 1 times [2018-09-30 20:36:27,947 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:27,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:27,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:27,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:27,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:28,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:28,032 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:36:28,032 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:36:28,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:36:28,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:36:28,033 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:28,033 INFO L87 Difference]: Start difference. First operand 789 states and 2673 transitions. Second operand 7 states. [2018-09-30 20:36:36,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:36,786 INFO L93 Difference]: Finished difference Result 1548 states and 4356 transitions. [2018-09-30 20:36:36,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:36:36,787 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:36:36,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:36,794 INFO L225 Difference]: With dead ends: 1548 [2018-09-30 20:36:36,794 INFO L226 Difference]: Without dead ends: 1542 [2018-09-30 20:36:36,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:36:36,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2018-09-30 20:36:37,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 821. [2018-09-30 20:36:37,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-09-30 20:36:37,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 2801 transitions. [2018-09-30 20:36:37,095 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 2801 transitions. Word has length 8 [2018-09-30 20:36:37,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:37,095 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 2801 transitions. [2018-09-30 20:36:37,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:36:37,095 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 2801 transitions. [2018-09-30 20:36:37,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:36:37,096 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:37,096 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:37,097 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:37,097 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:37,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878937, now seen corresponding path program 1 times [2018-09-30 20:36:37,097 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:37,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:37,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:37,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:37,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:37,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:37,175 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:36:37,176 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:36:37,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:36:37,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:36:37,176 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:37,176 INFO L87 Difference]: Start difference. First operand 821 states and 2801 transitions. Second operand 7 states. [2018-09-30 20:36:46,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:46,155 INFO L93 Difference]: Finished difference Result 1575 states and 4539 transitions. [2018-09-30 20:36:46,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:36:46,155 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:36:46,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:46,163 INFO L225 Difference]: With dead ends: 1575 [2018-09-30 20:36:46,163 INFO L226 Difference]: Without dead ends: 1569 [2018-09-30 20:36:46,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:36:46,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2018-09-30 20:36:46,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 849. [2018-09-30 20:36:46,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-09-30 20:36:46,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2913 transitions. [2018-09-30 20:36:46,465 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 2913 transitions. Word has length 8 [2018-09-30 20:36:46,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:46,466 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 2913 transitions. [2018-09-30 20:36:46,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:36:46,466 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 2913 transitions. [2018-09-30 20:36:46,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:36:46,467 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:46,467 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:46,467 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:46,467 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:46,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878810, now seen corresponding path program 1 times [2018-09-30 20:36:46,468 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:46,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:46,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:46,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:46,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:46,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:46,545 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:36:46,545 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:36:46,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:36:46,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:36:46,546 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:46,546 INFO L87 Difference]: Start difference. First operand 849 states and 2913 transitions. Second operand 7 states. [2018-09-30 20:36:53,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:53,370 INFO L93 Difference]: Finished difference Result 1597 states and 4579 transitions. [2018-09-30 20:36:53,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 20:36:53,371 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:36:53,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:53,381 INFO L225 Difference]: With dead ends: 1597 [2018-09-30 20:36:53,381 INFO L226 Difference]: Without dead ends: 1591 [2018-09-30 20:36:53,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:36:53,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-09-30 20:36:53,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 873. [2018-09-30 20:36:53,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-09-30 20:36:53,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 2993 transitions. [2018-09-30 20:36:53,681 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 2993 transitions. Word has length 8 [2018-09-30 20:36:53,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:53,681 INFO L480 AbstractCegarLoop]: Abstraction has 873 states and 2993 transitions. [2018-09-30 20:36:53,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:36:53,681 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 2993 transitions. [2018-09-30 20:36:53,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:36:53,682 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:53,683 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:53,684 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:53,684 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:53,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288024, now seen corresponding path program 1 times [2018-09-30 20:36:53,684 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:53,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:53,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:53,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:53,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:53,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:53,808 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:36:53,808 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:36:53,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:36:53,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:36:53,809 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:53,809 INFO L87 Difference]: Start difference. First operand 873 states and 2993 transitions. Second operand 7 states. [2018-09-30 20:36:59,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:59,983 INFO L93 Difference]: Finished difference Result 1726 states and 5211 transitions. [2018-09-30 20:36:59,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 20:36:59,984 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:36:59,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:59,996 INFO L225 Difference]: With dead ends: 1726 [2018-09-30 20:36:59,996 INFO L226 Difference]: Without dead ends: 1720 [2018-09-30 20:36:59,997 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:36:59,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2018-09-30 20:37:00,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1006. [2018-09-30 20:37:00,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2018-09-30 20:37:00,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 3474 transitions. [2018-09-30 20:37:00,401 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 3474 transitions. Word has length 8 [2018-09-30 20:37:00,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:00,401 INFO L480 AbstractCegarLoop]: Abstraction has 1006 states and 3474 transitions. [2018-09-30 20:37:00,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:37:00,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 3474 transitions. [2018-09-30 20:37:00,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:37:00,402 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:00,402 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:00,403 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:00,403 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:00,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288027, now seen corresponding path program 1 times [2018-09-30 20:37:00,403 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:00,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:00,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:00,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:00,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:00,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-09-30 20:37:00,522 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:37:00,522 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:37:00,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:37:00,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:37:00,523 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:00,523 INFO L87 Difference]: Start difference. First operand 1006 states and 3474 transitions. Second operand 7 states. [2018-09-30 20:37:09,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:09,259 INFO L93 Difference]: Finished difference Result 1758 states and 5203 transitions. [2018-09-30 20:37:09,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 20:37:09,259 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:37:09,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:09,265 INFO L225 Difference]: With dead ends: 1758 [2018-09-30 20:37:09,266 INFO L226 Difference]: Without dead ends: 1752 [2018-09-30 20:37:09,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:37:09,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2018-09-30 20:37:09,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1011. [2018-09-30 20:37:09,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-09-30 20:37:09,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 3493 transitions. [2018-09-30 20:37:09,736 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 3493 transitions. Word has length 8 [2018-09-30 20:37:09,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:09,736 INFO L480 AbstractCegarLoop]: Abstraction has 1011 states and 3493 transitions. [2018-09-30 20:37:09,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:37:09,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 3493 transitions. [2018-09-30 20:37:09,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:37:09,737 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:09,738 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:09,738 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:09,738 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:09,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746872, now seen corresponding path program 1 times [2018-09-30 20:37:09,739 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:09,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:09,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:09,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:09,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:09,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:09,809 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:37:09,809 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:37:09,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:37:09,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:37:09,810 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:09,810 INFO L87 Difference]: Start difference. First operand 1011 states and 3493 transitions. Second operand 7 states. [2018-09-30 20:37:18,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:18,431 INFO L93 Difference]: Finished difference Result 1867 states and 5608 transitions. [2018-09-30 20:37:18,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 20:37:18,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:37:18,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:18,438 INFO L225 Difference]: With dead ends: 1867 [2018-09-30 20:37:18,439 INFO L226 Difference]: Without dead ends: 1861 [2018-09-30 20:37:18,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:37:18,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2018-09-30 20:37:18,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1119. [2018-09-30 20:37:18,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2018-09-30 20:37:18,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 3931 transitions. [2018-09-30 20:37:18,958 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 3931 transitions. Word has length 8 [2018-09-30 20:37:18,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:18,958 INFO L480 AbstractCegarLoop]: Abstraction has 1119 states and 3931 transitions. [2018-09-30 20:37:18,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:37:18,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 3931 transitions. [2018-09-30 20:37:18,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:37:18,959 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:18,959 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:18,960 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:18,960 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:18,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746875, now seen corresponding path program 1 times [2018-09-30 20:37:18,960 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:18,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:18,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:18,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:18,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:19,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:19,503 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:37:19,503 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:37:19,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:37:19,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:37:19,504 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:19,504 INFO L87 Difference]: Start difference. First operand 1119 states and 3931 transitions. Second operand 7 states. [2018-09-30 20:37:29,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:29,540 INFO L93 Difference]: Finished difference Result 1968 states and 5829 transitions. [2018-09-30 20:37:29,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:37:29,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:37:29,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:29,550 INFO L225 Difference]: With dead ends: 1968 [2018-09-30 20:37:29,550 INFO L226 Difference]: Without dead ends: 1962 [2018-09-30 20:37:29,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-09-30 20:37:29,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2018-09-30 20:37:30,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1111. [2018-09-30 20:37:30,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2018-09-30 20:37:30,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 3891 transitions. [2018-09-30 20:37:30,248 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 3891 transitions. Word has length 8 [2018-09-30 20:37:30,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:30,248 INFO L480 AbstractCegarLoop]: Abstraction has 1111 states and 3891 transitions. [2018-09-30 20:37:30,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:37:30,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 3891 transitions. [2018-09-30 20:37:30,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:37:30,249 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:30,249 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:30,250 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:30,250 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:30,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1616407055, now seen corresponding path program 1 times [2018-09-30 20:37:30,250 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:30,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:30,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:30,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:30,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:30,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:30,347 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:37:30,347 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:37:30,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:37:30,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:37:30,347 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:30,348 INFO L87 Difference]: Start difference. First operand 1111 states and 3891 transitions. Second operand 7 states. [2018-09-30 20:37:38,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:38,373 INFO L93 Difference]: Finished difference Result 2001 states and 6001 transitions. [2018-09-30 20:37:38,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 20:37:38,374 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:37:38,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:38,380 INFO L225 Difference]: With dead ends: 2001 [2018-09-30 20:37:38,381 INFO L226 Difference]: Without dead ends: 1995 [2018-09-30 20:37:38,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:37:38,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2018-09-30 20:37:39,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1117. [2018-09-30 20:37:39,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2018-09-30 20:37:39,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 3909 transitions. [2018-09-30 20:37:39,055 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 3909 transitions. Word has length 8 [2018-09-30 20:37:39,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:39,055 INFO L480 AbstractCegarLoop]: Abstraction has 1117 states and 3909 transitions. [2018-09-30 20:37:39,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:37:39,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 3909 transitions. [2018-09-30 20:37:39,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:37:39,056 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:39,057 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:39,057 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:39,057 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:39,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1616406928, now seen corresponding path program 1 times [2018-09-30 20:37:39,058 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:39,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:39,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:39,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:39,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:39,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:39,128 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:37:39,128 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:37:39,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:37:39,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:37:39,129 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:39,129 INFO L87 Difference]: Start difference. First operand 1117 states and 3909 transitions. Second operand 7 states. [2018-09-30 20:37:45,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:45,661 INFO L93 Difference]: Finished difference Result 1708 states and 5233 transitions. [2018-09-30 20:37:45,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 20:37:45,662 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:37:45,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:45,667 INFO L225 Difference]: With dead ends: 1708 [2018-09-30 20:37:45,667 INFO L226 Difference]: Without dead ends: 1702 [2018-09-30 20:37:45,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:37:45,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2018-09-30 20:37:46,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1210. [2018-09-30 20:37:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2018-09-30 20:37:46,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 4307 transitions. [2018-09-30 20:37:46,395 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 4307 transitions. Word has length 8 [2018-09-30 20:37:46,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:46,396 INFO L480 AbstractCegarLoop]: Abstraction has 1210 states and 4307 transitions. [2018-09-30 20:37:46,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:37:46,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 4307 transitions. [2018-09-30 20:37:46,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:37:46,397 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:46,397 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:46,398 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:46,398 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:46,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256941, now seen corresponding path program 1 times [2018-09-30 20:37:46,398 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:46,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:46,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:46,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:46,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:46,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:46,488 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:37:46,488 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:37:46,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:37:46,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:37:46,488 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:46,488 INFO L87 Difference]: Start difference. First operand 1210 states and 4307 transitions. Second operand 7 states. [2018-09-30 20:37:55,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:55,815 INFO L93 Difference]: Finished difference Result 2402 states and 7321 transitions. [2018-09-30 20:37:55,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:37:55,816 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:37:55,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:55,820 INFO L225 Difference]: With dead ends: 2402 [2018-09-30 20:37:55,820 INFO L226 Difference]: Without dead ends: 2396 [2018-09-30 20:37:55,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:37:55,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2018-09-30 20:37:56,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1341. [2018-09-30 20:37:56,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-09-30 20:37:56,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 4862 transitions. [2018-09-30 20:37:56,558 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 4862 transitions. Word has length 8 [2018-09-30 20:37:56,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:56,559 INFO L480 AbstractCegarLoop]: Abstraction has 1341 states and 4862 transitions. [2018-09-30 20:37:56,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:37:56,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 4862 transitions. [2018-09-30 20:37:56,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:37:56,560 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:56,560 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:56,561 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:56,561 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:56,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256944, now seen corresponding path program 1 times [2018-09-30 20:37:56,561 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:56,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:56,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:56,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:56,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:56,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-09-30 20:37:56,671 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:37:56,671 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:37:56,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:37:56,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:37:56,672 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:56,672 INFO L87 Difference]: Start difference. First operand 1341 states and 4862 transitions. Second operand 7 states. [2018-09-30 20:38:05,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:38:05,132 INFO L93 Difference]: Finished difference Result 2274 states and 6934 transitions. [2018-09-30 20:38:05,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 20:38:05,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:38:05,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:38:05,136 INFO L225 Difference]: With dead ends: 2274 [2018-09-30 20:38:05,137 INFO L226 Difference]: Without dead ends: 2268 [2018-09-30 20:38:05,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:38:05,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2018-09-30 20:38:05,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 1337. [2018-09-30 20:38:05,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-09-30 20:38:05,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 4840 transitions. [2018-09-30 20:38:05,983 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 4840 transitions. Word has length 8 [2018-09-30 20:38:05,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:38:05,983 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 4840 transitions. [2018-09-30 20:38:05,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:38:05,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 4840 transitions. [2018-09-30 20:38:05,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:38:05,984 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:38:05,985 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-09-30 20:38:05,985 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:38:05,985 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:38:05,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1621267991, now seen corresponding path program 1 times [2018-09-30 20:38:05,985 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:38:05,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:38:05,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:05,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:38:05,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:38:06,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:38:06,013 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:38:06,013 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:38:06,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:38:06,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:38:06,014 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:38:06,014 INFO L87 Difference]: Start difference. First operand 1337 states and 4840 transitions. Second operand 4 states. [2018-09-30 20:38:07,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:38:07,278 INFO L93 Difference]: Finished difference Result 2170 states and 7637 transitions. [2018-09-30 20:38:07,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 20:38:07,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-09-30 20:38:07,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:38:07,281 INFO L225 Difference]: With dead ends: 2170 [2018-09-30 20:38:07,282 INFO L226 Difference]: Without dead ends: 1253 [2018-09-30 20:38:07,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:38:07,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2018-09-30 20:38:07,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1080. [2018-09-30 20:38:07,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2018-09-30 20:38:07,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 3769 transitions. [2018-09-30 20:38:07,919 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 3769 transitions. Word has length 8 [2018-09-30 20:38:07,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:38:07,919 INFO L480 AbstractCegarLoop]: Abstraction has 1080 states and 3769 transitions. [2018-09-30 20:38:07,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:38:07,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 3769 transitions. [2018-09-30 20:38:07,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:38:07,921 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:38:07,921 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:38:07,921 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:38:07,921 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:38:07,922 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283460, now seen corresponding path program 1 times [2018-09-30 20:38:07,922 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:38:07,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:38:07,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:07,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:38:07,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:38:08,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:38:08,017 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:38:08,017 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:38:08,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:38:08,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:38:08,018 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:38:08,018 INFO L87 Difference]: Start difference. First operand 1080 states and 3769 transitions. Second operand 8 states. [2018-09-30 20:38:20,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:38:20,267 INFO L93 Difference]: Finished difference Result 2095 states and 6316 transitions. [2018-09-30 20:38:20,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 20:38:20,267 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:38:20,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:38:20,271 INFO L225 Difference]: With dead ends: 2095 [2018-09-30 20:38:20,271 INFO L226 Difference]: Without dead ends: 2093 [2018-09-30 20:38:20,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:38:20,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2018-09-30 20:38:20,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1161. [2018-09-30 20:38:20,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2018-09-30 20:38:20,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 4123 transitions. [2018-09-30 20:38:20,988 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 4123 transitions. Word has length 8 [2018-09-30 20:38:20,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:38:20,988 INFO L480 AbstractCegarLoop]: Abstraction has 1161 states and 4123 transitions. [2018-09-30 20:38:20,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:38:20,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 4123 transitions. [2018-09-30 20:38:20,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:38:20,989 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:38:20,989 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:38:20,989 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:38:20,989 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:38:20,990 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283333, now seen corresponding path program 1 times [2018-09-30 20:38:20,990 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:38:20,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:38:20,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:20,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:38:20,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:38:21,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:38:21,106 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:38:21,107 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:38:21,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:38:21,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:38:21,107 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:38:21,107 INFO L87 Difference]: Start difference. First operand 1161 states and 4123 transitions. Second operand 8 states. [2018-09-30 20:38:33,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:38:33,430 INFO L93 Difference]: Finished difference Result 1994 states and 5988 transitions. [2018-09-30 20:38:33,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:38:33,430 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:38:33,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:38:33,434 INFO L225 Difference]: With dead ends: 1994 [2018-09-30 20:38:33,434 INFO L226 Difference]: Without dead ends: 1988 [2018-09-30 20:38:33,434 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:38:33,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2018-09-30 20:38:34,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1152. [2018-09-30 20:38:34,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2018-09-30 20:38:34,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 4099 transitions. [2018-09-30 20:38:34,205 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 4099 transitions. Word has length 8 [2018-09-30 20:38:34,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:38:34,206 INFO L480 AbstractCegarLoop]: Abstraction has 1152 states and 4099 transitions. [2018-09-30 20:38:34,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:38:34,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 4099 transitions. [2018-09-30 20:38:34,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:38:34,207 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:38:34,207 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:38:34,207 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:38:34,208 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:38:34,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1867882049, now seen corresponding path program 1 times [2018-09-30 20:38:34,208 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:38:34,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:38:34,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:34,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:38:34,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:38:34,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:38:34,309 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:38:34,309 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:38:34,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:38:34,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:38:34,310 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:38:34,310 INFO L87 Difference]: Start difference. First operand 1152 states and 4099 transitions. Second operand 8 states. Received shutdown request... [2018-09-30 20:38:35,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 20:38:35,696 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 20:38:35,703 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 20:38:35,704 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:38:35 BoogieIcfgContainer [2018-09-30 20:38:35,704 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:38:35,705 INFO L168 Benchmark]: Toolchain (without parser) took 257018.94 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 8.9 MB). Free memory was 1.5 GB in the beginning and 946.3 MB in the end (delta: 517.8 MB). Peak memory consumption was 526.7 MB. Max. memory is 7.1 GB. [2018-09-30 20:38:35,707 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:38:35,708 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.88 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:38:35,709 INFO L168 Benchmark]: Boogie Preprocessor took 55.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:38:35,709 INFO L168 Benchmark]: RCFGBuilder took 1204.38 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-30 20:38:35,710 INFO L168 Benchmark]: TraceAbstraction took 255702.38 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 8.9 MB). Free memory was 1.4 GB in the beginning and 946.3 MB in the end (delta: 475.5 MB). Peak memory consumption was 484.4 MB. Max. memory is 7.1 GB. [2018-09-30 20:38:35,714 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 49.88 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1204.38 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 255702.38 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 8.9 MB). Free memory was 1.4 GB in the beginning and 946.3 MB in the end (delta: 475.5 MB). Peak memory consumption was 484.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 223]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 223). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 604]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 604). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 599]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 599). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 199]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 199). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 95). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 594]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 584]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 584). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 574]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 194]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 194). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 847]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 847). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 832]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 832). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 446]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 446). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 337]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 337). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 71). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 624]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 624). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 470]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 470). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 800]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 800). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 316]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 316). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 263]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 263). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 816]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 816). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 27 error locations. TIMEOUT Result, 255.6s OverallTime, 30 OverallIterations, 2 TraceHistogramMax, 241.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8112 SDtfs, 13970 SDslu, 14445 SDs, 0 SdLazy, 50508 SolverSat, 5237 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 63.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 423 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 421 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1341occurred in iteration=25, 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: 9.9s AutomataMinimizationTime, 29 MinimizatonAttempts, 16299 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 201 ConstructedInterpolants, 0 QuantifiedInterpolants, 19339 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 3/3 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-09-30_20-38-35-730.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-09-30_20-38-35-730.csv Completed graceful shutdown