java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:24:42,256 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:24:42,258 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:24:42,274 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:24:42,275 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:24:42,276 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:24:42,279 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:24:42,282 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:24:42,283 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:24:42,284 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:24:42,285 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:24:42,286 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:24:42,287 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:24:42,288 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:24:42,289 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:24:42,290 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:24:42,291 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:24:42,293 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:24:42,295 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:24:42,297 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:24:42,298 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:24:42,299 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:24:42,302 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:24:42,302 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:24:42,302 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:24:42,303 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:24:42,305 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:24:42,305 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:24:42,306 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:24:42,307 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:24:42,308 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:24:42,308 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:24:42,309 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:24:42,309 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:24:42,310 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:24:42,311 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:24:42,311 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-01 00:24:42,338 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:24:42,338 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:24:42,339 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:24:42,340 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:24:42,340 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:24:42,341 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:24:42,341 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:24:42,341 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:24:42,341 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:24:42,341 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:24:42,342 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:24:42,342 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:24:42,342 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:24:42,342 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:24:42,343 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:24:42,344 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:24:42,344 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:24:42,344 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:24:42,344 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:24:42,345 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:24:42,345 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:24:42,345 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:24:42,345 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:24:42,346 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:24:42,347 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:24:42,347 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:24:42,347 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:24:42,347 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:24:42,347 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:24:42,348 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:24:42,348 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:24:42,427 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:24:42,444 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:24:42,450 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:24:42,452 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:24:42,453 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:24:42,454 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-01 00:24:42,454 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl' [2018-10-01 00:24:42,555 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:24:42,561 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:24:42,562 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:24:42,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:24:42,563 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:24:42,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:42" (1/1) ... [2018-10-01 00:24:42,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:42" (1/1) ... [2018-10-01 00:24:42,615 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-01 00:24:42,615 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-01 00:24:42,616 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-01 00:24:42,618 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:24:42,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:24:42,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:24:42,619 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:24:42,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:42" (1/1) ... [2018-10-01 00:24:42,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:42" (1/1) ... [2018-10-01 00:24:42,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:42" (1/1) ... [2018-10-01 00:24:42,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:42" (1/1) ... [2018-10-01 00:24:42,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:42" (1/1) ... [2018-10-01 00:24:42,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:42" (1/1) ... [2018-10-01 00:24:42,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:42" (1/1) ... [2018-10-01 00:24:42,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:24:42,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:24:42,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:24:42,678 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:24:42,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:24:42,757 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-01 00:24:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-01 00:24:42,758 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-01 00:24:43,534 INFO L345 CfgBuilder]: Using library mode [2018-10-01 00:24:43,535 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:24:43 BoogieIcfgContainer [2018-10-01 00:24:43,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:24:43,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:24:43,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:24:43,540 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:24:43,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:42" (1/2) ... [2018-10-01 00:24:43,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f082505 and model type threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:24:43, skipping insertion in model container [2018-10-01 00:24:43,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:24:43" (2/2) ... [2018-10-01 00:24:43,544 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out.bpl [2018-10-01 00:24:43,554 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:24:43,563 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-10-01 00:24:43,618 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:24:43,619 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:24:43,620 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:24:43,620 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:24:43,620 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:24:43,620 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:24:43,620 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:24:43,620 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:24:43,621 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:24:43,641 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-10-01 00:24:43,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-01 00:24:43,648 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:43,649 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:24:43,651 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:43,658 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:43,659 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-10-01 00:24:43,661 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:43,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:43,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:43,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:43,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:43,929 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:43,929 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:24:43,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-01 00:24:43,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-01 00:24:43,947 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:43,949 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-10-01 00:24:47,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:47,352 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-10-01 00:24:47,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 00:24:47,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-01 00:24:47,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:47,391 INFO L225 Difference]: With dead ends: 163 [2018-10-01 00:24:47,391 INFO L226 Difference]: Without dead ends: 158 [2018-10-01 00:24:47,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:24:47,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-01 00:24:47,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-10-01 00:24:47,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-01 00:24:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-10-01 00:24:47,456 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-10-01 00:24:47,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:47,457 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-10-01 00:24:47,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-01 00:24:47,457 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-10-01 00:24:47,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-01 00:24:47,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:47,459 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:24:47,460 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:47,460 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:47,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-10-01 00:24:47,460 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:47,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:47,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:47,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:47,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:47,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:47,541 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:47,541 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:24:47,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-01 00:24:47,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-01 00:24:47,544 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:47,544 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-10-01 00:24:49,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:49,878 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-10-01 00:24:49,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 00:24:49,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-01 00:24:49,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:49,885 INFO L225 Difference]: With dead ends: 188 [2018-10-01 00:24:49,885 INFO L226 Difference]: Without dead ends: 183 [2018-10-01 00:24:49,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:24:49,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-01 00:24:49,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-10-01 00:24:49,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-01 00:24:49,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-10-01 00:24:49,937 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-10-01 00:24:49,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:49,938 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-10-01 00:24:49,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-01 00:24:49,938 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-10-01 00:24:49,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:24:49,939 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:49,939 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:24:49,940 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:49,940 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:49,941 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-10-01 00:24:49,941 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:49,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:49,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:49,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:49,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:50,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:50,041 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:50,041 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-01 00:24:50,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:24:50,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:24:50,042 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:50,042 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-10-01 00:24:54,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:54,346 INFO L93 Difference]: Finished difference Result 361 states and 808 transitions. [2018-10-01 00:24:54,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:24:54,347 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-10-01 00:24:54,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:54,351 INFO L225 Difference]: With dead ends: 361 [2018-10-01 00:24:54,352 INFO L226 Difference]: Without dead ends: 349 [2018-10-01 00:24:54,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:24:54,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-10-01 00:24:54,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 174. [2018-10-01 00:24:54,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-10-01 00:24:54,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 387 transitions. [2018-10-01 00:24:54,387 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 387 transitions. Word has length 9 [2018-10-01 00:24:54,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:54,387 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 387 transitions. [2018-10-01 00:24:54,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:24:54,387 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 387 transitions. [2018-10-01 00:24:54,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:24:54,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:54,389 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:24:54,389 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:54,390 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:54,390 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-10-01 00:24:54,390 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:54,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:54,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:54,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:54,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:54,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:54,493 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:54,493 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-01 00:24:54,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:24:54,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:24:54,494 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:54,494 INFO L87 Difference]: Start difference. First operand 174 states and 387 transitions. Second operand 7 states. [2018-10-01 00:24:57,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:57,846 INFO L93 Difference]: Finished difference Result 307 states and 694 transitions. [2018-10-01 00:24:57,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-01 00:24:57,846 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-10-01 00:24:57,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:57,851 INFO L225 Difference]: With dead ends: 307 [2018-10-01 00:24:57,851 INFO L226 Difference]: Without dead ends: 302 [2018-10-01 00:24:57,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:24:57,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-01 00:24:57,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 203. [2018-10-01 00:24:57,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-01 00:24:57,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-10-01 00:24:57,900 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-10-01 00:24:57,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:57,900 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-10-01 00:24:57,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:24:57,901 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-10-01 00:24:57,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:24:57,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:57,903 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:24:57,903 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:57,904 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:57,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-10-01 00:24:57,904 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:57,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:57,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:57,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:57,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:58,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:58,268 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:58,268 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:24:58,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:24:58,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:24:58,269 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:58,269 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 8 states. [2018-10-01 00:25:06,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:06,038 INFO L93 Difference]: Finished difference Result 741 states and 1656 transitions. [2018-10-01 00:25:06,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-01 00:25:06,039 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-01 00:25:06,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:06,045 INFO L225 Difference]: With dead ends: 741 [2018-10-01 00:25:06,045 INFO L226 Difference]: Without dead ends: 733 [2018-10-01 00:25:06,046 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:25:06,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-10-01 00:25:06,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 315. [2018-10-01 00:25:06,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-01 00:25:06,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 743 transitions. [2018-10-01 00:25:06,098 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 743 transitions. Word has length 12 [2018-10-01 00:25:06,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:06,099 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 743 transitions. [2018-10-01 00:25:06,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:25:06,099 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 743 transitions. [2018-10-01 00:25:06,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:25:06,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:06,101 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:06,102 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:06,102 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:06,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-10-01 00:25:06,102 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:06,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:06,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:06,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:06,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:06,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:06,185 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:25:06,186 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:25:06,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:25:06,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:25:06,187 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:06,187 INFO L87 Difference]: Start difference. First operand 315 states and 743 transitions. Second operand 8 states. [2018-10-01 00:25:15,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:15,379 INFO L93 Difference]: Finished difference Result 797 states and 1784 transitions. [2018-10-01 00:25:15,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-01 00:25:15,379 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-01 00:25:15,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:15,385 INFO L225 Difference]: With dead ends: 797 [2018-10-01 00:25:15,386 INFO L226 Difference]: Without dead ends: 789 [2018-10-01 00:25:15,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:25:15,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-10-01 00:25:15,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 319. [2018-10-01 00:25:15,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-10-01 00:25:15,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 751 transitions. [2018-10-01 00:25:15,445 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 751 transitions. Word has length 12 [2018-10-01 00:25:15,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:15,445 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 751 transitions. [2018-10-01 00:25:15,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:25:15,446 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 751 transitions. [2018-10-01 00:25:15,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:25:15,447 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:15,447 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:15,448 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:15,448 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:15,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-10-01 00:25:15,449 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:15,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:15,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:15,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:15,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:15,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:15,683 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:25:15,683 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:25:15,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:25:15,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:25:15,684 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:15,684 INFO L87 Difference]: Start difference. First operand 319 states and 751 transitions. Second operand 8 states. [2018-10-01 00:25:22,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:22,472 INFO L93 Difference]: Finished difference Result 684 states and 1538 transitions. [2018-10-01 00:25:22,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-01 00:25:22,472 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-01 00:25:22,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:22,478 INFO L225 Difference]: With dead ends: 684 [2018-10-01 00:25:22,478 INFO L226 Difference]: Without dead ends: 676 [2018-10-01 00:25:22,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:25:22,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-10-01 00:25:22,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 330. [2018-10-01 00:25:22,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-10-01 00:25:22,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 778 transitions. [2018-10-01 00:25:22,542 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 778 transitions. Word has length 12 [2018-10-01 00:25:22,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:22,543 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 778 transitions. [2018-10-01 00:25:22,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:25:22,543 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 778 transitions. [2018-10-01 00:25:22,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:25:22,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:22,544 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:22,544 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:22,545 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:22,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-10-01 00:25:22,545 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:22,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:22,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:22,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:22,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:22,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:22,779 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:25:22,780 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:25:22,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:25:22,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:25:22,781 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:22,781 INFO L87 Difference]: Start difference. First operand 330 states and 778 transitions. Second operand 8 states. [2018-10-01 00:25:27,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:27,852 INFO L93 Difference]: Finished difference Result 605 states and 1360 transitions. [2018-10-01 00:25:27,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:25:27,853 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-01 00:25:27,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:27,858 INFO L225 Difference]: With dead ends: 605 [2018-10-01 00:25:27,858 INFO L226 Difference]: Without dead ends: 597 [2018-10-01 00:25:27,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:25:27,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-10-01 00:25:27,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 337. [2018-10-01 00:25:27,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-10-01 00:25:27,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 794 transitions. [2018-10-01 00:25:27,921 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 794 transitions. Word has length 12 [2018-10-01 00:25:27,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:27,921 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 794 transitions. [2018-10-01 00:25:27,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:25:27,922 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 794 transitions. [2018-10-01 00:25:27,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:25:27,924 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:27,924 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:27,925 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:27,925 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:27,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1088621469, now seen corresponding path program 1 times [2018-10-01 00:25:27,926 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:27,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:27,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:27,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:27,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:28,190 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:25:28,190 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:25:28,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:25:28,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:25:28,191 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:28,191 INFO L87 Difference]: Start difference. First operand 337 states and 794 transitions. Second operand 8 states. [2018-10-01 00:25:35,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:35,358 INFO L93 Difference]: Finished difference Result 935 states and 2104 transitions. [2018-10-01 00:25:35,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-01 00:25:35,359 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-01 00:25:35,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:35,365 INFO L225 Difference]: With dead ends: 935 [2018-10-01 00:25:35,366 INFO L226 Difference]: Without dead ends: 927 [2018-10-01 00:25:35,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:25:35,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-10-01 00:25:35,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 343. [2018-10-01 00:25:35,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-10-01 00:25:35,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 808 transitions. [2018-10-01 00:25:35,454 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 808 transitions. Word has length 12 [2018-10-01 00:25:35,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:35,454 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 808 transitions. [2018-10-01 00:25:35,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:25:35,455 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 808 transitions. [2018-10-01 00:25:35,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:25:35,455 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:35,455 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:35,456 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:35,456 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:35,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1085821115, now seen corresponding path program 1 times [2018-10-01 00:25:35,456 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:35,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:35,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:35,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:35,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:35,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:35,543 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:25:35,543 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:25:35,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:25:35,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:25:35,545 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:35,546 INFO L87 Difference]: Start difference. First operand 343 states and 808 transitions. Second operand 8 states. [2018-10-01 00:25:42,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:42,968 INFO L93 Difference]: Finished difference Result 923 states and 2061 transitions. [2018-10-01 00:25:42,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-01 00:25:42,969 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-01 00:25:42,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:42,975 INFO L225 Difference]: With dead ends: 923 [2018-10-01 00:25:42,976 INFO L226 Difference]: Without dead ends: 915 [2018-10-01 00:25:42,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:25:42,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-10-01 00:25:43,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 354. [2018-10-01 00:25:43,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-10-01 00:25:43,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 835 transitions. [2018-10-01 00:25:43,061 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 835 transitions. Word has length 12 [2018-10-01 00:25:43,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:43,062 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 835 transitions. [2018-10-01 00:25:43,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:25:43,062 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 835 transitions. [2018-10-01 00:25:43,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:25:43,063 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:43,063 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:43,063 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:43,063 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:43,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1085923260, now seen corresponding path program 1 times [2018-10-01 00:25:43,064 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:43,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:43,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:43,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:43,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:43,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:43,143 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:25:43,143 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:25:43,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:25:43,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:25:43,144 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:43,144 INFO L87 Difference]: Start difference. First operand 354 states and 835 transitions. Second operand 8 states. [2018-10-01 00:25:48,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:48,994 INFO L93 Difference]: Finished difference Result 837 states and 1868 transitions. [2018-10-01 00:25:48,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:25:48,995 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-01 00:25:48,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:48,999 INFO L225 Difference]: With dead ends: 837 [2018-10-01 00:25:48,999 INFO L226 Difference]: Without dead ends: 829 [2018-10-01 00:25:49,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:25:49,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-10-01 00:25:49,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 339. [2018-10-01 00:25:49,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-01 00:25:49,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 800 transitions. [2018-10-01 00:25:49,108 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 800 transitions. Word has length 12 [2018-10-01 00:25:49,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:49,108 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 800 transitions. [2018-10-01 00:25:49,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:25:49,108 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 800 transitions. [2018-10-01 00:25:49,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:25:49,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:49,109 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:49,110 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:49,110 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:49,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1383194877, now seen corresponding path program 1 times [2018-10-01 00:25:49,110 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:49,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:49,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:49,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:49,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:49,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:49,328 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:25:49,328 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:25:49,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:25:49,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:25:49,329 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:49,329 INFO L87 Difference]: Start difference. First operand 339 states and 800 transitions. Second operand 8 states. [2018-10-01 00:25:57,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:57,326 INFO L93 Difference]: Finished difference Result 996 states and 2227 transitions. [2018-10-01 00:25:57,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-01 00:25:57,326 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-01 00:25:57,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:57,332 INFO L225 Difference]: With dead ends: 996 [2018-10-01 00:25:57,332 INFO L226 Difference]: Without dead ends: 988 [2018-10-01 00:25:57,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:25:57,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-10-01 00:25:57,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 381. [2018-10-01 00:25:57,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-01 00:25:57,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-10-01 00:25:57,455 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-10-01 00:25:57,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:57,456 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-10-01 00:25:57,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:25:57,457 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-10-01 00:25:57,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:25:57,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:57,458 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:57,458 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:57,458 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:57,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1383297022, now seen corresponding path program 1 times [2018-10-01 00:25:57,459 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:57,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:57,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:57,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:57,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:57,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:57,559 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:25:57,559 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:25:57,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:25:57,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:25:57,559 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:57,560 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-10-01 00:26:04,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:04,226 INFO L93 Difference]: Finished difference Result 913 states and 2034 transitions. [2018-10-01 00:26:04,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-01 00:26:04,226 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-01 00:26:04,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:04,232 INFO L225 Difference]: With dead ends: 913 [2018-10-01 00:26:04,232 INFO L226 Difference]: Without dead ends: 905 [2018-10-01 00:26:04,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:26:04,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-10-01 00:26:04,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 371. [2018-10-01 00:26:04,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-10-01 00:26:04,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 890 transitions. [2018-10-01 00:26:04,344 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 890 transitions. Word has length 12 [2018-10-01 00:26:04,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:04,345 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 890 transitions. [2018-10-01 00:26:04,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:26:04,345 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 890 transitions. [2018-10-01 00:26:04,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:26:04,346 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:04,346 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:04,346 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:04,346 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:04,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1392211258, now seen corresponding path program 1 times [2018-10-01 00:26:04,347 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:04,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:04,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:04,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:04,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:04,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:04,450 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:26:04,450 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:26:04,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:26:04,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:26:04,451 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:04,451 INFO L87 Difference]: Start difference. First operand 371 states and 890 transitions. Second operand 8 states. [2018-10-01 00:26:10,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:10,221 INFO L93 Difference]: Finished difference Result 886 states and 2009 transitions. [2018-10-01 00:26:10,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-01 00:26:10,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-01 00:26:10,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:10,225 INFO L225 Difference]: With dead ends: 886 [2018-10-01 00:26:10,225 INFO L226 Difference]: Without dead ends: 878 [2018-10-01 00:26:10,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:26:10,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2018-10-01 00:26:10,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 372. [2018-10-01 00:26:10,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-10-01 00:26:10,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 891 transitions. [2018-10-01 00:26:10,339 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 891 transitions. Word has length 12 [2018-10-01 00:26:10,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:10,340 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 891 transitions. [2018-10-01 00:26:10,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:26:10,340 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 891 transitions. [2018-10-01 00:26:10,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:26:10,340 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:10,340 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:10,341 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:10,341 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:10,341 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-10-01 00:26:10,341 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:10,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:10,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:10,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:10,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:10,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:10,435 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:26:10,435 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:26:10,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:26:10,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:26:10,436 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:10,436 INFO L87 Difference]: Start difference. First operand 372 states and 891 transitions. Second operand 9 states. [2018-10-01 00:26:16,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:16,387 INFO L93 Difference]: Finished difference Result 801 states and 1838 transitions. [2018-10-01 00:26:16,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-01 00:26:16,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-01 00:26:16,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:16,393 INFO L225 Difference]: With dead ends: 801 [2018-10-01 00:26:16,393 INFO L226 Difference]: Without dead ends: 793 [2018-10-01 00:26:16,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:26:16,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-10-01 00:26:16,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 393. [2018-10-01 00:26:16,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-10-01 00:26:16,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 949 transitions. [2018-10-01 00:26:16,528 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 949 transitions. Word has length 12 [2018-10-01 00:26:16,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:16,528 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 949 transitions. [2018-10-01 00:26:16,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:26:16,529 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 949 transitions. [2018-10-01 00:26:16,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:26:16,529 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:16,529 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:16,530 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:16,530 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:16,530 INFO L82 PathProgramCache]: Analyzing trace with hash 192619318, now seen corresponding path program 1 times [2018-10-01 00:26:16,530 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:16,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:16,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:16,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:16,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:16,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:16,629 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:26:16,629 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:26:16,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:26:16,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:26:16,630 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:16,631 INFO L87 Difference]: Start difference. First operand 393 states and 949 transitions. Second operand 9 states. [2018-10-01 00:26:24,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:24,611 INFO L93 Difference]: Finished difference Result 962 states and 2211 transitions. [2018-10-01 00:26:24,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-01 00:26:24,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-01 00:26:24,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:24,617 INFO L225 Difference]: With dead ends: 962 [2018-10-01 00:26:24,617 INFO L226 Difference]: Without dead ends: 954 [2018-10-01 00:26:24,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:26:24,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-10-01 00:26:24,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 409. [2018-10-01 00:26:24,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-10-01 00:26:24,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 997 transitions. [2018-10-01 00:26:24,782 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 997 transitions. Word has length 12 [2018-10-01 00:26:24,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:24,782 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 997 transitions. [2018-10-01 00:26:24,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:26:24,782 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 997 transitions. [2018-10-01 00:26:24,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:26:24,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:24,783 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:24,784 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:24,784 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:24,784 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-10-01 00:26:24,784 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:24,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:24,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:24,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:24,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:24,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:24,888 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:26:24,888 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:26:24,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:26:24,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:26:24,889 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:24,890 INFO L87 Difference]: Start difference. First operand 409 states and 997 transitions. Second operand 9 states. [2018-10-01 00:26:33,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:33,149 INFO L93 Difference]: Finished difference Result 1000 states and 2329 transitions. [2018-10-01 00:26:33,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-01 00:26:33,149 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-01 00:26:33,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:33,155 INFO L225 Difference]: With dead ends: 1000 [2018-10-01 00:26:33,155 INFO L226 Difference]: Without dead ends: 992 [2018-10-01 00:26:33,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:26:33,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-10-01 00:26:33,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 430. [2018-10-01 00:26:33,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-10-01 00:26:33,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1052 transitions. [2018-10-01 00:26:33,333 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1052 transitions. Word has length 12 [2018-10-01 00:26:33,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:33,333 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 1052 transitions. [2018-10-01 00:26:33,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:26:33,334 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1052 transitions. [2018-10-01 00:26:33,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:26:33,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:33,335 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:33,335 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:33,335 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:33,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1320238459, now seen corresponding path program 1 times [2018-10-01 00:26:33,336 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:33,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:33,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:33,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:33,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:33,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:33,454 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:26:33,454 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:26:33,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:26:33,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:26:33,455 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:33,455 INFO L87 Difference]: Start difference. First operand 430 states and 1052 transitions. Second operand 9 states. [2018-10-01 00:26:42,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:42,548 INFO L93 Difference]: Finished difference Result 1065 states and 2466 transitions. [2018-10-01 00:26:42,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-01 00:26:42,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-01 00:26:42,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:42,555 INFO L225 Difference]: With dead ends: 1065 [2018-10-01 00:26:42,556 INFO L226 Difference]: Without dead ends: 1057 [2018-10-01 00:26:42,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:26:42,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2018-10-01 00:26:42,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 471. [2018-10-01 00:26:42,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-10-01 00:26:42,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1168 transitions. [2018-10-01 00:26:42,771 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1168 transitions. Word has length 12 [2018-10-01 00:26:42,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:42,771 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 1168 transitions. [2018-10-01 00:26:42,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:26:42,771 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1168 transitions. [2018-10-01 00:26:42,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:26:42,772 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:42,772 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:42,773 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:42,773 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:42,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1320340604, now seen corresponding path program 1 times [2018-10-01 00:26:42,773 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:42,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:42,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:42,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:42,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:42,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:42,892 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:26:42,893 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:26:42,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:26:42,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:26:42,894 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:42,894 INFO L87 Difference]: Start difference. First operand 471 states and 1168 transitions. Second operand 9 states. [2018-10-01 00:26:53,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:53,115 INFO L93 Difference]: Finished difference Result 1227 states and 2851 transitions. [2018-10-01 00:26:53,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-01 00:26:53,115 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-01 00:26:53,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:53,121 INFO L225 Difference]: With dead ends: 1227 [2018-10-01 00:26:53,121 INFO L226 Difference]: Without dead ends: 1219 [2018-10-01 00:26:53,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:26:53,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-10-01 00:26:53,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 438. [2018-10-01 00:26:53,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-10-01 00:26:53,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1072 transitions. [2018-10-01 00:26:53,336 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1072 transitions. Word has length 12 [2018-10-01 00:26:53,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:53,336 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 1072 transitions. [2018-10-01 00:26:53,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:26:53,336 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1072 transitions. [2018-10-01 00:26:53,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:26:53,337 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:53,337 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:53,337 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:53,337 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:53,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-10-01 00:26:53,337 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:53,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:53,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:53,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:53,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:53,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:53,448 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:26:53,448 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:26:53,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:26:53,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:26:53,449 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:53,449 INFO L87 Difference]: Start difference. First operand 438 states and 1072 transitions. Second operand 9 states. [2018-10-01 00:27:01,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:01,786 INFO L93 Difference]: Finished difference Result 1076 states and 2511 transitions. [2018-10-01 00:27:01,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-01 00:27:01,787 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-01 00:27:01,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:01,793 INFO L225 Difference]: With dead ends: 1076 [2018-10-01 00:27:01,793 INFO L226 Difference]: Without dead ends: 1068 [2018-10-01 00:27:01,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:27:01,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2018-10-01 00:27:02,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 445. [2018-10-01 00:27:02,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-10-01 00:27:02,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1088 transitions. [2018-10-01 00:27:02,031 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1088 transitions. Word has length 12 [2018-10-01 00:27:02,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:02,031 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 1088 transitions. [2018-10-01 00:27:02,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:27:02,031 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1088 transitions. [2018-10-01 00:27:02,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:27:02,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:02,032 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:27:02,032 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:02,032 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:02,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1838990990, now seen corresponding path program 1 times [2018-10-01 00:27:02,033 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:02,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:02,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:02,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:02,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:02,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:02,120 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:27:02,120 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:27:02,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:27:02,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:27:02,121 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:02,121 INFO L87 Difference]: Start difference. First operand 445 states and 1088 transitions. Second operand 9 states. [2018-10-01 00:27:09,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:09,678 INFO L93 Difference]: Finished difference Result 1111 states and 2606 transitions. [2018-10-01 00:27:09,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:27:09,679 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-01 00:27:09,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:09,684 INFO L225 Difference]: With dead ends: 1111 [2018-10-01 00:27:09,684 INFO L226 Difference]: Without dead ends: 1103 [2018-10-01 00:27:09,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:27:09,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2018-10-01 00:27:10,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 520. [2018-10-01 00:27:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-01 00:27:10,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1295 transitions. [2018-10-01 00:27:10,004 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1295 transitions. Word has length 12 [2018-10-01 00:27:10,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:10,004 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 1295 transitions. [2018-10-01 00:27:10,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:27:10,004 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1295 transitions. [2018-10-01 00:27:10,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:27:10,005 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:10,005 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:27:10,005 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:10,005 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:10,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1838888845, now seen corresponding path program 1 times [2018-10-01 00:27:10,006 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:10,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:10,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:10,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:10,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:10,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:10,227 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:27:10,228 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:27:10,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:27:10,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:27:10,228 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:10,228 INFO L87 Difference]: Start difference. First operand 520 states and 1295 transitions. Second operand 9 states. [2018-10-01 00:27:20,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:20,465 INFO L93 Difference]: Finished difference Result 1304 states and 3059 transitions. [2018-10-01 00:27:20,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-01 00:27:20,466 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-01 00:27:20,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:20,473 INFO L225 Difference]: With dead ends: 1304 [2018-10-01 00:27:20,473 INFO L226 Difference]: Without dead ends: 1296 [2018-10-01 00:27:20,473 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:27:20,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-10-01 00:27:20,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 487. [2018-10-01 00:27:20,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-10-01 00:27:20,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1199 transitions. [2018-10-01 00:27:20,793 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1199 transitions. Word has length 12 [2018-10-01 00:27:20,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:20,793 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 1199 transitions. [2018-10-01 00:27:20,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:27:20,793 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1199 transitions. [2018-10-01 00:27:20,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:27:20,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:20,794 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:27:20,795 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:20,795 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:20,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1731038698, now seen corresponding path program 1 times [2018-10-01 00:27:20,795 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:20,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:20,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:20,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:20,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:20,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-01 00:27:20,906 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:27:20,906 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:27:20,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:27:20,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:27:20,907 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:20,908 INFO L87 Difference]: Start difference. First operand 487 states and 1199 transitions. Second operand 9 states. [2018-10-01 00:27:32,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:32,052 INFO L93 Difference]: Finished difference Result 1370 states and 3217 transitions. [2018-10-01 00:27:32,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-01 00:27:32,052 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-01 00:27:32,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:32,061 INFO L225 Difference]: With dead ends: 1370 [2018-10-01 00:27:32,061 INFO L226 Difference]: Without dead ends: 1362 [2018-10-01 00:27:32,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:27:32,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2018-10-01 00:27:32,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 479. [2018-10-01 00:27:32,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-10-01 00:27:32,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1179 transitions. [2018-10-01 00:27:32,388 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1179 transitions. Word has length 12 [2018-10-01 00:27:32,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:32,388 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 1179 transitions. [2018-10-01 00:27:32,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:27:32,388 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1179 transitions. [2018-10-01 00:27:32,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:27:32,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:32,389 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:27:32,390 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:32,390 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:32,390 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-10-01 00:27:32,390 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:32,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:32,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:32,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:32,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:32,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:32,484 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:27:32,484 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:27:32,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:27:32,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:27:32,485 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:32,485 INFO L87 Difference]: Start difference. First operand 479 states and 1179 transitions. Second operand 9 states. [2018-10-01 00:27:39,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:39,392 INFO L93 Difference]: Finished difference Result 1298 states and 3068 transitions. [2018-10-01 00:27:39,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-01 00:27:39,392 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-01 00:27:39,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:39,397 INFO L225 Difference]: With dead ends: 1298 [2018-10-01 00:27:39,397 INFO L226 Difference]: Without dead ends: 1290 [2018-10-01 00:27:39,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:27:39,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-10-01 00:27:39,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 602. [2018-10-01 00:27:39,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-10-01 00:27:39,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-10-01 00:27:39,845 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-10-01 00:27:39,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:39,845 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-10-01 00:27:39,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:27:39,845 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-10-01 00:27:39,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 00:27:39,846 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:39,846 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:27:39,846 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:39,846 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:39,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1080362888, now seen corresponding path program 1 times [2018-10-01 00:27:39,847 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:39,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:39,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:39,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:39,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:39,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:39,892 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:27:39,892 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:27:39,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:27:39,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:27:39,893 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:39,893 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-10-01 00:27:41,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:41,090 INFO L93 Difference]: Finished difference Result 1242 states and 3091 transitions. [2018-10-01 00:27:41,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:27:41,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-01 00:27:41,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:41,092 INFO L225 Difference]: With dead ends: 1242 [2018-10-01 00:27:41,092 INFO L226 Difference]: Without dead ends: 673 [2018-10-01 00:27:41,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:27:41,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-10-01 00:27:41,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 612. [2018-10-01 00:27:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-10-01 00:27:41,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1463 transitions. [2018-10-01 00:27:41,515 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1463 transitions. Word has length 13 [2018-10-01 00:27:41,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:41,515 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 1463 transitions. [2018-10-01 00:27:41,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:27:41,515 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1463 transitions. [2018-10-01 00:27:41,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 00:27:41,516 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:41,516 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:27:41,516 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:41,516 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:41,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1652407871, now seen corresponding path program 1 times [2018-10-01 00:27:41,516 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:41,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:41,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:41,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:41,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:41,601 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-01 00:27:41,602 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:41,602 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-01 00:27:41,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:41,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:42,715 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-01 00:27:42,738 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:42,738 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-10-01 00:27:42,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-01 00:27:42,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-01 00:27:42,738 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:42,739 INFO L87 Difference]: Start difference. First operand 612 states and 1463 transitions. Second operand 16 states. [2018-10-01 00:27:49,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:49,831 INFO L93 Difference]: Finished difference Result 854 states and 1987 transitions. [2018-10-01 00:27:49,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 00:27:49,832 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-10-01 00:27:49,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:49,834 INFO L225 Difference]: With dead ends: 854 [2018-10-01 00:27:49,834 INFO L226 Difference]: Without dead ends: 849 [2018-10-01 00:27:49,835 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 00:27:49,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-10-01 00:27:50,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 690. [2018-10-01 00:27:50,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-10-01 00:27:50,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1639 transitions. [2018-10-01 00:27:50,873 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1639 transitions. Word has length 13 [2018-10-01 00:27:50,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:50,874 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1639 transitions. [2018-10-01 00:27:50,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-01 00:27:50,874 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1639 transitions. [2018-10-01 00:27:50,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 00:27:50,875 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:50,875 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:27:50,875 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:50,875 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:50,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1456173380, now seen corresponding path program 1 times [2018-10-01 00:27:50,876 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:50,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:50,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:50,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:50,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:50,983 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-01 00:27:50,983 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:27:50,983 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:27:50,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:27:50,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:27:50,983 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:50,984 INFO L87 Difference]: Start difference. First operand 690 states and 1639 transitions. Second operand 5 states. [2018-10-01 00:27:52,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:52,292 INFO L93 Difference]: Finished difference Result 1308 states and 3113 transitions. [2018-10-01 00:27:52,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:27:52,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-01 00:27:52,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:52,295 INFO L225 Difference]: With dead ends: 1308 [2018-10-01 00:27:52,295 INFO L226 Difference]: Without dead ends: 709 [2018-10-01 00:27:52,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:27:52,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-10-01 00:27:52,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 690. [2018-10-01 00:27:52,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-10-01 00:27:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-10-01 00:27:52,893 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-10-01 00:27:52,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:52,893 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-10-01 00:27:52,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:27:52,893 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-10-01 00:27:52,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:27:52,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:52,894 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:27:52,894 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:52,895 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:52,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1952744875, now seen corresponding path program 1 times [2018-10-01 00:27:52,895 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:52,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:52,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:52,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:52,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:53,532 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-01 00:27:53,532 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:53,532 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-01 00:27:53,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:53,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:53,735 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-01 00:27:53,757 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:53,757 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-01 00:27:53,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-01 00:27:53,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-01 00:27:53,757 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:53,757 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 17 states. [2018-10-01 00:28:44,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:44,866 INFO L93 Difference]: Finished difference Result 2011 states and 4412 transitions. [2018-10-01 00:28:44,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-10-01 00:28:44,867 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-01 00:28:44,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:44,870 INFO L225 Difference]: With dead ends: 2011 [2018-10-01 00:28:44,870 INFO L226 Difference]: Without dead ends: 2003 [2018-10-01 00:28:44,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s Time [2018-10-01 00:28:44,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2018-10-01 00:28:46,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1151. [2018-10-01 00:28:46,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-10-01 00:28:46,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 2622 transitions. [2018-10-01 00:28:46,024 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 2622 transitions. Word has length 16 [2018-10-01 00:28:46,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:46,024 INFO L480 AbstractCegarLoop]: Abstraction has 1151 states and 2622 transitions. [2018-10-01 00:28:46,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-01 00:28:46,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 2622 transitions. [2018-10-01 00:28:46,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:28:46,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:46,025 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:28:46,026 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:46,026 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:46,026 INFO L82 PathProgramCache]: Analyzing trace with hash -51223093, now seen corresponding path program 1 times [2018-10-01 00:28:46,026 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:46,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:46,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:46,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:46,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:46,109 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-01 00:28:46,109 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:46,110 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-01 00:28:46,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:46,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:46,340 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-01 00:28:46,361 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:46,361 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-01 00:28:46,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-01 00:28:46,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-01 00:28:46,362 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:46,362 INFO L87 Difference]: Start difference. First operand 1151 states and 2622 transitions. Second operand 17 states. [2018-10-01 00:29:24,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:24,294 INFO L93 Difference]: Finished difference Result 2797 states and 6168 transitions. [2018-10-01 00:29:24,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-01 00:29:24,294 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-01 00:29:24,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:24,301 INFO L225 Difference]: With dead ends: 2797 [2018-10-01 00:29:24,301 INFO L226 Difference]: Without dead ends: 2789 [2018-10-01 00:29:24,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s Time [2018-10-01 00:29:24,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2789 states. [2018-10-01 00:29:25,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2789 to 1186. [2018-10-01 00:29:25,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2018-10-01 00:29:25,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 2705 transitions. [2018-10-01 00:29:25,612 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 2705 transitions. Word has length 16 [2018-10-01 00:29:25,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:25,613 INFO L480 AbstractCegarLoop]: Abstraction has 1186 states and 2705 transitions. [2018-10-01 00:29:25,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-01 00:29:25,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 2705 transitions. [2018-10-01 00:29:25,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:29:25,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:25,614 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:29:25,615 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:25,615 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:25,615 INFO L82 PathProgramCache]: Analyzing trace with hash -666637335, now seen corresponding path program 1 times [2018-10-01 00:29:25,615 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:25,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:25,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:25,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:29:25,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:25,794 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-01 00:29:25,795 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:25,795 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-01 00:29:25,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:29:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:25,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:26,047 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-01 00:29:26,070 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:26,070 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-01 00:29:26,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-01 00:29:26,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-01 00:29:26,071 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:26,071 INFO L87 Difference]: Start difference. First operand 1186 states and 2705 transitions. Second operand 17 states. [2018-10-01 00:29:58,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:58,252 INFO L93 Difference]: Finished difference Result 2492 states and 5544 transitions. [2018-10-01 00:29:58,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-10-01 00:29:58,252 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-01 00:29:58,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:58,259 INFO L225 Difference]: With dead ends: 2492 [2018-10-01 00:29:58,260 INFO L226 Difference]: Without dead ends: 2484 [2018-10-01 00:29:58,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s Time [2018-10-01 00:29:58,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2018-10-01 00:30:00,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 1219. [2018-10-01 00:30:00,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1219 states. [2018-10-01 00:30:00,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 2792 transitions. [2018-10-01 00:30:00,074 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 2792 transitions. Word has length 16 [2018-10-01 00:30:00,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:00,074 INFO L480 AbstractCegarLoop]: Abstraction has 1219 states and 2792 transitions. [2018-10-01 00:30:00,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-01 00:30:00,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 2792 transitions. [2018-10-01 00:30:00,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:30:00,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:00,075 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:30:00,075 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:00,076 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:00,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1212722005, now seen corresponding path program 1 times [2018-10-01 00:30:00,076 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:00,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:00,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:00,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:30:00,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:00,180 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-01 00:30:00,180 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:30:00,180 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-01 00:30:00,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:30:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:00,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:00,447 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-01 00:30:00,467 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-01 00:30:00,468 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2018-10-01 00:30:00,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-01 00:30:00,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-01 00:30:00,468 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:00,468 INFO L87 Difference]: Start difference. First operand 1219 states and 2792 transitions. Second operand 17 states. [2018-10-01 00:30:51,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:51,574 INFO L93 Difference]: Finished difference Result 3178 states and 7226 transitions. [2018-10-01 00:30:51,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-10-01 00:30:51,575 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-01 00:30:51,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:51,581 INFO L225 Difference]: With dead ends: 3178 [2018-10-01 00:30:51,581 INFO L226 Difference]: Without dead ends: 3170 [2018-10-01 00:30:51,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s Time [2018-10-01 00:30:51,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2018-10-01 00:30:53,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 1242. [2018-10-01 00:30:53,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1242 states. [2018-10-01 00:30:53,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 2857 transitions. [2018-10-01 00:30:53,040 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 2857 transitions. Word has length 16 [2018-10-01 00:30:53,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:53,041 INFO L480 AbstractCegarLoop]: Abstraction has 1242 states and 2857 transitions. [2018-10-01 00:30:53,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-01 00:30:53,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 2857 transitions. [2018-10-01 00:30:53,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:30:53,041 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:53,042 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:30:53,042 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:53,042 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:53,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1212619860, now seen corresponding path program 1 times [2018-10-01 00:30:53,042 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:53,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:53,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:53,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:30:53,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:53,125 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-01 00:30:53,125 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:30:53,125 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-01 00:30:53,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:30:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:53,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:53,341 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-01 00:30:53,372 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-01 00:30:53,372 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2018-10-01 00:30:53,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-01 00:30:53,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-01 00:30:53,373 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:53,373 INFO L87 Difference]: Start difference. First operand 1242 states and 2857 transitions. Second operand 17 states. [2018-10-01 00:31:32,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:31:32,967 INFO L93 Difference]: Finished difference Result 2638 states and 5927 transitions. [2018-10-01 00:31:32,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-10-01 00:31:32,968 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-01 00:31:32,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:31:32,974 INFO L225 Difference]: With dead ends: 2638 [2018-10-01 00:31:32,974 INFO L226 Difference]: Without dead ends: 2630 [2018-10-01 00:31:32,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s Time [2018-10-01 00:31:32,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2018-10-01 00:31:34,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 1469. [2018-10-01 00:31:34,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2018-10-01 00:31:34,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 3433 transitions. [2018-10-01 00:31:34,754 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 3433 transitions. Word has length 16 [2018-10-01 00:31:34,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:31:34,755 INFO L480 AbstractCegarLoop]: Abstraction has 1469 states and 3433 transitions. [2018-10-01 00:31:34,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-01 00:31:34,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 3433 transitions. [2018-10-01 00:31:34,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:31:34,756 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:31:34,756 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:31:34,756 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:31:34,756 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:31:34,757 INFO L82 PathProgramCache]: Analyzing trace with hash 780585054, now seen corresponding path program 1 times [2018-10-01 00:31:34,757 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:31:34,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:31:34,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:34,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:31:34,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:34,839 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-01 00:31:34,839 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:31:34,839 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-01 00:31:34,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:31:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:34,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:31:35,051 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-01 00:31:35,072 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:31:35,072 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-01 00:31:35,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-01 00:31:35,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-01 00:31:35,073 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:31:35,073 INFO L87 Difference]: Start difference. First operand 1469 states and 3433 transitions. Second operand 17 states. [2018-10-01 00:32:23,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:32:23,806 INFO L93 Difference]: Finished difference Result 2855 states and 6512 transitions. [2018-10-01 00:32:23,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-01 00:32:23,806 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-01 00:32:23,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:32:23,812 INFO L225 Difference]: With dead ends: 2855 [2018-10-01 00:32:23,812 INFO L226 Difference]: Without dead ends: 2847 [2018-10-01 00:32:23,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time [2018-10-01 00:32:23,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2847 states. [2018-10-01 00:32:25,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2847 to 1479. [2018-10-01 00:32:25,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1479 states. [2018-10-01 00:32:25,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 3457 transitions. [2018-10-01 00:32:25,612 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 3457 transitions. Word has length 16 [2018-10-01 00:32:25,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:32:25,612 INFO L480 AbstractCegarLoop]: Abstraction has 1479 states and 3457 transitions. [2018-10-01 00:32:25,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-01 00:32:25,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 3457 transitions. [2018-10-01 00:32:25,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:32:25,612 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:32:25,613 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:32:25,613 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:32:25,613 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:32:25,613 INFO L82 PathProgramCache]: Analyzing trace with hash 165170812, now seen corresponding path program 1 times [2018-10-01 00:32:25,613 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:32:25,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:32:25,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:25,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:32:25,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:32:25,714 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-01 00:32:25,714 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:32:25,714 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-01 00:32:25,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:32:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:32:25,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:32:25,943 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-01 00:32:25,965 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:32:25,966 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-01 00:32:25,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-01 00:32:25,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-01 00:32:25,966 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:32:25,966 INFO L87 Difference]: Start difference. First operand 1479 states and 3457 transitions. Second operand 17 states. [2018-10-01 00:33:10,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:33:10,748 INFO L93 Difference]: Finished difference Result 3363 states and 7697 transitions. [2018-10-01 00:33:10,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-01 00:33:10,748 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-01 00:33:10,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:33:10,752 INFO L225 Difference]: With dead ends: 3363 [2018-10-01 00:33:10,752 INFO L226 Difference]: Without dead ends: 3355 [2018-10-01 00:33:10,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s Time [2018-10-01 00:33:10,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2018-10-01 00:33:12,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 1535. [2018-10-01 00:33:12,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states. [2018-10-01 00:33:12,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 3580 transitions. [2018-10-01 00:33:12,632 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 3580 transitions. Word has length 16 [2018-10-01 00:33:12,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:33:12,632 INFO L480 AbstractCegarLoop]: Abstraction has 1535 states and 3580 transitions. [2018-10-01 00:33:12,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-01 00:33:12,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 3580 transitions. [2018-10-01 00:33:12,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:33:12,633 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:33:12,633 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:33:12,633 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:33:12,633 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:33:12,634 INFO L82 PathProgramCache]: Analyzing trace with hash 723989304, now seen corresponding path program 1 times [2018-10-01 00:33:12,634 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:33:12,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:33:12,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:12,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:33:12,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:33:12,724 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-01 00:33:12,724 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:33:12,725 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-01 00:33:12,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:33:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:33:12,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:33:12,935 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-01 00:33:12,957 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:33:12,957 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2018-10-01 00:33:12,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-01 00:33:12,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-01 00:33:12,958 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:33:12,958 INFO L87 Difference]: Start difference. First operand 1535 states and 3580 transitions. Second operand 18 states. [2018-10-01 00:34:05,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:34:05,320 INFO L93 Difference]: Finished difference Result 2863 states and 6551 transitions. [2018-10-01 00:34:05,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-01 00:34:05,321 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16 [2018-10-01 00:34:05,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:34:05,324 INFO L225 Difference]: With dead ends: 2863 [2018-10-01 00:34:05,324 INFO L226 Difference]: Without dead ends: 2855 [2018-10-01 00:34:05,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s Time [2018-10-01 00:34:05,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2018-10-01 00:34:07,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 1456. [2018-10-01 00:34:07,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1456 states. [2018-10-01 00:34:07,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 3378 transitions. [2018-10-01 00:34:07,176 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 3378 transitions. Word has length 16 [2018-10-01 00:34:07,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:34:07,176 INFO L480 AbstractCegarLoop]: Abstraction has 1456 states and 3378 transitions. [2018-10-01 00:34:07,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-01 00:34:07,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 3378 transitions. [2018-10-01 00:34:07,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:34:07,178 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:34:07,178 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:34:07,178 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:34:07,178 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:34:07,178 INFO L82 PathProgramCache]: Analyzing trace with hash 876461633, now seen corresponding path program 1 times [2018-10-01 00:34:07,179 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:34:07,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:34:07,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:07,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:34:07,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:34:07,277 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-01 00:34:07,277 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:34:07,277 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-01 00:34:07,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:34:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:34:07,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:34:07,628 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-01 00:34:07,651 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:34:07,652 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-01 00:34:07,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-01 00:34:07,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-01 00:34:07,652 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:34:07,652 INFO L87 Difference]: Start difference. First operand 1456 states and 3378 transitions. Second operand 17 states. [2018-10-01 00:34:56,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:34:56,020 INFO L93 Difference]: Finished difference Result 2913 states and 6636 transitions. [2018-10-01 00:34:56,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-01 00:34:56,020 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-01 00:34:56,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:34:56,023 INFO L225 Difference]: With dead ends: 2913 [2018-10-01 00:34:56,023 INFO L226 Difference]: Without dead ends: 2905 [2018-10-01 00:34:56,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s Time [2018-10-01 00:34:56,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2018-10-01 00:34:57,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 1232. [2018-10-01 00:34:57,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2018-10-01 00:34:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2831 transitions. [2018-10-01 00:34:57,745 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2831 transitions. Word has length 16 [2018-10-01 00:34:57,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:34:57,745 INFO L480 AbstractCegarLoop]: Abstraction has 1232 states and 2831 transitions. [2018-10-01 00:34:57,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-01 00:34:57,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2831 transitions. [2018-10-01 00:34:57,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:34:57,746 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:34:57,746 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:34:57,746 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:34:57,747 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:34:57,747 INFO L82 PathProgramCache]: Analyzing trace with hash -345007351, now seen corresponding path program 1 times [2018-10-01 00:34:57,747 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:34:57,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:34:57,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:57,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:34:57,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:34:57,871 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-01 00:34:57,872 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:34:57,872 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-01 00:34:57,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:34:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:34:57,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:34:57,916 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-01 00:34:57,938 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:34:57,938 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-01 00:34:57,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:34:57,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:34:57,939 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:34:57,939 INFO L87 Difference]: Start difference. First operand 1232 states and 2831 transitions. Second operand 8 states. [2018-10-01 00:35:05,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:35:05,256 INFO L93 Difference]: Finished difference Result 1697 states and 3786 transitions. [2018-10-01 00:35:05,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-01 00:35:05,257 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-01 00:35:05,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:35:05,259 INFO L225 Difference]: With dead ends: 1697 [2018-10-01 00:35:05,259 INFO L226 Difference]: Without dead ends: 1689 [2018-10-01 00:35:05,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:35:05,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1689 states. [2018-10-01 00:35:06,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1689 to 1388. [2018-10-01 00:35:06,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1388 states. [2018-10-01 00:35:06,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 3196 transitions. [2018-10-01 00:35:06,981 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 3196 transitions. Word has length 16 [2018-10-01 00:35:06,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:35:06,981 INFO L480 AbstractCegarLoop]: Abstraction has 1388 states and 3196 transitions. [2018-10-01 00:35:06,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:35:06,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 3196 transitions. [2018-10-01 00:35:06,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:35:06,982 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:35:06,982 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:35:06,983 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:35:06,983 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:35:06,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521947, now seen corresponding path program 1 times [2018-10-01 00:35:06,984 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:35:06,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:35:06,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:06,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:35:06,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:35:07,107 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-01 00:35:07,108 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:35:07,108 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-01 00:35:07,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:35:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:35:07,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:35:07,229 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-01 00:35:07,249 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:35:07,249 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-01 00:35:07,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:35:07,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:35:07,249 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:35:07,249 INFO L87 Difference]: Start difference. First operand 1388 states and 3196 transitions. Second operand 8 states. [2018-10-01 00:35:15,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:35:15,380 INFO L93 Difference]: Finished difference Result 1836 states and 4085 transitions. [2018-10-01 00:35:15,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-01 00:35:15,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-01 00:35:15,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:35:15,382 INFO L225 Difference]: With dead ends: 1836 [2018-10-01 00:35:15,382 INFO L226 Difference]: Without dead ends: 1828 [2018-10-01 00:35:15,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:35:15,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1828 states. [2018-10-01 00:35:17,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1828 to 1400. [2018-10-01 00:35:17,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1400 states. [2018-10-01 00:35:17,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 3220 transitions. [2018-10-01 00:35:17,257 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 3220 transitions. Word has length 16 [2018-10-01 00:35:17,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:35:17,257 INFO L480 AbstractCegarLoop]: Abstraction has 1400 states and 3220 transitions. [2018-10-01 00:35:17,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:35:17,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 3220 transitions. [2018-10-01 00:35:17,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:35:17,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:35:17,258 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:35:17,259 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:35:17,259 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:35:17,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521668, now seen corresponding path program 1 times [2018-10-01 00:35:17,259 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:35:17,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:35:17,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:17,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:35:17,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:35:17,684 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-01 00:35:17,685 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:35:17,685 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-01 00:35:17,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:35:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:35:17,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:35:17,752 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-01 00:35:17,772 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:35:17,773 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-01 00:35:17,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:35:17,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:35:17,773 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:35:17,773 INFO L87 Difference]: Start difference. First operand 1400 states and 3220 transitions. Second operand 8 states. [2018-10-01 00:35:27,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:35:27,198 INFO L93 Difference]: Finished difference Result 1947 states and 4347 transitions. [2018-10-01 00:35:27,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-01 00:35:27,198 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-01 00:35:27,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:35:27,201 INFO L225 Difference]: With dead ends: 1947 [2018-10-01 00:35:27,201 INFO L226 Difference]: Without dead ends: 1939 [2018-10-01 00:35:27,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:35:27,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2018-10-01 00:35:28,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1481. [2018-10-01 00:35:28,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2018-10-01 00:35:28,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 3406 transitions. [2018-10-01 00:35:28,965 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 3406 transitions. Word has length 16 [2018-10-01 00:35:28,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:35:28,965 INFO L480 AbstractCegarLoop]: Abstraction has 1481 states and 3406 transitions. [2018-10-01 00:35:28,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:35:28,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 3406 transitions. [2018-10-01 00:35:28,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:35:28,966 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:35:28,966 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:35:28,966 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:35:28,966 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:35:28,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1133346772, now seen corresponding path program 1 times [2018-10-01 00:35:28,966 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:35:28,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:35:28,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:28,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:35:28,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:35:29,124 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-01 00:35:29,124 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:35:29,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 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-01 00:35:29,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:35:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:35:29,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:35:29,157 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-01 00:35:29,179 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:35:29,179 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-01 00:35:29,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:35:29,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:35:29,179 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:35:29,179 INFO L87 Difference]: Start difference. First operand 1481 states and 3406 transitions. Second operand 8 states. [2018-10-01 00:35:37,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:35:37,120 INFO L93 Difference]: Finished difference Result 1964 states and 4367 transitions. [2018-10-01 00:35:37,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:35:37,121 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-01 00:35:37,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:35:37,123 INFO L225 Difference]: With dead ends: 1964 [2018-10-01 00:35:37,123 INFO L226 Difference]: Without dead ends: 1956 [2018-10-01 00:35:37,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:35:37,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states. [2018-10-01 00:35:39,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 1508. [2018-10-01 00:35:39,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-10-01 00:35:39,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 3463 transitions. [2018-10-01 00:35:39,093 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 3463 transitions. Word has length 16 [2018-10-01 00:35:39,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:35:39,094 INFO L480 AbstractCegarLoop]: Abstraction has 1508 states and 3463 transitions. [2018-10-01 00:35:39,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:35:39,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 3463 transitions. [2018-10-01 00:35:39,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:35:39,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:35:39,094 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:35:39,095 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:35:39,095 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:35:39,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1133347051, now seen corresponding path program 1 times [2018-10-01 00:35:39,095 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:35:39,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:35:39,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:39,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:35:39,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:35:39,172 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-01 00:35:39,172 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:35:39,172 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-01 00:35:39,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:35:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:35:39,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:35:39,215 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-01 00:35:39,238 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:35:39,238 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-01 00:35:39,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:35:39,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:35:39,238 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:35:39,239 INFO L87 Difference]: Start difference. First operand 1508 states and 3463 transitions. Second operand 8 states. [2018-10-01 00:35:49,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:35:49,981 INFO L93 Difference]: Finished difference Result 2188 states and 4868 transitions. [2018-10-01 00:35:49,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-01 00:35:49,981 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-01 00:35:49,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:35:49,984 INFO L225 Difference]: With dead ends: 2188 [2018-10-01 00:35:49,984 INFO L226 Difference]: Without dead ends: 2180 [2018-10-01 00:35:49,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:35:49,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2018-10-01 00:35:51,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 1487. [2018-10-01 00:35:51,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1487 states. [2018-10-01 00:35:51,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 3418 transitions. [2018-10-01 00:35:51,783 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 3418 transitions. Word has length 16 [2018-10-01 00:35:51,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:35:51,783 INFO L480 AbstractCegarLoop]: Abstraction has 1487 states and 3418 transitions. [2018-10-01 00:35:51,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:35:51,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 3418 transitions. [2018-10-01 00:35:51,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:35:51,784 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:35:51,784 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:35:51,784 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:35:51,784 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:35:51,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1137226608, now seen corresponding path program 1 times [2018-10-01 00:35:51,785 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:35:51,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:35:51,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:51,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:35:51,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:35:52,217 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-01 00:35:52,218 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:35:52,218 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:35:52,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:35:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:35:52,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:35:52,264 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-01 00:35:52,285 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:35:52,285 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-01 00:35:52,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:35:52,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:35:52,286 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:35:52,286 INFO L87 Difference]: Start difference. First operand 1487 states and 3418 transitions. Second operand 8 states. [2018-10-01 00:36:01,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:36:01,920 INFO L93 Difference]: Finished difference Result 2083 states and 4646 transitions. [2018-10-01 00:36:01,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-01 00:36:01,921 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-01 00:36:01,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:36:01,923 INFO L225 Difference]: With dead ends: 2083 [2018-10-01 00:36:01,923 INFO L226 Difference]: Without dead ends: 2075 [2018-10-01 00:36:01,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:36:01,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2018-10-01 00:36:03,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 1513. [2018-10-01 00:36:03,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2018-10-01 00:36:03,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 3474 transitions. [2018-10-01 00:36:03,865 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 3474 transitions. Word has length 16 [2018-10-01 00:36:03,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:36:03,865 INFO L480 AbstractCegarLoop]: Abstraction has 1513 states and 3474 transitions. [2018-10-01 00:36:03,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:36:03,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 3474 transitions. [2018-10-01 00:36:03,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:36:03,866 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:36:03,866 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:36:03,866 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:36:03,866 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:36:03,866 INFO L82 PathProgramCache]: Analyzing trace with hash 918935888, now seen corresponding path program 1 times [2018-10-01 00:36:03,867 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:36:03,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:36:03,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:03,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:36:03,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:36:03,952 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-01 00:36:03,953 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:36:03,953 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:36:03,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:36:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:36:03,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:36:04,000 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-01 00:36:04,022 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:36:04,022 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-01 00:36:04,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:36:04,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:36:04,023 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:36:04,023 INFO L87 Difference]: Start difference. First operand 1513 states and 3474 transitions. Second operand 8 states. [2018-10-01 00:36:11,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:36:11,027 INFO L93 Difference]: Finished difference Result 1831 states and 4101 transitions. [2018-10-01 00:36:11,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:36:11,028 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-01 00:36:11,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:36:11,030 INFO L225 Difference]: With dead ends: 1831 [2018-10-01 00:36:11,030 INFO L226 Difference]: Without dead ends: 1823 [2018-10-01 00:36:11,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:36:11,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2018-10-01 00:36:12,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1496. [2018-10-01 00:36:12,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-10-01 00:36:12,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 3431 transitions. [2018-10-01 00:36:12,886 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 3431 transitions. Word has length 16 [2018-10-01 00:36:12,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:36:12,886 INFO L480 AbstractCegarLoop]: Abstraction has 1496 states and 3431 transitions. [2018-10-01 00:36:12,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:36:12,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 3431 transitions. [2018-10-01 00:36:12,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:36:12,887 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:36:12,887 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:36:12,888 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:36:12,888 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:36:12,888 INFO L82 PathProgramCache]: Analyzing trace with hash 918936167, now seen corresponding path program 1 times [2018-10-01 00:36:12,888 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:36:12,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:36:12,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:12,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:36:12,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:36:12,995 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-01 00:36:12,995 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:36:12,995 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:36:13,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:36:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:36:13,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:36:13,045 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-01 00:36:13,066 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:36:13,066 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-01 00:36:13,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:36:13,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:36:13,067 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:36:13,067 INFO L87 Difference]: Start difference. First operand 1496 states and 3431 transitions. Second operand 8 states. [2018-10-01 00:36:22,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:36:22,880 INFO L93 Difference]: Finished difference Result 2055 states and 4602 transitions. [2018-10-01 00:36:22,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-01 00:36:22,880 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-01 00:36:22,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:36:22,882 INFO L225 Difference]: With dead ends: 2055 [2018-10-01 00:36:22,882 INFO L226 Difference]: Without dead ends: 2047 [2018-10-01 00:36:22,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:36:22,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2018-10-01 00:36:24,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 1475. [2018-10-01 00:36:24,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1475 states. [2018-10-01 00:36:24,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 3386 transitions. [2018-10-01 00:36:24,873 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 3386 transitions. Word has length 16 [2018-10-01 00:36:24,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:36:24,874 INFO L480 AbstractCegarLoop]: Abstraction has 1475 states and 3386 transitions. [2018-10-01 00:36:24,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:36:24,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 3386 transitions. [2018-10-01 00:36:24,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:36:24,874 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:36:24,874 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:36:24,875 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:36:24,875 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:36:24,875 INFO L82 PathProgramCache]: Analyzing trace with hash 922815724, now seen corresponding path program 1 times [2018-10-01 00:36:24,875 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:36:24,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:36:24,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:24,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:36:24,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:36:24,951 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-01 00:36:24,951 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:36:24,952 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:36:24,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:36:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:36:24,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:36:25,033 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-01 00:36:25,053 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:36:25,053 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-01 00:36:25,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:36:25,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:36:25,054 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:36:25,054 INFO L87 Difference]: Start difference. First operand 1475 states and 3386 transitions. Second operand 8 states. [2018-10-01 00:36:34,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:36:34,903 INFO L93 Difference]: Finished difference Result 2174 states and 4865 transitions. [2018-10-01 00:36:34,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-01 00:36:34,903 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-01 00:36:34,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:36:34,905 INFO L225 Difference]: With dead ends: 2174 [2018-10-01 00:36:34,905 INFO L226 Difference]: Without dead ends: 2166 [2018-10-01 00:36:34,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:36:34,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2018-10-01 00:36:36,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 1469. [2018-10-01 00:36:36,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2018-10-01 00:36:36,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 3374 transitions. [2018-10-01 00:36:36,770 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 3374 transitions. Word has length 16 [2018-10-01 00:36:36,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:36:36,770 INFO L480 AbstractCegarLoop]: Abstraction has 1469 states and 3374 transitions. [2018-10-01 00:36:36,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:36:36,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 3374 transitions. [2018-10-01 00:36:36,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:36:36,771 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:36:36,772 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:36:36,772 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:36:36,772 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:36:36,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1012397261, now seen corresponding path program 1 times [2018-10-01 00:36:36,772 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:36:36,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:36:36,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:36,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:36:36,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:36:36,844 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-01 00:36:36,844 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:36:36,844 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:36:36,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:36:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:36:36,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:36:36,887 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-01 00:36:36,910 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:36:36,910 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-01 00:36:36,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:36:36,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:36:36,910 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:36:36,910 INFO L87 Difference]: Start difference. First operand 1469 states and 3374 transitions. Second operand 8 states. [2018-10-01 00:36:44,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:36:44,498 INFO L93 Difference]: Finished difference Result 1791 states and 4021 transitions. [2018-10-01 00:36:44,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-01 00:36:44,498 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-01 00:36:44,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:36:44,500 INFO L225 Difference]: With dead ends: 1791 [2018-10-01 00:36:44,500 INFO L226 Difference]: Without dead ends: 1783 [2018-10-01 00:36:44,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:36:44,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2018-10-01 00:36:46,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1399. [2018-10-01 00:36:46,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1399 states. [2018-10-01 00:36:46,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 3208 transitions. [2018-10-01 00:36:46,262 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 3208 transitions. Word has length 16 [2018-10-01 00:36:46,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:36:46,262 INFO L480 AbstractCegarLoop]: Abstraction has 1399 states and 3208 transitions. [2018-10-01 00:36:46,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:36:46,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 3208 transitions. [2018-10-01 00:36:46,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-01 00:36:46,263 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:36:46,263 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:36:46,263 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:36:46,263 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:36:46,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1223690942, now seen corresponding path program 1 times [2018-10-01 00:36:46,263 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:36:46,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:36:46,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:46,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:36:46,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:36:46,373 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-01 00:36:46,373 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:36:46,374 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:36:46,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:36:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:36:46,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:36:46,551 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-01 00:36:46,572 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:36:46,572 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-10-01 00:36:46,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-01 00:36:46,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-01 00:36:46,573 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:36:46,573 INFO L87 Difference]: Start difference. First operand 1399 states and 3208 transitions. Second operand 18 states. [2018-10-01 00:37:17,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:37:17,972 INFO L93 Difference]: Finished difference Result 4141 states and 9317 transitions. [2018-10-01 00:37:17,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-01 00:37:17,972 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-10-01 00:37:17,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:37:17,977 INFO L225 Difference]: With dead ends: 4141 [2018-10-01 00:37:17,977 INFO L226 Difference]: Without dead ends: 4133 [2018-10-01 00:37:17,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time [2018-10-01 00:37:17,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4133 states. [2018-10-01 00:37:21,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4133 to 2405. [2018-10-01 00:37:21,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2405 states. [2018-10-01 00:37:21,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 5566 transitions. [2018-10-01 00:37:21,333 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 5566 transitions. Word has length 17 [2018-10-01 00:37:21,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:37:21,333 INFO L480 AbstractCegarLoop]: Abstraction has 2405 states and 5566 transitions. [2018-10-01 00:37:21,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-01 00:37:21,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 5566 transitions. [2018-10-01 00:37:21,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-01 00:37:21,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:37:21,334 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:37:21,334 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:37:21,334 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:37:21,334 INFO L82 PathProgramCache]: Analyzing trace with hash 968834620, now seen corresponding path program 1 times [2018-10-01 00:37:21,335 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:37:21,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:37:21,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:37:21,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:37:21,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:37:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:37:21,417 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-01 00:37:21,417 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:37:21,417 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:37:21,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:37:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:37:21,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:37:21,663 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-01 00:37:21,683 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:37:21,683 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2018-10-01 00:37:21,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-01 00:37:21,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-01 00:37:21,683 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:37:21,684 INFO L87 Difference]: Start difference. First operand 2405 states and 5566 transitions. Second operand 18 states. Received shutdown request... [2018-10-01 00:38:05,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-01 00:38:05,282 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-01 00:38:05,287 WARN L206 ceAbstractionStarter]: Timeout [2018-10-01 00:38:05,288 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:38:05 BoogieIcfgContainer [2018-10-01 00:38:05,288 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:38:05,289 INFO L168 Benchmark]: Toolchain (without parser) took 802732.31 ms. Allocated memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: -217.6 MB). Free memory was 1.5 GB in the beginning and 939.0 MB in the end (delta: 519.9 MB). Peak memory consumption was 302.3 MB. Max. memory is 7.1 GB. [2018-10-01 00:38:05,291 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:38:05,291 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.34 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:38:05,292 INFO L168 Benchmark]: Boogie Preprocessor took 55.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:38:05,292 INFO L168 Benchmark]: RCFGBuilder took 860.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-01 00:38:05,293 INFO L168 Benchmark]: TraceAbstraction took 801751.49 ms. Allocated memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: -217.6 MB). Free memory was 1.4 GB in the beginning and 939.0 MB in the end (delta: 488.2 MB). Peak memory consumption was 270.6 MB. Max. memory is 7.1 GB. [2018-10-01 00:38:05,297 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 56.34 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 860.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 801751.49 ms. Allocated memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: -217.6 MB). Free memory was 1.4 GB in the beginning and 939.0 MB in the end (delta: 488.2 MB). Peak memory consumption was 270.6 MB. 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 (2405states) and FLOYD_HOARE automaton (currently 79 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (2045 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 (2405states) and FLOYD_HOARE automaton (currently 79 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (2045 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 (2405states) and FLOYD_HOARE automaton (currently 79 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (2045 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 (2405states) and FLOYD_HOARE automaton (currently 79 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (2045 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 (2405states) and FLOYD_HOARE automaton (currently 79 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (2045 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 (2405states) and FLOYD_HOARE automaton (currently 79 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (2045 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 (2405states) and FLOYD_HOARE automaton (currently 79 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (2045 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 (2405states) and FLOYD_HOARE automaton (currently 79 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (2045 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 (2405states) and FLOYD_HOARE automaton (currently 79 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (2045 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 (2405states) and FLOYD_HOARE automaton (currently 79 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (2045 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 (2405states) and FLOYD_HOARE automaton (currently 79 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (2045 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 (2405states) and FLOYD_HOARE automaton (currently 79 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (2045 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 (2405states) and FLOYD_HOARE automaton (currently 79 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (2045 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 (2405states) and FLOYD_HOARE automaton (currently 79 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (2045 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 801.6s OverallTime, 48 OverallIterations, 2 TraceHistogramMax, 747.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14135 SDtfs, 49072 SDslu, 57007 SDs, 0 SdLazy, 136500 SolverSat, 11109 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 179.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2287 GetRequests, 272 SyntacticMatches, 1 SemanticMatches, 2014 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 60.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2405occurred in iteration=47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 42.3s AutomataMinimizationTime, 47 MinimizatonAttempts, 31546 StatesRemovedByMinimization, 47 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 1000 NumberOfCodeBlocks, 1000 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 930 ConstructedInterpolants, 90 QuantifiedInterpolants, 61290 SizeOfPredicates, 120 NumberOfNonLiveVariables, 881 ConjunctsInSsa, 211 ConjunctsInUnsatCore, 70 InterpolantComputations, 28 PerfectInterpolantSequences, 51/115 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_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-38-05-310.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_00-38-05-310.csv Completed graceful shutdown