java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2eb0a67 [2018-10-03 08:34:51,214 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-03 08:34:51,216 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-03 08:34:51,229 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-03 08:34:51,229 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-03 08:34:51,230 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-03 08:34:51,231 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-03 08:34:51,233 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-03 08:34:51,235 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-03 08:34:51,236 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-03 08:34:51,237 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-03 08:34:51,237 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-03 08:34:51,238 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-03 08:34:51,239 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-03 08:34:51,240 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-03 08:34:51,241 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-03 08:34:51,242 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-03 08:34:51,246 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-03 08:34:51,251 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-03 08:34:51,253 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-03 08:34:51,257 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-03 08:34:51,258 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-03 08:34:51,262 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-03 08:34:51,265 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-03 08:34:51,265 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-03 08:34:51,266 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-03 08:34:51,268 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-03 08:34:51,269 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-03 08:34:51,270 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-03 08:34:51,274 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-03 08:34:51,275 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-03 08:34:51,275 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-03 08:34:51,276 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-03 08:34:51,277 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-03 08:34:51,278 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-03 08:34:51,280 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-03 08:34:51,280 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-03 08:34:51,309 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-03 08:34:51,309 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-03 08:34:51,310 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-03 08:34:51,310 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-03 08:34:51,311 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-03 08:34:51,312 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-03 08:34:51,312 INFO L133 SettingsManager]: * Use SBE=true [2018-10-03 08:34:51,312 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-03 08:34:51,312 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-03 08:34:51,312 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-03 08:34:51,313 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-03 08:34:51,313 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-03 08:34:51,313 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-03 08:34:51,313 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-03 08:34:51,313 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-03 08:34:51,315 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-03 08:34:51,315 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-03 08:34:51,315 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-03 08:34:51,315 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-03 08:34:51,317 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-03 08:34:51,317 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-03 08:34:51,317 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-03 08:34:51,317 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 08:34:51,318 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-03 08:34:51,318 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-03 08:34:51,318 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-03 08:34:51,318 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-03 08:34:51,318 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-03 08:34:51,318 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-03 08:34:51,319 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-03 08:34:51,367 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-03 08:34:51,381 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-03 08:34:51,388 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-03 08:34:51,390 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-03 08:34:51,390 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-03 08:34:51,391 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl [2018-10-03 08:34:51,391 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl' [2018-10-03 08:34:51,477 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-03 08:34:51,481 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-03 08:34:51,482 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-03 08:34:51,482 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-03 08:34:51,483 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-03 08:34:51,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:34:51" (1/1) ... [2018-10-03 08:34:51,520 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:34:51" (1/1) ... [2018-10-03 08:34:51,533 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-03 08:34:51,533 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-03 08:34:51,534 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-03 08:34:51,536 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-03 08:34:51,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-03 08:34:51,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-03 08:34:51,537 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-03 08:34:51,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:34:51" (1/1) ... [2018-10-03 08:34:51,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:34:51" (1/1) ... [2018-10-03 08:34:51,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:34:51" (1/1) ... [2018-10-03 08:34:51,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:34:51" (1/1) ... [2018-10-03 08:34:51,574 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:34:51" (1/1) ... [2018-10-03 08:34:51,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:34:51" (1/1) ... [2018-10-03 08:34:51,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:34:51" (1/1) ... [2018-10-03 08:34:51,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-03 08:34:51,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-03 08:34:51,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-03 08:34:51,600 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-03 08:34:51,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:34:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 08:34:51,681 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-03 08:34:51,682 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-03 08:34:51,682 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-03 08:34:52,519 INFO L337 CfgBuilder]: Using library mode [2018-10-03 08:34:52,520 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 08:34:52 BoogieIcfgContainer [2018-10-03 08:34:52,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-03 08:34:52,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-03 08:34:52,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-03 08:34:52,525 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-03 08:34:52,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:34:51" (1/2) ... [2018-10-03 08:34:52,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d00785 and model type threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 08:34:52, skipping insertion in model container [2018-10-03 08:34:52,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 08:34:52" (2/2) ... [2018-10-03 08:34:52,529 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out.bpl [2018-10-03 08:34:52,539 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-03 08:34:52,548 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-10-03 08:34:52,598 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-03 08:34:52,599 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-03 08:34:52,599 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-03 08:34:52,599 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-03 08:34:52,599 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-03 08:34:52,600 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-03 08:34:52,600 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-03 08:34:52,600 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-03 08:34:52,600 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-03 08:34:52,624 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-10-03 08:34:52,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-03 08:34:52,634 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:34:52,635 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:34:52,637 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:34:52,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:34:52,650 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-10-03 08:34:52,653 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:34:52,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:34:52,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:34:52,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:34:52,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:34:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:34:52,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:34:52,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:34:52,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-03 08:34:52,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-03 08:34:52,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-03 08:34:52,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-03 08:34:52,942 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-10-03 08:34:54,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:34:54,800 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-10-03 08:34:54,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-03 08:34:54,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-03 08:34:54,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:34:54,822 INFO L225 Difference]: With dead ends: 163 [2018-10-03 08:34:54,822 INFO L226 Difference]: Without dead ends: 158 [2018-10-03 08:34:54,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:34:54,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-03 08:34:54,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-10-03 08:34:54,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-03 08:34:54,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-10-03 08:34:54,886 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-10-03 08:34:54,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:34:54,887 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-10-03 08:34:54,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-03 08:34:54,887 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-10-03 08:34:54,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-03 08:34:54,888 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:34:54,889 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:34:54,890 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:34:54,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:34:54,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-10-03 08:34:54,891 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:34:54,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:34:54,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:34:54,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:34:54,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:34:54,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:34:54,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:34:54,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:34:54,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-03 08:34:54,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-03 08:34:54,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-03 08:34:54,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-03 08:34:54,993 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-10-03 08:34:55,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:34:55,967 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-10-03 08:34:55,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-03 08:34:55,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-03 08:34:55,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:34:55,971 INFO L225 Difference]: With dead ends: 188 [2018-10-03 08:34:55,971 INFO L226 Difference]: Without dead ends: 183 [2018-10-03 08:34:55,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:34:55,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-03 08:34:55,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-10-03 08:34:55,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-03 08:34:55,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-10-03 08:34:55,998 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-10-03 08:34:55,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:34:55,998 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-10-03 08:34:55,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-03 08:34:55,999 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-10-03 08:34:56,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-03 08:34:56,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:34:56,000 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:34:56,001 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:34:56,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:34:56,001 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-10-03 08:34:56,002 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:34:56,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:34:56,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:34:56,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:34:56,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:34:56,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:34:56,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:34:56,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:34:56,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-03 08:34:56,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-03 08:34:56,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-03 08:34:56,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-03 08:34:56,142 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-10-03 08:34:57,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:34:57,790 INFO L93 Difference]: Finished difference Result 361 states and 808 transitions. [2018-10-03 08:34:57,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-03 08:34:57,797 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-10-03 08:34:57,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:34:57,804 INFO L225 Difference]: With dead ends: 361 [2018-10-03 08:34:57,804 INFO L226 Difference]: Without dead ends: 349 [2018-10-03 08:34:57,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-10-03 08:34:57,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-10-03 08:34:57,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 174. [2018-10-03 08:34:57,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-10-03 08:34:57,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 387 transitions. [2018-10-03 08:34:57,864 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 387 transitions. Word has length 9 [2018-10-03 08:34:57,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:34:57,864 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 387 transitions. [2018-10-03 08:34:57,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-03 08:34:57,865 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 387 transitions. [2018-10-03 08:34:57,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-03 08:34:57,867 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:34:57,867 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:34:57,870 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:34:57,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:34:57,870 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-10-03 08:34:57,871 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:34:57,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:34:57,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:34:57,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:34:57,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:34:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:34:57,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:34:57,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:34:57,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-03 08:34:57,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-03 08:34:57,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-03 08:34:57,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-03 08:34:57,978 INFO L87 Difference]: Start difference. First operand 174 states and 387 transitions. Second operand 7 states. [2018-10-03 08:34:59,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:34:59,268 INFO L93 Difference]: Finished difference Result 307 states and 694 transitions. [2018-10-03 08:34:59,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-03 08:34:59,272 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-10-03 08:34:59,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:34:59,275 INFO L225 Difference]: With dead ends: 307 [2018-10-03 08:34:59,275 INFO L226 Difference]: Without dead ends: 302 [2018-10-03 08:34:59,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-10-03 08:34:59,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-03 08:34:59,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 203. [2018-10-03 08:34:59,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-03 08:34:59,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-10-03 08:34:59,317 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-10-03 08:34:59,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:34:59,317 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-10-03 08:34:59,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-03 08:34:59,317 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-10-03 08:34:59,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:34:59,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:34:59,319 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:34:59,320 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:34:59,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:34:59,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-10-03 08:34:59,321 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:34:59,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:34:59,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:34:59,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:34:59,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:34:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:34:59,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:34:59,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:34:59,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:34:59,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:34:59,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:34:59,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:34:59,750 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 8 states. [2018-10-03 08:35:04,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:04,937 INFO L93 Difference]: Finished difference Result 741 states and 1656 transitions. [2018-10-03 08:35:04,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-03 08:35:04,937 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-03 08:35:04,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:04,944 INFO L225 Difference]: With dead ends: 741 [2018-10-03 08:35:04,945 INFO L226 Difference]: Without dead ends: 733 [2018-10-03 08:35:04,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2018-10-03 08:35:04,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-10-03 08:35:04,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 315. [2018-10-03 08:35:04,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-03 08:35:04,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 743 transitions. [2018-10-03 08:35:04,999 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 743 transitions. Word has length 12 [2018-10-03 08:35:04,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:04,999 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 743 transitions. [2018-10-03 08:35:04,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:35:04,999 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 743 transitions. [2018-10-03 08:35:05,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:05,001 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:05,001 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:05,002 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:05,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:05,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-10-03 08:35:05,002 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:05,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:05,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:05,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:05,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:05,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:05,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:05,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:05,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:35:05,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:35:05,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:35:05,126 INFO L87 Difference]: Start difference. First operand 315 states and 743 transitions. Second operand 8 states. [2018-10-03 08:35:10,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:10,656 INFO L93 Difference]: Finished difference Result 797 states and 1784 transitions. [2018-10-03 08:35:10,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-03 08:35:10,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-03 08:35:10,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:10,664 INFO L225 Difference]: With dead ends: 797 [2018-10-03 08:35:10,664 INFO L226 Difference]: Without dead ends: 789 [2018-10-03 08:35:10,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-10-03 08:35:10,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-10-03 08:35:10,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 319. [2018-10-03 08:35:10,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-10-03 08:35:10,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 751 transitions. [2018-10-03 08:35:10,731 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 751 transitions. Word has length 12 [2018-10-03 08:35:10,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:10,731 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 751 transitions. [2018-10-03 08:35:10,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:35:10,732 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 751 transitions. [2018-10-03 08:35:10,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:10,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:10,733 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:10,734 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:10,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:10,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-10-03 08:35:10,734 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:10,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:10,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:10,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:10,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:10,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:10,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:10,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:10,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:35:10,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:35:10,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:35:10,909 INFO L87 Difference]: Start difference. First operand 319 states and 751 transitions. Second operand 8 states. [2018-10-03 08:35:12,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:12,809 INFO L93 Difference]: Finished difference Result 684 states and 1538 transitions. [2018-10-03 08:35:12,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-03 08:35:12,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-03 08:35:12,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:12,815 INFO L225 Difference]: With dead ends: 684 [2018-10-03 08:35:12,815 INFO L226 Difference]: Without dead ends: 676 [2018-10-03 08:35:12,816 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-10-03 08:35:12,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-10-03 08:35:12,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 330. [2018-10-03 08:35:12,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-10-03 08:35:12,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 778 transitions. [2018-10-03 08:35:12,884 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 778 transitions. Word has length 12 [2018-10-03 08:35:12,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:12,884 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 778 transitions. [2018-10-03 08:35:12,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:35:12,884 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 778 transitions. [2018-10-03 08:35:12,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:12,885 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:12,886 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:12,886 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:12,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:12,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-10-03 08:35:12,887 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:12,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:12,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:12,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:12,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:13,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:13,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:13,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:13,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:35:13,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:35:13,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:35:13,071 INFO L87 Difference]: Start difference. First operand 330 states and 778 transitions. Second operand 8 states. [2018-10-03 08:35:14,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:14,576 INFO L93 Difference]: Finished difference Result 605 states and 1360 transitions. [2018-10-03 08:35:14,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-03 08:35:14,576 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-03 08:35:14,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:14,581 INFO L225 Difference]: With dead ends: 605 [2018-10-03 08:35:14,581 INFO L226 Difference]: Without dead ends: 597 [2018-10-03 08:35:14,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-10-03 08:35:14,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-10-03 08:35:14,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 337. [2018-10-03 08:35:14,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-10-03 08:35:14,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 794 transitions. [2018-10-03 08:35:14,642 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 794 transitions. Word has length 12 [2018-10-03 08:35:14,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:14,642 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 794 transitions. [2018-10-03 08:35:14,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:35:14,643 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 794 transitions. [2018-10-03 08:35:14,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:14,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:14,644 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:14,644 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:14,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:14,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1088621469, now seen corresponding path program 1 times [2018-10-03 08:35:14,645 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:14,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:14,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:14,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:14,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:14,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:14,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:14,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:14,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:35:14,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:35:14,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:35:14,878 INFO L87 Difference]: Start difference. First operand 337 states and 794 transitions. Second operand 8 states. [2018-10-03 08:35:16,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:16,933 INFO L93 Difference]: Finished difference Result 935 states and 2104 transitions. [2018-10-03 08:35:16,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-03 08:35:16,934 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-03 08:35:16,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:16,941 INFO L225 Difference]: With dead ends: 935 [2018-10-03 08:35:16,941 INFO L226 Difference]: Without dead ends: 927 [2018-10-03 08:35:16,942 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2018-10-03 08:35:16,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-10-03 08:35:17,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 343. [2018-10-03 08:35:17,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-10-03 08:35:17,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 808 transitions. [2018-10-03 08:35:17,029 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 808 transitions. Word has length 12 [2018-10-03 08:35:17,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:17,029 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 808 transitions. [2018-10-03 08:35:17,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:35:17,029 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 808 transitions. [2018-10-03 08:35:17,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:17,030 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:17,030 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:17,031 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:17,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:17,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1085821115, now seen corresponding path program 1 times [2018-10-03 08:35:17,031 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:17,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:17,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:17,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:17,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:17,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:17,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:17,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:17,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:35:17,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:35:17,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:35:17,113 INFO L87 Difference]: Start difference. First operand 343 states and 808 transitions. Second operand 8 states. [2018-10-03 08:35:19,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:19,356 INFO L93 Difference]: Finished difference Result 923 states and 2061 transitions. [2018-10-03 08:35:19,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-03 08:35:19,357 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-03 08:35:19,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:19,363 INFO L225 Difference]: With dead ends: 923 [2018-10-03 08:35:19,364 INFO L226 Difference]: Without dead ends: 915 [2018-10-03 08:35:19,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-10-03 08:35:19,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-10-03 08:35:19,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 354. [2018-10-03 08:35:19,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-10-03 08:35:19,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 835 transitions. [2018-10-03 08:35:19,452 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 835 transitions. Word has length 12 [2018-10-03 08:35:19,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:19,453 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 835 transitions. [2018-10-03 08:35:19,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:35:19,453 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 835 transitions. [2018-10-03 08:35:19,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:19,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:19,454 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:19,454 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:19,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:19,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1085923260, now seen corresponding path program 1 times [2018-10-03 08:35:19,455 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:19,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:19,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:19,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:19,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:19,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:19,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:19,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:19,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:35:19,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:35:19,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:35:19,774 INFO L87 Difference]: Start difference. First operand 354 states and 835 transitions. Second operand 8 states. [2018-10-03 08:35:21,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:21,404 INFO L93 Difference]: Finished difference Result 837 states and 1868 transitions. [2018-10-03 08:35:21,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-03 08:35:21,404 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-03 08:35:21,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:21,409 INFO L225 Difference]: With dead ends: 837 [2018-10-03 08:35:21,409 INFO L226 Difference]: Without dead ends: 829 [2018-10-03 08:35:21,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-10-03 08:35:21,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-10-03 08:35:21,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 339. [2018-10-03 08:35:21,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-03 08:35:21,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 800 transitions. [2018-10-03 08:35:21,516 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 800 transitions. Word has length 12 [2018-10-03 08:35:21,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:21,516 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 800 transitions. [2018-10-03 08:35:21,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:35:21,516 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 800 transitions. [2018-10-03 08:35:21,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:21,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:21,517 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:21,518 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:21,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:21,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1383194877, now seen corresponding path program 1 times [2018-10-03 08:35:21,519 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:21,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:21,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:21,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:21,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:21,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:21,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:21,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:21,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:35:21,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:35:21,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:35:21,779 INFO L87 Difference]: Start difference. First operand 339 states and 800 transitions. Second operand 8 states. [2018-10-03 08:35:24,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:24,160 INFO L93 Difference]: Finished difference Result 996 states and 2227 transitions. [2018-10-03 08:35:24,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-03 08:35:24,161 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-03 08:35:24,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:24,165 INFO L225 Difference]: With dead ends: 996 [2018-10-03 08:35:24,165 INFO L226 Difference]: Without dead ends: 988 [2018-10-03 08:35:24,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-10-03 08:35:24,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-10-03 08:35:24,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 381. [2018-10-03 08:35:24,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-03 08:35:24,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-10-03 08:35:24,286 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-10-03 08:35:24,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:24,287 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-10-03 08:35:24,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:35:24,288 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-10-03 08:35:24,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:24,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:24,289 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:24,289 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:24,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:24,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1383297022, now seen corresponding path program 1 times [2018-10-03 08:35:24,289 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:24,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:24,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:24,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:24,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:24,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:24,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:24,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:24,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:35:24,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:35:24,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:35:24,387 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-10-03 08:35:26,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:26,256 INFO L93 Difference]: Finished difference Result 913 states and 2034 transitions. [2018-10-03 08:35:26,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-03 08:35:26,257 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-03 08:35:26,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:26,263 INFO L225 Difference]: With dead ends: 913 [2018-10-03 08:35:26,263 INFO L226 Difference]: Without dead ends: 905 [2018-10-03 08:35:26,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2018-10-03 08:35:26,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-10-03 08:35:26,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 371. [2018-10-03 08:35:26,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-10-03 08:35:26,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 890 transitions. [2018-10-03 08:35:26,390 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 890 transitions. Word has length 12 [2018-10-03 08:35:26,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:26,390 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 890 transitions. [2018-10-03 08:35:26,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:35:26,390 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 890 transitions. [2018-10-03 08:35:26,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:26,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:26,391 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:26,392 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:26,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:26,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1392211258, now seen corresponding path program 1 times [2018-10-03 08:35:26,392 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:26,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:26,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:26,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:26,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:26,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:26,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:26,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:26,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:35:26,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:35:26,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:35:26,477 INFO L87 Difference]: Start difference. First operand 371 states and 890 transitions. Second operand 8 states. [2018-10-03 08:35:28,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:28,122 INFO L93 Difference]: Finished difference Result 886 states and 2009 transitions. [2018-10-03 08:35:28,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-03 08:35:28,123 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-03 08:35:28,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:28,126 INFO L225 Difference]: With dead ends: 886 [2018-10-03 08:35:28,126 INFO L226 Difference]: Without dead ends: 878 [2018-10-03 08:35:28,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-10-03 08:35:28,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2018-10-03 08:35:28,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 372. [2018-10-03 08:35:28,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-10-03 08:35:28,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 891 transitions. [2018-10-03 08:35:28,251 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 891 transitions. Word has length 12 [2018-10-03 08:35:28,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:28,251 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 891 transitions. [2018-10-03 08:35:28,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:35:28,251 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 891 transitions. [2018-10-03 08:35:28,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:28,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:28,252 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:28,252 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:28,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:28,252 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-10-03 08:35:28,252 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:28,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:28,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:28,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:28,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:28,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:28,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:28,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:28,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 08:35:28,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 08:35:28,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:35:28,338 INFO L87 Difference]: Start difference. First operand 372 states and 891 transitions. Second operand 9 states. [2018-10-03 08:35:30,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:30,414 INFO L93 Difference]: Finished difference Result 801 states and 1838 transitions. [2018-10-03 08:35:30,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-03 08:35:30,415 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-03 08:35:30,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:30,419 INFO L225 Difference]: With dead ends: 801 [2018-10-03 08:35:30,419 INFO L226 Difference]: Without dead ends: 793 [2018-10-03 08:35:30,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2018-10-03 08:35:30,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-10-03 08:35:30,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 393. [2018-10-03 08:35:30,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-10-03 08:35:30,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 949 transitions. [2018-10-03 08:35:30,555 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 949 transitions. Word has length 12 [2018-10-03 08:35:30,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:30,555 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 949 transitions. [2018-10-03 08:35:30,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 08:35:30,555 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 949 transitions. [2018-10-03 08:35:30,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:30,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:30,556 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:30,557 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:30,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:30,557 INFO L82 PathProgramCache]: Analyzing trace with hash 192619318, now seen corresponding path program 1 times [2018-10-03 08:35:30,557 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:30,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:30,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:30,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:30,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:30,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:30,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:30,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:30,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 08:35:30,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 08:35:30,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:35:30,654 INFO L87 Difference]: Start difference. First operand 393 states and 949 transitions. Second operand 9 states. [2018-10-03 08:35:33,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:33,154 INFO L93 Difference]: Finished difference Result 962 states and 2211 transitions. [2018-10-03 08:35:33,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-03 08:35:33,155 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-03 08:35:33,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:33,162 INFO L225 Difference]: With dead ends: 962 [2018-10-03 08:35:33,162 INFO L226 Difference]: Without dead ends: 954 [2018-10-03 08:35:33,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-10-03 08:35:33,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-10-03 08:35:33,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 409. [2018-10-03 08:35:33,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-10-03 08:35:33,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 997 transitions. [2018-10-03 08:35:33,394 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 997 transitions. Word has length 12 [2018-10-03 08:35:33,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:33,394 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 997 transitions. [2018-10-03 08:35:33,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 08:35:33,394 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 997 transitions. [2018-10-03 08:35:33,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:33,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:33,396 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:33,396 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:33,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:33,397 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-10-03 08:35:33,397 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:33,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:33,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:33,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:33,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:33,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:33,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:33,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:33,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 08:35:33,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 08:35:33,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:35:33,709 INFO L87 Difference]: Start difference. First operand 409 states and 997 transitions. Second operand 9 states. [2018-10-03 08:35:36,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:36,230 INFO L93 Difference]: Finished difference Result 1000 states and 2329 transitions. [2018-10-03 08:35:36,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-03 08:35:36,231 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-03 08:35:36,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:36,235 INFO L225 Difference]: With dead ends: 1000 [2018-10-03 08:35:36,236 INFO L226 Difference]: Without dead ends: 992 [2018-10-03 08:35:36,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-10-03 08:35:36,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-10-03 08:35:36,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 430. [2018-10-03 08:35:36,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-10-03 08:35:36,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1052 transitions. [2018-10-03 08:35:36,402 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1052 transitions. Word has length 12 [2018-10-03 08:35:36,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:36,403 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 1052 transitions. [2018-10-03 08:35:36,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 08:35:36,403 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1052 transitions. [2018-10-03 08:35:36,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:36,403 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:36,404 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:36,404 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:36,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:36,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1320238459, now seen corresponding path program 1 times [2018-10-03 08:35:36,404 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:36,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:36,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:36,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:36,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:36,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:36,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:36,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:36,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 08:35:36,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 08:35:36,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:35:36,481 INFO L87 Difference]: Start difference. First operand 430 states and 1052 transitions. Second operand 9 states. [2018-10-03 08:35:39,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:39,407 INFO L93 Difference]: Finished difference Result 1065 states and 2466 transitions. [2018-10-03 08:35:39,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-03 08:35:39,407 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-03 08:35:39,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:39,413 INFO L225 Difference]: With dead ends: 1065 [2018-10-03 08:35:39,413 INFO L226 Difference]: Without dead ends: 1057 [2018-10-03 08:35:39,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-10-03 08:35:39,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2018-10-03 08:35:39,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 471. [2018-10-03 08:35:39,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-10-03 08:35:39,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1168 transitions. [2018-10-03 08:35:39,622 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1168 transitions. Word has length 12 [2018-10-03 08:35:39,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:39,622 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 1168 transitions. [2018-10-03 08:35:39,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 08:35:39,623 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1168 transitions. [2018-10-03 08:35:39,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:39,624 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:39,624 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:39,624 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:39,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:39,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1320340604, now seen corresponding path program 1 times [2018-10-03 08:35:39,625 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:39,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:39,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:39,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:39,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:39,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:39,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:39,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:39,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 08:35:39,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 08:35:39,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:35:39,713 INFO L87 Difference]: Start difference. First operand 471 states and 1168 transitions. Second operand 9 states. [2018-10-03 08:35:42,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:42,909 INFO L93 Difference]: Finished difference Result 1227 states and 2851 transitions. [2018-10-03 08:35:42,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-03 08:35:42,910 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-03 08:35:42,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:42,915 INFO L225 Difference]: With dead ends: 1227 [2018-10-03 08:35:42,915 INFO L226 Difference]: Without dead ends: 1219 [2018-10-03 08:35:42,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=365, Invalid=967, Unknown=0, NotChecked=0, Total=1332 [2018-10-03 08:35:42,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-10-03 08:35:43,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 438. [2018-10-03 08:35:43,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-10-03 08:35:43,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1072 transitions. [2018-10-03 08:35:43,130 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1072 transitions. Word has length 12 [2018-10-03 08:35:43,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:43,130 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 1072 transitions. [2018-10-03 08:35:43,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 08:35:43,130 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1072 transitions. [2018-10-03 08:35:43,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:43,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:43,131 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:43,131 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:43,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:43,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-10-03 08:35:43,132 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:43,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:43,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:43,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:43,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:43,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:43,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:43,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:43,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 08:35:43,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 08:35:43,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:35:43,216 INFO L87 Difference]: Start difference. First operand 438 states and 1072 transitions. Second operand 9 states. [2018-10-03 08:35:46,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:46,143 INFO L93 Difference]: Finished difference Result 1076 states and 2511 transitions. [2018-10-03 08:35:46,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-03 08:35:46,143 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-03 08:35:46,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:46,148 INFO L225 Difference]: With dead ends: 1076 [2018-10-03 08:35:46,149 INFO L226 Difference]: Without dead ends: 1068 [2018-10-03 08:35:46,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-10-03 08:35:46,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2018-10-03 08:35:46,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 445. [2018-10-03 08:35:46,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-10-03 08:35:46,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1088 transitions. [2018-10-03 08:35:46,377 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1088 transitions. Word has length 12 [2018-10-03 08:35:46,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:46,377 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 1088 transitions. [2018-10-03 08:35:46,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 08:35:46,377 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1088 transitions. [2018-10-03 08:35:46,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:46,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:46,378 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:46,378 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:46,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:46,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1838990990, now seen corresponding path program 1 times [2018-10-03 08:35:46,379 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:46,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:46,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:46,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:46,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:46,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:46,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:46,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:46,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 08:35:46,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 08:35:46,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:35:46,479 INFO L87 Difference]: Start difference. First operand 445 states and 1088 transitions. Second operand 9 states. [2018-10-03 08:35:49,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:49,066 INFO L93 Difference]: Finished difference Result 1111 states and 2606 transitions. [2018-10-03 08:35:49,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-03 08:35:49,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-03 08:35:49,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:49,072 INFO L225 Difference]: With dead ends: 1111 [2018-10-03 08:35:49,072 INFO L226 Difference]: Without dead ends: 1103 [2018-10-03 08:35:49,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-10-03 08:35:49,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2018-10-03 08:35:49,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 520. [2018-10-03 08:35:49,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-03 08:35:49,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1295 transitions. [2018-10-03 08:35:49,396 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1295 transitions. Word has length 12 [2018-10-03 08:35:49,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:49,396 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 1295 transitions. [2018-10-03 08:35:49,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 08:35:49,396 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1295 transitions. [2018-10-03 08:35:49,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:49,397 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:49,397 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:49,397 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:49,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:49,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1838888845, now seen corresponding path program 1 times [2018-10-03 08:35:49,397 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:49,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:49,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:49,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:49,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:49,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:49,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:49,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:49,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 08:35:49,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 08:35:49,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:35:49,620 INFO L87 Difference]: Start difference. First operand 520 states and 1295 transitions. Second operand 9 states. [2018-10-03 08:35:52,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:52,961 INFO L93 Difference]: Finished difference Result 1304 states and 3059 transitions. [2018-10-03 08:35:52,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-03 08:35:52,965 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-03 08:35:52,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:52,972 INFO L225 Difference]: With dead ends: 1304 [2018-10-03 08:35:52,972 INFO L226 Difference]: Without dead ends: 1296 [2018-10-03 08:35:52,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2018-10-03 08:35:52,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-10-03 08:35:53,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 487. [2018-10-03 08:35:53,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-10-03 08:35:53,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1199 transitions. [2018-10-03 08:35:53,317 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1199 transitions. Word has length 12 [2018-10-03 08:35:53,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:53,317 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 1199 transitions. [2018-10-03 08:35:53,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 08:35:53,318 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1199 transitions. [2018-10-03 08:35:53,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:53,318 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:53,318 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:53,319 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:53,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:53,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1731038698, now seen corresponding path program 1 times [2018-10-03 08:35:53,319 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:53,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:53,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:53,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:53,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:53,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:53,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:53,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:53,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 08:35:53,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 08:35:53,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:35:53,428 INFO L87 Difference]: Start difference. First operand 487 states and 1199 transitions. Second operand 9 states. [2018-10-03 08:35:57,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:57,265 INFO L93 Difference]: Finished difference Result 1370 states and 3217 transitions. [2018-10-03 08:35:57,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-03 08:35:57,266 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-03 08:35:57,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:57,273 INFO L225 Difference]: With dead ends: 1370 [2018-10-03 08:35:57,274 INFO L226 Difference]: Without dead ends: 1362 [2018-10-03 08:35:57,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2018-10-03 08:35:57,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2018-10-03 08:35:57,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 479. [2018-10-03 08:35:57,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-10-03 08:35:57,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1179 transitions. [2018-10-03 08:35:57,610 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1179 transitions. Word has length 12 [2018-10-03 08:35:57,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:57,610 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 1179 transitions. [2018-10-03 08:35:57,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 08:35:57,611 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1179 transitions. [2018-10-03 08:35:57,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:57,612 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:57,612 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:57,612 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:57,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:57,612 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-10-03 08:35:57,613 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:57,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:57,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:57,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:57,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:57,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:57,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:57,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:57,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 08:35:57,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 08:35:57,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:35:57,732 INFO L87 Difference]: Start difference. First operand 479 states and 1179 transitions. Second operand 9 states. [2018-10-03 08:36:00,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:00,668 INFO L93 Difference]: Finished difference Result 1298 states and 3068 transitions. [2018-10-03 08:36:00,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-03 08:36:00,669 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-03 08:36:00,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:00,673 INFO L225 Difference]: With dead ends: 1298 [2018-10-03 08:36:00,673 INFO L226 Difference]: Without dead ends: 1290 [2018-10-03 08:36:00,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-10-03 08:36:00,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-10-03 08:36:01,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 602. [2018-10-03 08:36:01,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-10-03 08:36:01,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-10-03 08:36:01,132 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-10-03 08:36:01,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:01,132 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-10-03 08:36:01,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 08:36:01,132 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-10-03 08:36:01,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-03 08:36:01,133 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:01,133 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:01,133 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:01,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:01,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1080362888, now seen corresponding path program 1 times [2018-10-03 08:36:01,134 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:01,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:01,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:01,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:01,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:01,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:01,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:36:01,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-03 08:36:01,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-03 08:36:01,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-03 08:36:01,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-03 08:36:01,200 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-10-03 08:36:02,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:02,100 INFO L93 Difference]: Finished difference Result 1242 states and 3091 transitions. [2018-10-03 08:36:02,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-03 08:36:02,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-03 08:36:02,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:02,103 INFO L225 Difference]: With dead ends: 1242 [2018-10-03 08:36:02,103 INFO L226 Difference]: Without dead ends: 673 [2018-10-03 08:36:02,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-03 08:36:02,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-10-03 08:36:02,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 612. [2018-10-03 08:36:02,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-10-03 08:36:02,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1463 transitions. [2018-10-03 08:36:02,548 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1463 transitions. Word has length 13 [2018-10-03 08:36:02,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:02,548 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 1463 transitions. [2018-10-03 08:36:02,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-03 08:36:02,548 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1463 transitions. [2018-10-03 08:36:02,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-03 08:36:02,549 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:02,549 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:02,550 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:02,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:02,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1652407871, now seen corresponding path program 1 times [2018-10-03 08:36:02,550 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:02,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:02,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:02,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:02,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:02,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:02,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:36:02,677 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:36:02,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:02,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:36:03,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:03,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:36:03,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-10-03 08:36:03,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-03 08:36:03,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-03 08:36:03,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-03 08:36:03,910 INFO L87 Difference]: Start difference. First operand 612 states and 1463 transitions. Second operand 16 states. [2018-10-03 08:36:08,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:08,062 INFO L93 Difference]: Finished difference Result 854 states and 1987 transitions. [2018-10-03 08:36:08,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-03 08:36:08,062 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-10-03 08:36:08,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:08,065 INFO L225 Difference]: With dead ends: 854 [2018-10-03 08:36:08,065 INFO L226 Difference]: Without dead ends: 849 [2018-10-03 08:36:08,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-10-03 08:36:08,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-10-03 08:36:09,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 690. [2018-10-03 08:36:09,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-10-03 08:36:09,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1639 transitions. [2018-10-03 08:36:09,040 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1639 transitions. Word has length 13 [2018-10-03 08:36:09,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:09,040 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1639 transitions. [2018-10-03 08:36:09,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-03 08:36:09,040 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1639 transitions. [2018-10-03 08:36:09,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-03 08:36:09,041 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:09,041 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:09,042 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:09,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:09,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1456173380, now seen corresponding path program 1 times [2018-10-03 08:36:09,042 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:09,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:09,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:09,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:09,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:09,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:09,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:36:09,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-03 08:36:09,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-03 08:36:09,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-03 08:36:09,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-03 08:36:09,096 INFO L87 Difference]: Start difference. First operand 690 states and 1639 transitions. Second operand 5 states. [2018-10-03 08:36:10,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:10,046 INFO L93 Difference]: Finished difference Result 1308 states and 3113 transitions. [2018-10-03 08:36:10,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-03 08:36:10,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-03 08:36:10,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:10,048 INFO L225 Difference]: With dead ends: 1308 [2018-10-03 08:36:10,048 INFO L226 Difference]: Without dead ends: 709 [2018-10-03 08:36:10,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-03 08:36:10,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-10-03 08:36:10,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 690. [2018-10-03 08:36:10,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-10-03 08:36:10,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-10-03 08:36:10,734 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-10-03 08:36:10,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:10,735 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-10-03 08:36:10,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-03 08:36:10,735 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-10-03 08:36:10,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:36:10,735 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:10,735 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:10,736 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:10,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:10,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1952744875, now seen corresponding path program 1 times [2018-10-03 08:36:10,736 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:10,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:10,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:10,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:10,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:11,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:11,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:36:11,393 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:36:11,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:11,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:11,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:36:11,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:11,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:36:11,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-03 08:36:11,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-03 08:36:11,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-03 08:36:11,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-10-03 08:36:11,586 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 17 states. [2018-10-03 08:36:19,247 WARN L178 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-10-03 08:36:24,665 WARN L178 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-10-03 08:36:28,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:28,182 INFO L93 Difference]: Finished difference Result 2011 states and 4412 transitions. [2018-10-03 08:36:28,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-10-03 08:36:28,182 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-03 08:36:28,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:28,185 INFO L225 Difference]: With dead ends: 2011 [2018-10-03 08:36:28,185 INFO L226 Difference]: Without dead ends: 2003 [2018-10-03 08:36:28,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9561 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=3074, Invalid=22366, Unknown=0, NotChecked=0, Total=25440 [2018-10-03 08:36:28,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2018-10-03 08:36:29,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1151. [2018-10-03 08:36:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-10-03 08:36:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 2622 transitions. [2018-10-03 08:36:29,364 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 2622 transitions. Word has length 16 [2018-10-03 08:36:29,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:29,364 INFO L480 AbstractCegarLoop]: Abstraction has 1151 states and 2622 transitions. [2018-10-03 08:36:29,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-03 08:36:29,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 2622 transitions. [2018-10-03 08:36:29,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:36:29,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:29,366 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:29,366 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:29,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:29,367 INFO L82 PathProgramCache]: Analyzing trace with hash -51223093, now seen corresponding path program 1 times [2018-10-03 08:36:29,367 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:29,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:29,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:29,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:29,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:29,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:29,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:36:29,455 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:36:29,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:29,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:36:29,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:29,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:36:29,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-03 08:36:29,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-03 08:36:29,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-03 08:36:29,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-10-03 08:36:29,678 INFO L87 Difference]: Start difference. First operand 1151 states and 2622 transitions. Second operand 17 states. [2018-10-03 08:36:42,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:42,737 INFO L93 Difference]: Finished difference Result 2797 states and 6168 transitions. [2018-10-03 08:36:42,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-03 08:36:42,738 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-03 08:36:42,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:42,744 INFO L225 Difference]: With dead ends: 2797 [2018-10-03 08:36:42,744 INFO L226 Difference]: Without dead ends: 2789 [2018-10-03 08:36:42,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6171 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2430, Invalid=14862, Unknown=0, NotChecked=0, Total=17292 [2018-10-03 08:36:42,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2789 states. [2018-10-03 08:36:44,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2789 to 1186. [2018-10-03 08:36:44,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2018-10-03 08:36:44,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 2705 transitions. [2018-10-03 08:36:44,218 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 2705 transitions. Word has length 16 [2018-10-03 08:36:44,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:44,218 INFO L480 AbstractCegarLoop]: Abstraction has 1186 states and 2705 transitions. [2018-10-03 08:36:44,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-03 08:36:44,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 2705 transitions. [2018-10-03 08:36:44,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:36:44,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:44,220 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:44,221 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:44,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:44,221 INFO L82 PathProgramCache]: Analyzing trace with hash -666637335, now seen corresponding path program 1 times [2018-10-03 08:36:44,221 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:44,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:44,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:44,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:44,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:44,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:44,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:36:44,465 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:36:44,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:44,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:36:44,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:44,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:36:44,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-03 08:36:44,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-03 08:36:44,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-03 08:36:44,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-10-03 08:36:44,754 INFO L87 Difference]: Start difference. First operand 1186 states and 2705 transitions. Second operand 17 states. [2018-10-03 08:36:56,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:56,635 INFO L93 Difference]: Finished difference Result 2492 states and 5544 transitions. [2018-10-03 08:36:56,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-10-03 08:36:56,635 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-03 08:36:56,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:56,643 INFO L225 Difference]: With dead ends: 2492 [2018-10-03 08:36:56,643 INFO L226 Difference]: Without dead ends: 2484 [2018-10-03 08:36:56,647 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4610 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1718, Invalid=11392, Unknown=0, NotChecked=0, Total=13110 [2018-10-03 08:36:56,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2018-10-03 08:36:58,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 1219. [2018-10-03 08:36:58,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1219 states. [2018-10-03 08:36:58,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 2792 transitions. [2018-10-03 08:36:58,020 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 2792 transitions. Word has length 16 [2018-10-03 08:36:58,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:58,020 INFO L480 AbstractCegarLoop]: Abstraction has 1219 states and 2792 transitions. [2018-10-03 08:36:58,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-03 08:36:58,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 2792 transitions. [2018-10-03 08:36:58,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:36:58,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:58,021 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:58,022 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:58,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:58,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1212722005, now seen corresponding path program 1 times [2018-10-03 08:36:58,022 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:58,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:58,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:58,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:58,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:58,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:58,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:36:58,124 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:36:58,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:58,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:36:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:58,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-03 08:36:58,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2018-10-03 08:36:58,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-03 08:36:58,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-03 08:36:58,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-10-03 08:36:58,335 INFO L87 Difference]: Start difference. First operand 1219 states and 2792 transitions. Second operand 17 states. [2018-10-03 08:37:15,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:37:15,073 INFO L93 Difference]: Finished difference Result 3178 states and 7226 transitions. [2018-10-03 08:37:15,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-10-03 08:37:15,074 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-03 08:37:15,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:37:15,082 INFO L225 Difference]: With dead ends: 3178 [2018-10-03 08:37:15,083 INFO L226 Difference]: Without dead ends: 3170 [2018-10-03 08:37:15,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9560 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2932, Invalid=21248, Unknown=0, NotChecked=0, Total=24180 [2018-10-03 08:37:15,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2018-10-03 08:37:16,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 1242. [2018-10-03 08:37:16,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1242 states. [2018-10-03 08:37:16,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 2857 transitions. [2018-10-03 08:37:16,461 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 2857 transitions. Word has length 16 [2018-10-03 08:37:16,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:37:16,461 INFO L480 AbstractCegarLoop]: Abstraction has 1242 states and 2857 transitions. [2018-10-03 08:37:16,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-03 08:37:16,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 2857 transitions. [2018-10-03 08:37:16,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:37:16,462 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:37:16,462 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:37:16,462 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:37:16,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:37:16,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1212619860, now seen corresponding path program 1 times [2018-10-03 08:37:16,463 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:37:16,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:37:16,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:16,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:37:16,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:37:16,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:37:16,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:37:16,621 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:37:16,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:37:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:37:16,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:37:16,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:37:16,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-03 08:37:16,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2018-10-03 08:37:16,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-03 08:37:16,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-03 08:37:16,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-10-03 08:37:16,828 INFO L87 Difference]: Start difference. First operand 1242 states and 2857 transitions. Second operand 17 states. [2018-10-03 08:37:30,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:37:30,154 INFO L93 Difference]: Finished difference Result 2638 states and 5927 transitions. [2018-10-03 08:37:30,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-10-03 08:37:30,156 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-03 08:37:30,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:37:30,161 INFO L225 Difference]: With dead ends: 2638 [2018-10-03 08:37:30,161 INFO L226 Difference]: Without dead ends: 2630 [2018-10-03 08:37:30,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5685 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1807, Invalid=13199, Unknown=0, NotChecked=0, Total=15006 [2018-10-03 08:37:30,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2018-10-03 08:37:31,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 1469. [2018-10-03 08:37:31,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2018-10-03 08:37:31,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 3433 transitions. [2018-10-03 08:37:31,809 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 3433 transitions. Word has length 16 [2018-10-03 08:37:31,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:37:31,810 INFO L480 AbstractCegarLoop]: Abstraction has 1469 states and 3433 transitions. [2018-10-03 08:37:31,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-03 08:37:31,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 3433 transitions. [2018-10-03 08:37:31,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:37:31,811 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:37:31,811 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:37:31,812 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:37:31,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:37:31,812 INFO L82 PathProgramCache]: Analyzing trace with hash 780585054, now seen corresponding path program 1 times [2018-10-03 08:37:31,812 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:37:31,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:37:31,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:31,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:37:31,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:37:31,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:37:31,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:37:31,990 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:37:32,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:37:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:37:32,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:37:32,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:37:32,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:37:32,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-03 08:37:32,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-03 08:37:32,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-03 08:37:32,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-10-03 08:37:32,178 INFO L87 Difference]: Start difference. First operand 1469 states and 3433 transitions. Second operand 17 states. [2018-10-03 08:37:45,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:37:45,607 INFO L93 Difference]: Finished difference Result 2854 states and 6510 transitions. [2018-10-03 08:37:45,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-03 08:37:45,608 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-03 08:37:45,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:37:45,612 INFO L225 Difference]: With dead ends: 2854 [2018-10-03 08:37:45,613 INFO L226 Difference]: Without dead ends: 2846 [2018-10-03 08:37:45,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1456, Invalid=7664, Unknown=0, NotChecked=0, Total=9120 [2018-10-03 08:37:45,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2846 states. [2018-10-03 08:37:47,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2846 to 1479. [2018-10-03 08:37:47,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1479 states. [2018-10-03 08:37:47,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 3457 transitions. [2018-10-03 08:37:47,368 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 3457 transitions. Word has length 16 [2018-10-03 08:37:47,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:37:47,368 INFO L480 AbstractCegarLoop]: Abstraction has 1479 states and 3457 transitions. [2018-10-03 08:37:47,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-03 08:37:47,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 3457 transitions. [2018-10-03 08:37:47,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:37:47,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:37:47,369 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:37:47,369 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:37:47,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:37:47,370 INFO L82 PathProgramCache]: Analyzing trace with hash 165170812, now seen corresponding path program 1 times [2018-10-03 08:37:47,370 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:37:47,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:37:47,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:47,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:37:47,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:37:48,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:37:48,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:37:48,000 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:37:48,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:37:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:37:48,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:37:48,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:37:48,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:37:48,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-03 08:37:48,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-03 08:37:48,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-03 08:37:48,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-10-03 08:37:48,197 INFO L87 Difference]: Start difference. First operand 1479 states and 3457 transitions. Second operand 17 states. [2018-10-03 08:38:03,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:38:03,582 INFO L93 Difference]: Finished difference Result 3363 states and 7697 transitions. [2018-10-03 08:38:03,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-03 08:38:03,582 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-03 08:38:03,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:38:03,586 INFO L225 Difference]: With dead ends: 3363 [2018-10-03 08:38:03,586 INFO L226 Difference]: Without dead ends: 3355 [2018-10-03 08:38:03,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3712 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1635, Invalid=9495, Unknown=0, NotChecked=0, Total=11130 [2018-10-03 08:38:03,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2018-10-03 08:38:05,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 1535. [2018-10-03 08:38:05,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states. [2018-10-03 08:38:05,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 3580 transitions. [2018-10-03 08:38:05,304 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 3580 transitions. Word has length 16 [2018-10-03 08:38:05,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:38:05,304 INFO L480 AbstractCegarLoop]: Abstraction has 1535 states and 3580 transitions. [2018-10-03 08:38:05,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-03 08:38:05,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 3580 transitions. [2018-10-03 08:38:05,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:38:05,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:38:05,305 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:38:05,306 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:38:05,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:38:05,306 INFO L82 PathProgramCache]: Analyzing trace with hash 723989304, now seen corresponding path program 1 times [2018-10-03 08:38:05,306 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:38:05,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:38:05,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:38:05,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:38:05,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:38:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:38:05,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:38:05,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:38:05,427 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:38:05,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:38:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:38:05,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:38:05,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:38:05,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:38:05,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2018-10-03 08:38:05,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-03 08:38:05,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-03 08:38:05,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-10-03 08:38:05,594 INFO L87 Difference]: Start difference. First operand 1535 states and 3580 transitions. Second operand 18 states. [2018-10-03 08:38:22,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:38:22,363 INFO L93 Difference]: Finished difference Result 2910 states and 6684 transitions. [2018-10-03 08:38:22,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-03 08:38:22,363 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16 [2018-10-03 08:38:22,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:38:22,368 INFO L225 Difference]: With dead ends: 2910 [2018-10-03 08:38:22,368 INFO L226 Difference]: Without dead ends: 2902 [2018-10-03 08:38:22,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3369 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1407, Invalid=8693, Unknown=0, NotChecked=0, Total=10100 [2018-10-03 08:38:22,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2018-10-03 08:38:23,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 1226. [2018-10-03 08:38:23,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-10-03 08:38:23,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 2816 transitions. [2018-10-03 08:38:23,845 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 2816 transitions. Word has length 16 [2018-10-03 08:38:23,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:38:23,845 INFO L480 AbstractCegarLoop]: Abstraction has 1226 states and 2816 transitions. [2018-10-03 08:38:23,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-03 08:38:23,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 2816 transitions. [2018-10-03 08:38:23,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:38:23,845 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:38:23,846 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:38:23,846 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:38:23,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:38:23,846 INFO L82 PathProgramCache]: Analyzing trace with hash 876461633, now seen corresponding path program 1 times [2018-10-03 08:38:23,846 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:38:23,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:38:23,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:38:23,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:38:23,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:38:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:38:23,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:38:23,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:38:23,941 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:38:23,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:38:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:38:23,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:38:24,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:38:24,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:38:24,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-03 08:38:24,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-03 08:38:24,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-03 08:38:24,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-10-03 08:38:24,301 INFO L87 Difference]: Start difference. First operand 1226 states and 2816 transitions. Second operand 17 states. [2018-10-03 08:38:38,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:38:38,299 INFO L93 Difference]: Finished difference Result 2474 states and 5593 transitions. [2018-10-03 08:38:38,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-03 08:38:38,300 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-03 08:38:38,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:38:38,303 INFO L225 Difference]: With dead ends: 2474 [2018-10-03 08:38:38,303 INFO L226 Difference]: Without dead ends: 2466 [2018-10-03 08:38:38,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2722 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1240, Invalid=6950, Unknown=0, NotChecked=0, Total=8190 [2018-10-03 08:38:38,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states. [2018-10-03 08:38:39,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 1069. [2018-10-03 08:38:39,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2018-10-03 08:38:39,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 2444 transitions. [2018-10-03 08:38:39,623 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 2444 transitions. Word has length 16 [2018-10-03 08:38:39,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:38:39,623 INFO L480 AbstractCegarLoop]: Abstraction has 1069 states and 2444 transitions. [2018-10-03 08:38:39,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-03 08:38:39,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 2444 transitions. [2018-10-03 08:38:39,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:38:39,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:38:39,624 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:38:39,624 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:38:39,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:38:39,624 INFO L82 PathProgramCache]: Analyzing trace with hash -345007351, now seen corresponding path program 1 times [2018-10-03 08:38:39,625 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:38:39,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:38:39,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:38:39,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:38:39,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:38:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:38:39,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:38:39,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:38:39,689 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:38:39,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:38:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:38:39,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:38:39,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:38:39,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:38:39,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-03 08:38:39,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:38:39,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:38:39,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:38:39,728 INFO L87 Difference]: Start difference. First operand 1069 states and 2444 transitions. Second operand 8 states. [2018-10-03 08:38:43,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:38:43,338 INFO L93 Difference]: Finished difference Result 1522 states and 3375 transitions. [2018-10-03 08:38:43,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-03 08:38:43,338 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-03 08:38:43,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:38:43,340 INFO L225 Difference]: With dead ends: 1522 [2018-10-03 08:38:43,340 INFO L226 Difference]: Without dead ends: 1514 [2018-10-03 08:38:43,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-10-03 08:38:43,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2018-10-03 08:38:44,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1225. [2018-10-03 08:38:44,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-10-03 08:38:44,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 2809 transitions. [2018-10-03 08:38:44,980 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 2809 transitions. Word has length 16 [2018-10-03 08:38:44,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:38:44,980 INFO L480 AbstractCegarLoop]: Abstraction has 1225 states and 2809 transitions. [2018-10-03 08:38:44,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:38:44,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 2809 transitions. [2018-10-03 08:38:44,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:38:44,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:38:44,981 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:38:44,982 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:38:44,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:38:44,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521947, now seen corresponding path program 1 times [2018-10-03 08:38:44,982 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:38:44,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:38:44,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:38:44,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:38:44,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:38:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:38:45,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:38:45,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:38:45,102 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:38:45,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:38:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:38:45,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:38:45,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:38:45,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:38:45,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-03 08:38:45,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:38:45,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:38:45,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:38:45,165 INFO L87 Difference]: Start difference. First operand 1225 states and 2809 transitions. Second operand 8 states. [2018-10-03 08:38:49,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:38:49,129 INFO L93 Difference]: Finished difference Result 1661 states and 3674 transitions. [2018-10-03 08:38:49,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-03 08:38:49,130 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-03 08:38:49,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:38:49,132 INFO L225 Difference]: With dead ends: 1661 [2018-10-03 08:38:49,132 INFO L226 Difference]: Without dead ends: 1653 [2018-10-03 08:38:49,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-10-03 08:38:49,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2018-10-03 08:38:50,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1237. [2018-10-03 08:38:50,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2018-10-03 08:38:50,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 2833 transitions. [2018-10-03 08:38:50,617 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 2833 transitions. Word has length 16 [2018-10-03 08:38:50,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:38:50,617 INFO L480 AbstractCegarLoop]: Abstraction has 1237 states and 2833 transitions. [2018-10-03 08:38:50,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:38:50,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 2833 transitions. [2018-10-03 08:38:50,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:38:50,618 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:38:50,618 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:38:50,618 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:38:50,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:38:50,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521668, now seen corresponding path program 1 times [2018-10-03 08:38:50,618 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:38:50,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:38:50,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:38:50,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:38:50,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:38:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:38:50,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:38:50,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:38:50,777 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:38:50,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:38:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:38:50,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:38:50,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:38:50,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:38:50,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-03 08:38:50,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:38:50,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:38:50,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:38:50,816 INFO L87 Difference]: Start difference. First operand 1237 states and 2833 transitions. Second operand 8 states. [2018-10-03 08:38:55,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:38:55,596 INFO L93 Difference]: Finished difference Result 1772 states and 3936 transitions. [2018-10-03 08:38:55,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-03 08:38:55,596 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-03 08:38:55,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:38:55,598 INFO L225 Difference]: With dead ends: 1772 [2018-10-03 08:38:55,598 INFO L226 Difference]: Without dead ends: 1764 [2018-10-03 08:38:55,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-10-03 08:38:55,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2018-10-03 08:38:57,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1318. [2018-10-03 08:38:57,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1318 states. [2018-10-03 08:38:57,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 3019 transitions. [2018-10-03 08:38:57,257 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 3019 transitions. Word has length 16 [2018-10-03 08:38:57,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:38:57,257 INFO L480 AbstractCegarLoop]: Abstraction has 1318 states and 3019 transitions. [2018-10-03 08:38:57,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:38:57,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 3019 transitions. [2018-10-03 08:38:57,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:38:57,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:38:57,258 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:38:57,258 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:38:57,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:38:57,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1133346772, now seen corresponding path program 1 times [2018-10-03 08:38:57,258 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:38:57,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:38:57,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:38:57,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:38:57,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:38:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:38:57,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:38:57,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:38:57,352 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:38:57,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:38:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:38:57,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:38:57,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:38:57,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:38:57,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-03 08:38:57,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:38:57,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:38:57,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:38:57,390 INFO L87 Difference]: Start difference. First operand 1318 states and 3019 transitions. Second operand 8 states. [2018-10-03 08:39:01,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:39:01,539 INFO L93 Difference]: Finished difference Result 1789 states and 3956 transitions. [2018-10-03 08:39:01,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-03 08:39:01,539 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-03 08:39:01,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:39:01,541 INFO L225 Difference]: With dead ends: 1789 [2018-10-03 08:39:01,541 INFO L226 Difference]: Without dead ends: 1781 [2018-10-03 08:39:01,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-10-03 08:39:01,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2018-10-03 08:39:03,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1345. [2018-10-03 08:39:03,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states. [2018-10-03 08:39:03,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 3076 transitions. [2018-10-03 08:39:03,206 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 3076 transitions. Word has length 16 [2018-10-03 08:39:03,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:39:03,206 INFO L480 AbstractCegarLoop]: Abstraction has 1345 states and 3076 transitions. [2018-10-03 08:39:03,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:39:03,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 3076 transitions. [2018-10-03 08:39:03,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:39:03,207 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:39:03,207 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:39:03,207 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:39:03,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:39:03,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1133347051, now seen corresponding path program 1 times [2018-10-03 08:39:03,207 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:39:03,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:39:03,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:39:03,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:39:03,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:39:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:39:03,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:39:03,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:39:03,282 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:39:03,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:39:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:39:03,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:39:03,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:39:03,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:39:03,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-03 08:39:03,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:39:03,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:39:03,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:39:03,325 INFO L87 Difference]: Start difference. First operand 1345 states and 3076 transitions. Second operand 8 states. Received shutdown request... [2018-10-03 08:39:03,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-03 08:39:03,991 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-03 08:39:03,996 WARN L205 ceAbstractionStarter]: Timeout [2018-10-03 08:39:03,997 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 08:39:03 BoogieIcfgContainer [2018-10-03 08:39:03,997 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-03 08:39:03,998 INFO L168 Benchmark]: Toolchain (without parser) took 252519.56 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 410.0 MB). Free memory was 1.4 GB in the beginning and 826.0 MB in the end (delta: 622.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-10-03 08:39:03,999 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 08:39:03,999 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 08:39:04,000 INFO L168 Benchmark]: Boogie Preprocessor took 62.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 08:39:04,000 INFO L168 Benchmark]: RCFGBuilder took 921.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-03 08:39:04,001 INFO L168 Benchmark]: TraceAbstraction took 251475.40 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 410.0 MB). Free memory was 1.4 GB in the beginning and 826.0 MB in the end (delta: 591.2 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-10-03 08:39:04,006 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 54.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 921.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 251475.40 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 410.0 MB). Free memory was 1.4 GB in the beginning and 826.0 MB in the end (delta: 591.2 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 277]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 277). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (130 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 229]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 229). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (130 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 332]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 332). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (130 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 240]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 240). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (130 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 294]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 294). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (130 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 364]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 364). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (130 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 264]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 264). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (130 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 205]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 205). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (130 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 284]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 284). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (130 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 250]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 250). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (130 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 154). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (130 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 54). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (130 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 222]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 222). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (130 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 247]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 247). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 7 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (130 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 251.4s OverallTime, 41 OverallIterations, 2 TraceHistogramMax, 215.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12133 SDtfs, 40709 SDslu, 48695 SDs, 0 SdLazy, 118150 SolverSat, 8810 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 107.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2026 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 1710 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 51475 ImplicationChecksByTransitivity, 40.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1535occurred in iteration=34, 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: 25.5s AutomataMinimizationTime, 40 MinimizatonAttempts, 26535 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 772 NumberOfCodeBlocks, 772 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 716 ConstructedInterpolants, 78 QuantifiedInterpolants, 46500 SizeOfPredicates, 88 NumberOfNonLiveVariables, 595 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 56 InterpolantComputations, 28 PerfectInterpolantSequences, 40/83 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_out.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-03_08-39-04-017.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-03_08-39-04-017.csv Completed graceful shutdown