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-09-30 20:34:14,796 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:34:14,799 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:34:14,811 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:34:14,811 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:34:14,812 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:34:14,813 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:34:14,815 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:34:14,817 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:34:14,818 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:34:14,819 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:34:14,819 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:34:14,820 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:34:14,821 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:34:14,823 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:34:14,824 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:34:14,824 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:34:14,826 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:34:14,828 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:34:14,830 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:34:14,831 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:34:14,833 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:34:14,836 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:34:14,836 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:34:14,836 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:34:14,837 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:34:14,839 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:34:14,840 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:34:14,840 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:34:14,842 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:34:14,842 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:34:14,843 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:34:14,843 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:34:14,843 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:34:14,845 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:34:14,845 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:34:14,846 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-30 20:34:14,873 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:34:14,874 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:34:14,875 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:34:14,875 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:34:14,876 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:34:14,876 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:34:14,876 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:34:14,876 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:34:14,877 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:34:14,877 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:34:14,878 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:34:14,878 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:34:14,878 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:34:14,878 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:34:14,879 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:34:14,879 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:34:14,879 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:34:14,879 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:34:14,880 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:34:14,881 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:34:14,881 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:34:14,881 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:34:14,881 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:34:14,881 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:34:14,881 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:34:14,882 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:34:14,882 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:34:14,882 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:34:14,883 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:34:14,883 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:34:14,883 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 20:34:14,937 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:34:14,952 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:34:14,959 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:34:14,960 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:34:14,961 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:34:14,962 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-09-30 20:34:14,962 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl' [2018-09-30 20:34:15,059 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:34:15,062 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:34:15,063 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:34:15,063 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:34:15,064 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:34:15,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:15" (1/1) ... [2018-09-30 20:34:15,101 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:15" (1/1) ... [2018-09-30 20:34:15,106 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 20:34:15,106 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 20:34:15,106 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 20:34:15,109 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:34:15,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:34:15,110 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:34:15,110 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:34:15,121 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:15" (1/1) ... [2018-09-30 20:34:15,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:15" (1/1) ... [2018-09-30 20:34:15,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:15" (1/1) ... [2018-09-30 20:34:15,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:15" (1/1) ... [2018-09-30 20:34:15,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:15" (1/1) ... [2018-09-30 20:34:15,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:15" (1/1) ... [2018-09-30 20:34:15,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:15" (1/1) ... [2018-09-30 20:34:15,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:34:15,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:34:15,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:34:15,175 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:34:15,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:34:15,266 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-30 20:34:15,267 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-30 20:34:15,267 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-30 20:34:16,018 INFO L345 CfgBuilder]: Using library mode [2018-09-30 20:34:16,019 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:34:16 BoogieIcfgContainer [2018-09-30 20:34:16,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:34:16,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:34:16,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:34:16,023 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:34:16,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:15" (1/2) ... [2018-09-30 20:34:16,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6371e3ef and model type threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:34:16, skipping insertion in model container [2018-09-30 20:34:16,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:34:16" (2/2) ... [2018-09-30 20:34:16,027 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out.bpl [2018-09-30 20:34:16,036 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:34:16,044 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-09-30 20:34:16,093 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:34:16,093 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:34:16,094 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:34:16,094 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:34:16,094 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:34:16,094 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:34:16,094 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:34:16,094 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:34:16,094 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:34:16,112 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-09-30 20:34:16,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 20:34:16,120 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:16,121 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:16,123 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:16,129 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:16,130 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-09-30 20:34:16,132 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:16,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:16,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:16,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:16,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:16,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:16,522 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:16,523 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:34:16,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 20:34:16,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 20:34:16,539 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:16,541 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-09-30 20:34:19,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:19,966 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-09-30 20:34:19,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 20:34:19,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-30 20:34:19,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:20,008 INFO L225 Difference]: With dead ends: 163 [2018-09-30 20:34:20,008 INFO L226 Difference]: Without dead ends: 158 [2018-09-30 20:34:20,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-09-30 20:34:20,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-30 20:34:20,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-09-30 20:34:20,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-30 20:34:20,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-09-30 20:34:20,072 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-09-30 20:34:20,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:20,073 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-09-30 20:34:20,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 20:34:20,073 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-09-30 20:34:20,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 20:34:20,074 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:20,075 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:20,080 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:20,080 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:20,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-09-30 20:34:20,080 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:20,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:20,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:20,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:20,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:20,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:20,162 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:20,162 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:34:20,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 20:34:20,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 20:34:20,164 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:20,165 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-09-30 20:34:22,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:22,637 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-09-30 20:34:22,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 20:34:22,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-30 20:34:22,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:22,642 INFO L225 Difference]: With dead ends: 188 [2018-09-30 20:34:22,642 INFO L226 Difference]: Without dead ends: 183 [2018-09-30 20:34:22,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:34:22,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-30 20:34:22,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-09-30 20:34:22,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-30 20:34:22,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-09-30 20:34:22,678 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-09-30 20:34:22,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:22,678 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-09-30 20:34:22,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 20:34:22,679 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-09-30 20:34:22,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:34:22,680 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:22,680 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:22,681 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:22,681 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:22,681 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-09-30 20:34:22,681 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:22,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:22,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:22,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:22,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:22,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:22,771 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:22,771 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:34:22,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:34:22,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:34:22,772 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:22,772 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-09-30 20:34:27,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:27,118 INFO L93 Difference]: Finished difference Result 361 states and 808 transitions. [2018-09-30 20:34:27,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:34:27,119 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-30 20:34:27,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:27,123 INFO L225 Difference]: With dead ends: 361 [2018-09-30 20:34:27,124 INFO L226 Difference]: Without dead ends: 349 [2018-09-30 20:34:27,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:34:27,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-09-30 20:34:27,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 174. [2018-09-30 20:34:27,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-09-30 20:34:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 387 transitions. [2018-09-30 20:34:27,164 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 387 transitions. Word has length 9 [2018-09-30 20:34:27,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:27,165 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 387 transitions. [2018-09-30 20:34:27,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:34:27,165 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 387 transitions. [2018-09-30 20:34:27,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:34:27,166 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:27,167 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:27,167 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:27,168 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:27,168 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-09-30 20:34:27,168 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:27,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:27,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:27,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:27,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:27,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:27,285 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:27,285 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:34:27,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:34:27,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:34:27,286 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:27,286 INFO L87 Difference]: Start difference. First operand 174 states and 387 transitions. Second operand 7 states. [2018-09-30 20:34:30,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:30,412 INFO L93 Difference]: Finished difference Result 307 states and 694 transitions. [2018-09-30 20:34:30,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 20:34:30,412 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-30 20:34:30,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:30,416 INFO L225 Difference]: With dead ends: 307 [2018-09-30 20:34:30,416 INFO L226 Difference]: Without dead ends: 302 [2018-09-30 20:34:30,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:34:30,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-09-30 20:34:30,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 203. [2018-09-30 20:34:30,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-30 20:34:30,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-09-30 20:34:30,452 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-09-30 20:34:30,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:30,452 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-09-30 20:34:30,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:34:30,452 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-09-30 20:34:30,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:34:30,455 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:30,455 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:30,455 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:30,456 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:30,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-09-30 20:34:30,456 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:30,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:30,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:30,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:30,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:30,786 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:30,786 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:34:30,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:34:30,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:34:30,787 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:30,787 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 8 states. [2018-09-30 20:34:38,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:38,751 INFO L93 Difference]: Finished difference Result 741 states and 1656 transitions. [2018-09-30 20:34:38,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 20:34:38,752 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:34:38,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:38,759 INFO L225 Difference]: With dead ends: 741 [2018-09-30 20:34:38,759 INFO L226 Difference]: Without dead ends: 733 [2018-09-30 20:34:38,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-09-30 20:34:38,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-09-30 20:34:38,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 315. [2018-09-30 20:34:38,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-09-30 20:34:38,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 743 transitions. [2018-09-30 20:34:38,813 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 743 transitions. Word has length 12 [2018-09-30 20:34:38,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:38,813 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 743 transitions. [2018-09-30 20:34:38,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:34:38,813 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 743 transitions. [2018-09-30 20:34:38,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:34:38,815 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:38,816 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:38,816 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:38,816 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:38,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-09-30 20:34:38,817 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:38,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:38,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:38,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:38,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:38,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:38,916 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:38,916 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:34:38,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:34:38,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:34:38,917 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:38,917 INFO L87 Difference]: Start difference. First operand 315 states and 743 transitions. Second operand 8 states. [2018-09-30 20:34:52,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:52,699 INFO L93 Difference]: Finished difference Result 797 states and 1784 transitions. [2018-09-30 20:34:52,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 20:34:52,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:34:52,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:52,705 INFO L225 Difference]: With dead ends: 797 [2018-09-30 20:34:52,706 INFO L226 Difference]: Without dead ends: 789 [2018-09-30 20:34:52,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-09-30 20:34:52,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-09-30 20:34:52,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 319. [2018-09-30 20:34:52,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-09-30 20:34:52,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 751 transitions. [2018-09-30 20:34:52,765 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 751 transitions. Word has length 12 [2018-09-30 20:34:52,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:52,765 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 751 transitions. [2018-09-30 20:34:52,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:34:52,766 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 751 transitions. [2018-09-30 20:34:52,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:34:52,767 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:52,767 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:52,768 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:52,768 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:52,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-09-30 20:34:52,768 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:52,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:52,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:52,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:52,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:53,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:53,005 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:53,005 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:34:53,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:34:53,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:34:53,006 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:53,006 INFO L87 Difference]: Start difference. First operand 319 states and 751 transitions. Second operand 8 states. [2018-09-30 20:34:59,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:59,677 INFO L93 Difference]: Finished difference Result 684 states and 1538 transitions. [2018-09-30 20:34:59,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 20:34:59,678 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:34:59,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:59,683 INFO L225 Difference]: With dead ends: 684 [2018-09-30 20:34:59,683 INFO L226 Difference]: Without dead ends: 676 [2018-09-30 20:34:59,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:34:59,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-09-30 20:34:59,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 330. [2018-09-30 20:34:59,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-09-30 20:34:59,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 778 transitions. [2018-09-30 20:34:59,750 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 778 transitions. Word has length 12 [2018-09-30 20:34:59,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:59,750 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 778 transitions. [2018-09-30 20:34:59,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:34:59,751 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 778 transitions. [2018-09-30 20:34:59,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:34:59,752 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:59,752 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:59,752 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:59,753 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:59,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-09-30 20:34:59,753 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:59,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:59,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:59,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:59,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:00,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:00,021 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:35:00,021 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:35:00,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:35:00,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:35:00,022 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:00,022 INFO L87 Difference]: Start difference. First operand 330 states and 778 transitions. Second operand 8 states. [2018-09-30 20:35:05,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:05,037 INFO L93 Difference]: Finished difference Result 605 states and 1360 transitions. [2018-09-30 20:35:05,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 20:35:05,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:35:05,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:05,042 INFO L225 Difference]: With dead ends: 605 [2018-09-30 20:35:05,042 INFO L226 Difference]: Without dead ends: 597 [2018-09-30 20:35:05,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:35:05,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-09-30 20:35:05,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 337. [2018-09-30 20:35:05,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-09-30 20:35:05,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 794 transitions. [2018-09-30 20:35:05,102 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 794 transitions. Word has length 12 [2018-09-30 20:35:05,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:05,102 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 794 transitions. [2018-09-30 20:35:05,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:35:05,102 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 794 transitions. [2018-09-30 20:35:05,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:35:05,103 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:05,104 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:05,104 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:05,104 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:05,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1088621469, now seen corresponding path program 1 times [2018-09-30 20:35:05,105 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:05,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:05,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:05,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:05,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:05,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:05,358 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:35:05,358 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:35:05,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:35:05,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:35:05,359 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:05,360 INFO L87 Difference]: Start difference. First operand 337 states and 794 transitions. Second operand 8 states. [2018-09-30 20:35:12,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:12,419 INFO L93 Difference]: Finished difference Result 935 states and 2104 transitions. [2018-09-30 20:35:12,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 20:35:12,420 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:35:12,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:12,428 INFO L225 Difference]: With dead ends: 935 [2018-09-30 20:35:12,428 INFO L226 Difference]: Without dead ends: 927 [2018-09-30 20:35:12,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-09-30 20:35:12,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-09-30 20:35:12,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 343. [2018-09-30 20:35:12,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-09-30 20:35:12,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 808 transitions. [2018-09-30 20:35:12,519 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 808 transitions. Word has length 12 [2018-09-30 20:35:12,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:12,519 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 808 transitions. [2018-09-30 20:35:12,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:35:12,519 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 808 transitions. [2018-09-30 20:35:12,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:35:12,520 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:12,521 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:12,521 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:12,521 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:12,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1085821115, now seen corresponding path program 1 times [2018-09-30 20:35:12,522 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:12,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:12,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:12,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:12,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:13,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:13,222 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:35:13,222 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:35:13,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:35:13,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:35:13,223 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:13,223 INFO L87 Difference]: Start difference. First operand 343 states and 808 transitions. Second operand 8 states. [2018-09-30 20:35:20,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:20,786 INFO L93 Difference]: Finished difference Result 923 states and 2061 transitions. [2018-09-30 20:35:20,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 20:35:20,787 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:35:20,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:20,793 INFO L225 Difference]: With dead ends: 923 [2018-09-30 20:35:20,793 INFO L226 Difference]: Without dead ends: 915 [2018-09-30 20:35:20,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-09-30 20:35:20,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-09-30 20:35:20,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 354. [2018-09-30 20:35:20,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-09-30 20:35:20,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 835 transitions. [2018-09-30 20:35:20,886 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 835 transitions. Word has length 12 [2018-09-30 20:35:20,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:20,887 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 835 transitions. [2018-09-30 20:35:20,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:35:20,887 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 835 transitions. [2018-09-30 20:35:20,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:35:20,888 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:20,888 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:20,888 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:20,889 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:20,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1085923260, now seen corresponding path program 1 times [2018-09-30 20:35:20,889 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:20,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:20,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:20,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:20,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:20,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:20,980 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:35:20,981 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:35:20,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:35:20,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:35:20,982 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:20,982 INFO L87 Difference]: Start difference. First operand 354 states and 835 transitions. Second operand 8 states. [2018-09-30 20:35:26,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:26,473 INFO L93 Difference]: Finished difference Result 837 states and 1868 transitions. [2018-09-30 20:35:26,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 20:35:26,473 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:35:26,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:26,479 INFO L225 Difference]: With dead ends: 837 [2018-09-30 20:35:26,479 INFO L226 Difference]: Without dead ends: 829 [2018-09-30 20:35:26,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:35:26,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-09-30 20:35:26,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 339. [2018-09-30 20:35:26,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-09-30 20:35:26,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 800 transitions. [2018-09-30 20:35:26,585 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 800 transitions. Word has length 12 [2018-09-30 20:35:26,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:26,586 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 800 transitions. [2018-09-30 20:35:26,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:35:26,586 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 800 transitions. [2018-09-30 20:35:26,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:35:26,587 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:26,587 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:26,588 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:26,588 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:26,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1383194877, now seen corresponding path program 1 times [2018-09-30 20:35:26,588 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:26,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:26,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:26,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:26,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:26,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:26,831 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:35:26,831 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:35:26,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:35:26,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:35:26,832 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:26,832 INFO L87 Difference]: Start difference. First operand 339 states and 800 transitions. Second operand 8 states. [2018-09-30 20:35:35,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:35,132 INFO L93 Difference]: Finished difference Result 996 states and 2227 transitions. [2018-09-30 20:35:35,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-30 20:35:35,133 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:35:35,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:35,138 INFO L225 Difference]: With dead ends: 996 [2018-09-30 20:35:35,138 INFO L226 Difference]: Without dead ends: 988 [2018-09-30 20:35:35,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-09-30 20:35:35,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-09-30 20:35:35,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 381. [2018-09-30 20:35:35,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-30 20:35:35,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-09-30 20:35:35,268 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-09-30 20:35:35,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:35,269 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-09-30 20:35:35,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:35:35,269 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-09-30 20:35:35,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:35:35,270 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:35,270 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:35,271 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:35,271 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:35,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1383297022, now seen corresponding path program 1 times [2018-09-30 20:35:35,271 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:35,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:35,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:35,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:35,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:35,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:35,360 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:35:35,361 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:35:35,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:35:35,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:35:35,361 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:35,362 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-09-30 20:35:41,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:41,958 INFO L93 Difference]: Finished difference Result 913 states and 2034 transitions. [2018-09-30 20:35:41,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 20:35:41,959 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:35:41,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:41,964 INFO L225 Difference]: With dead ends: 913 [2018-09-30 20:35:41,965 INFO L226 Difference]: Without dead ends: 905 [2018-09-30 20:35:41,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:35:41,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-09-30 20:35:42,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 371. [2018-09-30 20:35:42,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-09-30 20:35:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 890 transitions. [2018-09-30 20:35:42,099 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 890 transitions. Word has length 12 [2018-09-30 20:35:42,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:42,099 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 890 transitions. [2018-09-30 20:35:42,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:35:42,099 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 890 transitions. [2018-09-30 20:35:42,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:35:42,100 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:42,100 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:42,101 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:42,101 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:42,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1392211258, now seen corresponding path program 1 times [2018-09-30 20:35:42,101 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:42,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:42,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:42,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:42,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:42,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:42,249 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:35:42,250 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:35:42,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:35:42,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:35:42,251 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:42,251 INFO L87 Difference]: Start difference. First operand 371 states and 890 transitions. Second operand 8 states. [2018-09-30 20:35:47,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:47,925 INFO L93 Difference]: Finished difference Result 886 states and 2009 transitions. [2018-09-30 20:35:47,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 20:35:47,925 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:35:47,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:47,928 INFO L225 Difference]: With dead ends: 886 [2018-09-30 20:35:47,929 INFO L226 Difference]: Without dead ends: 878 [2018-09-30 20:35:47,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:35:47,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2018-09-30 20:35:48,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 372. [2018-09-30 20:35:48,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-09-30 20:35:48,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 891 transitions. [2018-09-30 20:35:48,042 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 891 transitions. Word has length 12 [2018-09-30 20:35:48,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:48,043 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 891 transitions. [2018-09-30 20:35:48,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:35:48,043 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 891 transitions. [2018-09-30 20:35:48,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:35:48,043 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:48,044 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:48,044 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:48,044 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:48,044 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-09-30 20:35:48,045 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:48,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:48,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:48,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:48,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:48,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:48,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:48,147 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:35:48,147 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:35:48,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:35:48,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:35:48,148 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:48,148 INFO L87 Difference]: Start difference. First operand 372 states and 891 transitions. Second operand 9 states. [2018-09-30 20:35:54,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:54,301 INFO L93 Difference]: Finished difference Result 801 states and 1838 transitions. [2018-09-30 20:35:54,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 20:35:54,302 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:35:54,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:54,306 INFO L225 Difference]: With dead ends: 801 [2018-09-30 20:35:54,306 INFO L226 Difference]: Without dead ends: 793 [2018-09-30 20:35:54,306 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:35:54,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-09-30 20:35:54,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 393. [2018-09-30 20:35:54,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-09-30 20:35:54,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 949 transitions. [2018-09-30 20:35:54,450 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 949 transitions. Word has length 12 [2018-09-30 20:35:54,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:54,450 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 949 transitions. [2018-09-30 20:35:54,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:35:54,450 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 949 transitions. [2018-09-30 20:35:54,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:35:54,451 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:54,451 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:54,452 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:54,452 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:54,452 INFO L82 PathProgramCache]: Analyzing trace with hash 192619318, now seen corresponding path program 1 times [2018-09-30 20:35:54,452 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:54,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:54,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:54,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:54,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:54,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:54,554 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:35:54,554 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:35:54,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:35:54,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:35:54,555 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:54,555 INFO L87 Difference]: Start difference. First operand 393 states and 949 transitions. Second operand 9 states. [2018-09-30 20:36:02,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:02,486 INFO L93 Difference]: Finished difference Result 962 states and 2211 transitions. [2018-09-30 20:36:02,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 20:36:02,487 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:36:02,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:02,492 INFO L225 Difference]: With dead ends: 962 [2018-09-30 20:36:02,492 INFO L226 Difference]: Without dead ends: 954 [2018-09-30 20:36:02,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:36:02,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-09-30 20:36:02,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 409. [2018-09-30 20:36:02,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-09-30 20:36:02,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 997 transitions. [2018-09-30 20:36:02,643 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 997 transitions. Word has length 12 [2018-09-30 20:36:02,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:02,644 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 997 transitions. [2018-09-30 20:36:02,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:36:02,644 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 997 transitions. [2018-09-30 20:36:02,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:36:02,644 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:02,644 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:02,645 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:02,645 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:02,645 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-09-30 20:36:02,645 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:02,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:02,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:02,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:02,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:02,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:02,729 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:36:02,729 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:36:02,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:36:02,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:36:02,730 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:02,731 INFO L87 Difference]: Start difference. First operand 409 states and 997 transitions. Second operand 9 states. [2018-09-30 20:36:10,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:10,596 INFO L93 Difference]: Finished difference Result 1000 states and 2329 transitions. [2018-09-30 20:36:10,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 20:36:10,597 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:36:10,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:10,603 INFO L225 Difference]: With dead ends: 1000 [2018-09-30 20:36:10,603 INFO L226 Difference]: Without dead ends: 992 [2018-09-30 20:36:10,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:36:10,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-09-30 20:36:10,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 430. [2018-09-30 20:36:10,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-09-30 20:36:10,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1052 transitions. [2018-09-30 20:36:10,781 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1052 transitions. Word has length 12 [2018-09-30 20:36:10,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:10,781 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 1052 transitions. [2018-09-30 20:36:10,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:36:10,781 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1052 transitions. [2018-09-30 20:36:10,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:36:10,782 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:10,782 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:10,782 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:10,783 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:10,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1320238459, now seen corresponding path program 1 times [2018-09-30 20:36:10,783 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:10,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:10,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:10,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:10,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:10,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:10,874 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:36:10,874 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:36:10,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:36:10,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:36:10,875 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:10,875 INFO L87 Difference]: Start difference. First operand 430 states and 1052 transitions. Second operand 9 states. [2018-09-30 20:36:19,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:19,664 INFO L93 Difference]: Finished difference Result 1065 states and 2466 transitions. [2018-09-30 20:36:19,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 20:36:19,665 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:36:19,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:19,671 INFO L225 Difference]: With dead ends: 1065 [2018-09-30 20:36:19,671 INFO L226 Difference]: Without dead ends: 1057 [2018-09-30 20:36:19,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:36:19,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2018-09-30 20:36:19,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 471. [2018-09-30 20:36:19,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-09-30 20:36:19,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1168 transitions. [2018-09-30 20:36:19,882 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1168 transitions. Word has length 12 [2018-09-30 20:36:19,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:19,883 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 1168 transitions. [2018-09-30 20:36:19,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:36:19,883 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1168 transitions. [2018-09-30 20:36:19,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:36:19,884 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:19,884 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:19,884 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:19,885 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:19,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1320340604, now seen corresponding path program 1 times [2018-09-30 20:36:19,885 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:19,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:19,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:19,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:19,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:19,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:19,990 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:36:19,990 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:36:19,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:36:19,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:36:19,991 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:19,991 INFO L87 Difference]: Start difference. First operand 471 states and 1168 transitions. Second operand 9 states. [2018-09-30 20:36:29,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:29,980 INFO L93 Difference]: Finished difference Result 1227 states and 2851 transitions. [2018-09-30 20:36:29,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-30 20:36:29,981 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:36:29,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:29,987 INFO L225 Difference]: With dead ends: 1227 [2018-09-30 20:36:29,987 INFO L226 Difference]: Without dead ends: 1219 [2018-09-30 20:36:29,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-09-30 20:36:29,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-09-30 20:36:30,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 438. [2018-09-30 20:36:30,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-09-30 20:36:30,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1072 transitions. [2018-09-30 20:36:30,201 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1072 transitions. Word has length 12 [2018-09-30 20:36:30,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:30,202 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 1072 transitions. [2018-09-30 20:36:30,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:36:30,202 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1072 transitions. [2018-09-30 20:36:30,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:36:30,202 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:30,203 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:30,203 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:30,203 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:30,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-09-30 20:36:30,203 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:30,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:30,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:30,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:30,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:30,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:30,306 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:36:30,306 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:36:30,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:36:30,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:36:30,307 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:30,307 INFO L87 Difference]: Start difference. First operand 438 states and 1072 transitions. Second operand 9 states. [2018-09-30 20:36:38,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:38,473 INFO L93 Difference]: Finished difference Result 1076 states and 2511 transitions. [2018-09-30 20:36:38,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 20:36:38,473 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:36:38,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:38,479 INFO L225 Difference]: With dead ends: 1076 [2018-09-30 20:36:38,479 INFO L226 Difference]: Without dead ends: 1068 [2018-09-30 20:36:38,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-09-30 20:36:38,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2018-09-30 20:36:38,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 445. [2018-09-30 20:36:38,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-09-30 20:36:38,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1088 transitions. [2018-09-30 20:36:38,725 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1088 transitions. Word has length 12 [2018-09-30 20:36:38,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:38,726 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 1088 transitions. [2018-09-30 20:36:38,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:36:38,726 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1088 transitions. [2018-09-30 20:36:38,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:36:38,726 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:38,727 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:38,727 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:38,727 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:38,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1838990990, now seen corresponding path program 1 times [2018-09-30 20:36:38,727 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:38,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:38,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:38,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:38,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:38,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:38,821 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:36:38,821 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:36:38,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:36:38,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:36:38,822 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:38,823 INFO L87 Difference]: Start difference. First operand 445 states and 1088 transitions. Second operand 9 states. [2018-09-30 20:36:46,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:46,402 INFO L93 Difference]: Finished difference Result 1111 states and 2606 transitions. [2018-09-30 20:36:46,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:36:46,403 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:36:46,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:46,408 INFO L225 Difference]: With dead ends: 1111 [2018-09-30 20:36:46,408 INFO L226 Difference]: Without dead ends: 1103 [2018-09-30 20:36:46,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:36:46,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2018-09-30 20:36:46,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 520. [2018-09-30 20:36:46,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-09-30 20:36:46,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1295 transitions. [2018-09-30 20:36:46,734 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1295 transitions. Word has length 12 [2018-09-30 20:36:46,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:46,735 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 1295 transitions. [2018-09-30 20:36:46,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:36:46,735 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1295 transitions. [2018-09-30 20:36:46,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:36:46,735 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:46,736 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:46,736 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:46,736 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:46,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1838888845, now seen corresponding path program 1 times [2018-09-30 20:36:46,736 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:46,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:46,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:46,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:46,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:46,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:46,822 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:36:46,822 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:36:46,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:36:46,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:36:46,823 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:46,823 INFO L87 Difference]: Start difference. First operand 520 states and 1295 transitions. Second operand 9 states. [2018-09-30 20:36:56,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:56,959 INFO L93 Difference]: Finished difference Result 1304 states and 3059 transitions. [2018-09-30 20:36:56,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 20:36:56,961 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:36:56,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:56,966 INFO L225 Difference]: With dead ends: 1304 [2018-09-30 20:36:56,966 INFO L226 Difference]: Without dead ends: 1296 [2018-09-30 20:36:56,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:36:56,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-09-30 20:36:57,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 487. [2018-09-30 20:36:57,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-09-30 20:36:57,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1199 transitions. [2018-09-30 20:36:57,282 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1199 transitions. Word has length 12 [2018-09-30 20:36:57,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:57,282 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 1199 transitions. [2018-09-30 20:36:57,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:36:57,283 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1199 transitions. [2018-09-30 20:36:57,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:36:57,283 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:57,283 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:57,284 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:57,284 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:57,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1731038698, now seen corresponding path program 1 times [2018-09-30 20:36:57,284 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:57,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:57,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:57,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:57,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:57,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:57,365 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:36:57,366 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:36:57,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:36:57,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:36:57,367 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:57,367 INFO L87 Difference]: Start difference. First operand 487 states and 1199 transitions. Second operand 9 states. [2018-09-30 20:37:08,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:08,417 INFO L93 Difference]: Finished difference Result 1370 states and 3217 transitions. [2018-09-30 20:37:08,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 20:37:08,419 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:37:08,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:08,427 INFO L225 Difference]: With dead ends: 1370 [2018-09-30 20:37:08,427 INFO L226 Difference]: Without dead ends: 1362 [2018-09-30 20:37:08,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:37:08,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2018-09-30 20:37:08,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 479. [2018-09-30 20:37:08,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-09-30 20:37:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1179 transitions. [2018-09-30 20:37:08,755 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1179 transitions. Word has length 12 [2018-09-30 20:37:08,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:08,755 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 1179 transitions. [2018-09-30 20:37:08,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:37:08,755 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1179 transitions. [2018-09-30 20:37:08,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:37:08,756 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:08,756 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:08,757 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:08,757 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:08,757 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-09-30 20:37:08,757 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:08,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:08,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:08,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:08,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:08,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:08,859 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:37:08,859 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:37:08,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:37:08,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:37:08,860 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:08,860 INFO L87 Difference]: Start difference. First operand 479 states and 1179 transitions. Second operand 9 states. [2018-09-30 20:37:15,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:15,822 INFO L93 Difference]: Finished difference Result 1298 states and 3068 transitions. [2018-09-30 20:37:15,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 20:37:15,823 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:37:15,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:15,827 INFO L225 Difference]: With dead ends: 1298 [2018-09-30 20:37:15,827 INFO L226 Difference]: Without dead ends: 1290 [2018-09-30 20:37:15,827 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:37:15,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-09-30 20:37:16,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 602. [2018-09-30 20:37:16,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-09-30 20:37:16,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-09-30 20:37:16,290 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-09-30 20:37:16,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:16,290 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-09-30 20:37:16,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:37:16,291 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-09-30 20:37:16,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:37:16,291 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:16,292 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:16,292 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:16,292 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:16,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1080362888, now seen corresponding path program 1 times [2018-09-30 20:37:16,292 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:16,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:16,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:16,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:16,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:16,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:16,565 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:37:16,565 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:37:16,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:37:16,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:37:16,565 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:16,565 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-09-30 20:37:17,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:17,617 INFO L93 Difference]: Finished difference Result 1242 states and 3091 transitions. [2018-09-30 20:37:17,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:37:17,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-30 20:37:17,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:17,620 INFO L225 Difference]: With dead ends: 1242 [2018-09-30 20:37:17,620 INFO L226 Difference]: Without dead ends: 673 [2018-09-30 20:37:17,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:37:17,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-09-30 20:37:18,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 612. [2018-09-30 20:37:18,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-09-30 20:37:18,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1463 transitions. [2018-09-30 20:37:18,109 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1463 transitions. Word has length 13 [2018-09-30 20:37:18,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:18,109 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 1463 transitions. [2018-09-30 20:37:18,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:37:18,109 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1463 transitions. [2018-09-30 20:37:18,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:37:18,110 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:18,110 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:18,111 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:18,111 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:18,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1652407871, now seen corresponding path program 1 times [2018-09-30 20:37:18,111 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:18,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:18,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:18,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:18,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:18,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:18,213 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:37:18,213 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-09-30 20:37:18,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:18,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:37:19,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:19,185 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:37:19,186 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-30 20:37:19,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 20:37:19,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 20:37:19,186 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:19,187 INFO L87 Difference]: Start difference. First operand 612 states and 1463 transitions. Second operand 16 states. [2018-09-30 20:37:26,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:26,397 INFO L93 Difference]: Finished difference Result 854 states and 1987 transitions. [2018-09-30 20:37:26,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 20:37:26,398 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-09-30 20:37:26,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:26,401 INFO L225 Difference]: With dead ends: 854 [2018-09-30 20:37:26,401 INFO L226 Difference]: Without dead ends: 849 [2018-09-30 20:37:26,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-09-30 20:37:26,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-09-30 20:37:27,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 690. [2018-09-30 20:37:27,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-30 20:37:27,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1639 transitions. [2018-09-30 20:37:27,119 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1639 transitions. Word has length 13 [2018-09-30 20:37:27,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:27,119 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1639 transitions. [2018-09-30 20:37:27,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 20:37:27,119 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1639 transitions. [2018-09-30 20:37:27,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:37:27,120 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:27,120 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:27,121 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:27,121 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:27,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1456173380, now seen corresponding path program 1 times [2018-09-30 20:37:27,121 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:27,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:27,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:27,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:27,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:27,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:27,271 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:37:27,271 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:37:27,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:37:27,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:37:27,272 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:27,272 INFO L87 Difference]: Start difference. First operand 690 states and 1639 transitions. Second operand 5 states. [2018-09-30 20:37:28,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:28,843 INFO L93 Difference]: Finished difference Result 1308 states and 3113 transitions. [2018-09-30 20:37:28,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:37:28,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-30 20:37:28,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:28,846 INFO L225 Difference]: With dead ends: 1308 [2018-09-30 20:37:28,846 INFO L226 Difference]: Without dead ends: 709 [2018-09-30 20:37:28,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:37:28,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-09-30 20:37:29,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 690. [2018-09-30 20:37:29,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-30 20:37:29,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-09-30 20:37:29,893 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-09-30 20:37:29,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:29,894 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-09-30 20:37:29,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:37:29,894 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-09-30 20:37:29,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:37:29,895 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:29,895 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:29,896 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:29,896 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:29,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1952744875, now seen corresponding path program 1 times [2018-09-30 20:37:29,896 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:29,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:29,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:29,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:29,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:30,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:30,120 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:37:30,120 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-09-30 20:37:30,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:30,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:37:30,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:30,402 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:37:30,402 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 20:37:30,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 20:37:30,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 20:37:30,403 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:30,403 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 17 states. [2018-09-30 20:38:21,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:38:21,969 INFO L93 Difference]: Finished difference Result 2011 states and 4412 transitions. [2018-09-30 20:38:21,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-30 20:38:21,970 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 20:38:21,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:38:21,973 INFO L225 Difference]: With dead ends: 2011 [2018-09-30 20:38:21,974 INFO L226 Difference]: Without dead ends: 2003 [2018-09-30 20:38:21,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s Time [2018-09-30 20:38:21,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2018-09-30 20:38:23,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1151. [2018-09-30 20:38:23,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-09-30 20:38:23,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 2622 transitions. [2018-09-30 20:38:23,228 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 2622 transitions. Word has length 16 [2018-09-30 20:38:23,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:38:23,229 INFO L480 AbstractCegarLoop]: Abstraction has 1151 states and 2622 transitions. [2018-09-30 20:38:23,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 20:38:23,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 2622 transitions. [2018-09-30 20:38:23,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:38:23,230 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:38:23,230 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:38:23,230 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:38:23,230 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:38:23,231 INFO L82 PathProgramCache]: Analyzing trace with hash -51223093, now seen corresponding path program 1 times [2018-09-30 20:38:23,231 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:38:23,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:38:23,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:23,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:38:23,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:38:23,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:38:23,325 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:38:23,326 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-09-30 20:38:23,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:38:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:38:23,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2018-09-30 20:38:23,468 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-09-30 20:38:23,669 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:38:23,669 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 20:38:23,675 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 20:38:23,676 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:38:23 BoogieIcfgContainer [2018-09-30 20:38:23,676 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:38:23,677 INFO L168 Benchmark]: Toolchain (without parser) took 248617.67 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -110.6 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 110.3 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:38:23,679 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:38:23,682 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:38:23,683 INFO L168 Benchmark]: Boogie Preprocessor took 64.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:38:23,683 INFO L168 Benchmark]: RCFGBuilder took 844.35 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-09-30 20:38:23,684 INFO L168 Benchmark]: TraceAbstraction took 247655.99 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -110.6 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 78.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:38:23,689 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.22 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 46.06 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 64.74 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 844.35 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 247655.99 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -110.6 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 78.6 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 154). Cancelled while BasicCegarLoop was analyzing trace of length 17 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 247]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 247). Cancelled while BasicCegarLoop was analyzing trace of length 17 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 229]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 229). Cancelled while BasicCegarLoop was analyzing trace of length 17 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 264]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 264). Cancelled while BasicCegarLoop was analyzing trace of length 17 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 284]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 284). Cancelled while BasicCegarLoop was analyzing trace of length 17 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 205]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 205). Cancelled while BasicCegarLoop was analyzing trace of length 17 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 240]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 240). Cancelled while BasicCegarLoop was analyzing trace of length 17 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 54). Cancelled while BasicCegarLoop was analyzing trace of length 17 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 277]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 277). Cancelled while BasicCegarLoop was analyzing trace of length 17 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 364]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 364). Cancelled while BasicCegarLoop was analyzing trace of length 17 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 294]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 294). Cancelled while BasicCegarLoop was analyzing trace of length 17 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 250]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 250). Cancelled while BasicCegarLoop was analyzing trace of length 17 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 332]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 332). Cancelled while BasicCegarLoop was analyzing trace of length 17 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 222]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 222). Cancelled while BasicCegarLoop was analyzing trace of length 17 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 247.5s OverallTime, 29 OverallIterations, 2 TraceHistogramMax, 233.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7904 SDtfs, 21643 SDslu, 23303 SDs, 0 SdLazy, 49457 SolverSat, 4911 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 58.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 747 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 715 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1151occurred in iteration=28, 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: 7.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 12731 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 356 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 326 ConstructedInterpolants, 14 QuantifiedInterpolants, 17016 SizeOfPredicates, 12 NumberOfNonLiveVariables, 75 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 30 InterpolantComputations, 26 PerfectInterpolantSequences, 12/19 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-09-30_20-38-23-714.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-09-30_20-38-23-714.csv Completed graceful shutdown