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_Reals.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 20:34:18,921 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:34:18,923 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:34:18,935 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:34:18,936 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:34:18,937 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:34:18,938 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:34:18,941 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:34:18,943 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:34:18,945 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:34:18,948 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:34:18,948 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:34:18,949 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:34:18,951 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:34:18,952 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:34:18,953 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:34:18,953 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:34:18,955 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:34:18,957 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:34:18,959 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:34:18,960 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:34:18,962 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:34:18,964 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:34:18,965 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:34:18,965 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:34:18,966 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:34:18,967 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:34:18,968 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:34:18,969 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:34:18,970 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:34:18,970 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:34:18,971 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:34:18,971 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:34:18,971 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:34:18,972 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:34:18,973 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:34:18,973 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-30 20:34:18,990 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:34:18,990 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:34:18,992 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:34:18,992 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:34:18,993 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:34:18,993 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:34:18,993 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:34:18,993 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:34:18,994 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:34:18,994 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:34:18,994 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:34:18,994 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:34:18,994 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:34:18,994 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:34:18,995 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:34:18,995 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:34:18,995 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:34:18,995 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:34:18,996 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:34:18,996 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:34:18,997 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:34:18,997 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:34:18,997 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:34:18,997 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:34:18,997 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:34:18,998 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:34:18,998 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:34:18,998 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:34:18,998 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:34:18,998 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:34:18,999 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 20:34:19,060 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:34:19,076 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:34:19,080 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:34:19,082 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:34:19,082 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:34:19,083 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl [2018-09-30 20:34:19,083 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl' [2018-09-30 20:34:19,153 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:34:19,157 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:34:19,157 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:34:19,158 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:34:19,158 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:34:19,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:19" (1/1) ... [2018-09-30 20:34:19,194 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:19" (1/1) ... [2018-09-30 20:34:19,199 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 20:34:19,200 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 20:34:19,200 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 20:34:19,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:34:19,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:34:19,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:34:19,204 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:34:19,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:19" (1/1) ... [2018-09-30 20:34:19,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:19" (1/1) ... [2018-09-30 20:34:19,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:19" (1/1) ... [2018-09-30 20:34:19,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:19" (1/1) ... [2018-09-30 20:34:19,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:19" (1/1) ... [2018-09-30 20:34:19,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:19" (1/1) ... [2018-09-30 20:34:19,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:19" (1/1) ... [2018-09-30 20:34:19,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:34:19,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:34:19,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:34:19,243 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:34:19,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:19" (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:19,338 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-30 20:34:19,338 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-30 20:34:19,338 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-30 20:34:20,127 INFO L345 CfgBuilder]: Using library mode [2018-09-30 20:34:20,128 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:34:20 BoogieIcfgContainer [2018-09-30 20:34:20,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:34:20,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:34:20,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:34:20,133 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:34:20,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:19" (1/2) ... [2018-09-30 20:34:20,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d00785 and model type threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:34:20, skipping insertion in model container [2018-09-30 20:34:20,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:34:20" (2/2) ... [2018-09-30 20:34:20,136 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out_Reals.bpl [2018-09-30 20:34:20,146 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:34:20,155 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-09-30 20:34:20,207 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:34:20,207 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:34:20,208 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:34:20,208 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:34:20,208 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:34:20,208 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:34:20,208 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:34:20,208 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:34:20,209 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:34:20,228 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-09-30 20:34:20,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 20:34:20,235 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:20,236 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:20,238 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:20,244 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:20,245 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-09-30 20:34:20,247 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:20,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:20,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:20,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:20,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:20,640 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,642 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:20,643 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:34:20,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 20:34:20,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 20:34:20,662 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:20,664 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-09-30 20:34:23,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:23,985 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-09-30 20:34:23,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 20:34:23,986 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-30 20:34:23,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:24,004 INFO L225 Difference]: With dead ends: 163 [2018-09-30 20:34:24,005 INFO L226 Difference]: Without dead ends: 158 [2018-09-30 20:34:24,008 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:24,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-30 20:34:24,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-09-30 20:34:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-30 20:34:24,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-09-30 20:34:24,072 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-09-30 20:34:24,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:24,073 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-09-30 20:34:24,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 20:34:24,073 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-09-30 20:34:24,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 20:34:24,074 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:24,075 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:24,078 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:24,079 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:24,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-09-30 20:34:24,079 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:24,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:24,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:24,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:24,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:24,167 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:24,167 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:34:24,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 20:34:24,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 20:34:24,170 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:24,171 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-09-30 20:34:26,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:26,572 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-09-30 20:34:26,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 20:34:26,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-30 20:34:26,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:26,578 INFO L225 Difference]: With dead ends: 188 [2018-09-30 20:34:26,579 INFO L226 Difference]: Without dead ends: 183 [2018-09-30 20:34:26,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:34:26,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-30 20:34:26,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-09-30 20:34:26,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-30 20:34:26,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-09-30 20:34:26,603 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-09-30 20:34:26,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:26,603 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-09-30 20:34:26,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 20:34:26,603 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-09-30 20:34:26,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:34:26,605 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:26,605 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:26,606 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:26,606 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:26,606 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-09-30 20:34:26,606 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:26,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:26,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:26,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:26,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:26,721 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:26,722 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:26,722 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:34:26,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:34:26,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:34:26,723 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:26,723 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-09-30 20:34:30,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:30,136 INFO L93 Difference]: Finished difference Result 283 states and 637 transitions. [2018-09-30 20:34:30,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:34:30,138 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-30 20:34:30,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:30,141 INFO L225 Difference]: With dead ends: 283 [2018-09-30 20:34:30,142 INFO L226 Difference]: Without dead ends: 278 [2018-09-30 20:34:30,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:34:30,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-09-30 20:34:30,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 147. [2018-09-30 20:34:30,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-30 20:34:30,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 323 transitions. [2018-09-30 20:34:30,172 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 323 transitions. Word has length 9 [2018-09-30 20:34:30,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:30,173 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 323 transitions. [2018-09-30 20:34:30,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:34:30,173 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 323 transitions. [2018-09-30 20:34:30,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:34:30,174 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:30,174 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:30,175 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:30,175 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:30,175 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-09-30 20:34:30,176 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:30,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:30,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:30,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:30,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:30,255 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,256 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:30,256 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:34:30,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:34:30,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:34:30,257 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:30,257 INFO L87 Difference]: Start difference. First operand 147 states and 323 transitions. Second operand 7 states. [2018-09-30 20:34:34,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:34,453 INFO L93 Difference]: Finished difference Result 387 states and 869 transitions. [2018-09-30 20:34:34,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:34:34,455 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-30 20:34:34,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:34,459 INFO L225 Difference]: With dead ends: 387 [2018-09-30 20:34:34,459 INFO L226 Difference]: Without dead ends: 375 [2018-09-30 20:34:34,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:34:34,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-09-30 20:34:34,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 203. [2018-09-30 20:34:34,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-30 20:34:34,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-09-30 20:34:34,504 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-09-30 20:34:34,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:34,504 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-09-30 20:34:34,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:34:34,504 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-09-30 20:34:34,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:34:34,506 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:34,506 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:34,507 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:34,507 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:34,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-09-30 20:34:34,508 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:34,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:34,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:34,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:34,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:34,601 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:34,602 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:34,602 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:34:34,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:34:34,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:34:34,603 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:34,603 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 9 states. [2018-09-30 20:34:41,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:41,084 INFO L93 Difference]: Finished difference Result 725 states and 1622 transitions. [2018-09-30 20:34:41,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 20:34:41,085 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:34:41,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:41,091 INFO L225 Difference]: With dead ends: 725 [2018-09-30 20:34:41,091 INFO L226 Difference]: Without dead ends: 717 [2018-09-30 20:34:41,092 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:34:41,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-09-30 20:34:41,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 354. [2018-09-30 20:34:41,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-09-30 20:34:41,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 843 transitions. [2018-09-30 20:34:41,162 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 843 transitions. Word has length 12 [2018-09-30 20:34:41,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:41,163 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 843 transitions. [2018-09-30 20:34:41,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:34:41,163 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 843 transitions. [2018-09-30 20:34:41,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:34:41,165 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:41,165 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:41,166 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:41,166 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:41,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-09-30 20:34:41,166 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:41,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:41,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:41,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:41,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:41,319 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:41,320 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:41,320 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:34:41,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:34:41,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:34:41,321 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:41,321 INFO L87 Difference]: Start difference. First operand 354 states and 843 transitions. Second operand 9 states. [2018-09-30 20:34:51,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:51,039 INFO L93 Difference]: Finished difference Result 1008 states and 2278 transitions. [2018-09-30 20:34:51,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 20:34:51,040 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:34:51,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:51,048 INFO L225 Difference]: With dead ends: 1008 [2018-09-30 20:34:51,048 INFO L226 Difference]: Without dead ends: 1000 [2018-09-30 20:34:51,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-09-30 20:34:51,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-09-30 20:34:51,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 364. [2018-09-30 20:34:51,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-09-30 20:34:51,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 868 transitions. [2018-09-30 20:34:51,127 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 868 transitions. Word has length 12 [2018-09-30 20:34:51,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:51,127 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 868 transitions. [2018-09-30 20:34:51,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:34:51,128 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 868 transitions. [2018-09-30 20:34:51,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:34:51,129 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:51,129 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:51,130 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:51,130 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:51,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-09-30 20:34:51,131 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:51,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:51,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:51,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:51,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:51,300 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:51,301 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:51,301 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:34:51,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:34:51,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:34:51,301 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:51,302 INFO L87 Difference]: Start difference. First operand 364 states and 868 transitions. Second operand 9 states. [2018-09-30 20:34:59,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:59,861 INFO L93 Difference]: Finished difference Result 924 states and 2097 transitions. [2018-09-30 20:34:59,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 20:34:59,862 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:34:59,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:59,868 INFO L225 Difference]: With dead ends: 924 [2018-09-30 20:34:59,868 INFO L226 Difference]: Without dead ends: 916 [2018-09-30 20:34:59,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:34:59,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2018-09-30 20:34:59,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 394. [2018-09-30 20:34:59,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-09-30 20:34:59,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 957 transitions. [2018-09-30 20:34:59,965 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 957 transitions. Word has length 12 [2018-09-30 20:34:59,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:59,965 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 957 transitions. [2018-09-30 20:34:59,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:34:59,965 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 957 transitions. [2018-09-30 20:34:59,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:34:59,966 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:59,967 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:59,967 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:59,967 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:59,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-09-30 20:34:59,968 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:59,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:59,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:59,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:59,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:00,270 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,271 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:35:00,271 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:35:00,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:35:00,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:35:00,272 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:00,272 INFO L87 Difference]: Start difference. First operand 394 states and 957 transitions. Second operand 9 states. [2018-09-30 20:35:06,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:06,763 INFO L93 Difference]: Finished difference Result 791 states and 1795 transitions. [2018-09-30 20:35:06,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:35:06,764 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:35:06,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:06,770 INFO L225 Difference]: With dead ends: 791 [2018-09-30 20:35:06,770 INFO L226 Difference]: Without dead ends: 783 [2018-09-30 20:35:06,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:35:06,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-09-30 20:35:06,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 392. [2018-09-30 20:35:06,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-09-30 20:35:06,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 950 transitions. [2018-09-30 20:35:06,861 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 950 transitions. Word has length 12 [2018-09-30 20:35:06,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:06,861 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 950 transitions. [2018-09-30 20:35:06,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:35:06,862 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 950 transitions. [2018-09-30 20:35:06,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:35:06,863 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:06,863 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:06,863 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:06,863 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:06,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1733624339, now seen corresponding path program 1 times [2018-09-30 20:35:06,864 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:06,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:06,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:06,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:06,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:06,957 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:06,957 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:35:06,957 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:35:06,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:35:06,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:35:06,958 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:06,958 INFO L87 Difference]: Start difference. First operand 392 states and 950 transitions. Second operand 9 states. [2018-09-30 20:35:14,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:14,266 INFO L93 Difference]: Finished difference Result 1040 states and 2400 transitions. [2018-09-30 20:35:14,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 20:35:14,267 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:35:14,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:14,273 INFO L225 Difference]: With dead ends: 1040 [2018-09-30 20:35:14,274 INFO L226 Difference]: Without dead ends: 1032 [2018-09-30 20:35:14,275 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:35:14,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2018-09-30 20:35:14,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 397. [2018-09-30 20:35:14,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-09-30 20:35:14,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 962 transitions. [2018-09-30 20:35:14,396 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 962 transitions. Word has length 12 [2018-09-30 20:35:14,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:14,397 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 962 transitions. [2018-09-30 20:35:14,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:35:14,397 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 962 transitions. [2018-09-30 20:35:14,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:35:14,398 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:14,398 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:14,399 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:14,399 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:14,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1736424693, now seen corresponding path program 1 times [2018-09-30 20:35:14,399 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:14,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:14,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:14,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:14,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:14,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:14,541 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:35:14,541 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:35:14,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:35:14,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:35:14,542 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:14,542 INFO L87 Difference]: Start difference. First operand 397 states and 962 transitions. Second operand 9 states. [2018-09-30 20:35:22,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:22,488 INFO L93 Difference]: Finished difference Result 1166 states and 2697 transitions. [2018-09-30 20:35:22,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-30 20:35:22,488 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:35:22,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:22,496 INFO L225 Difference]: With dead ends: 1166 [2018-09-30 20:35:22,496 INFO L226 Difference]: Without dead ends: 1158 [2018-09-30 20:35:22,497 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:35:22,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2018-09-30 20:35:22,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 427. [2018-09-30 20:35:22,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-09-30 20:35:22,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1051 transitions. [2018-09-30 20:35:22,629 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1051 transitions. Word has length 12 [2018-09-30 20:35:22,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:22,630 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 1051 transitions. [2018-09-30 20:35:22,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:35:22,630 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1051 transitions. [2018-09-30 20:35:22,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:35:22,631 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:22,631 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:22,631 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:22,631 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:22,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1736322548, now seen corresponding path program 1 times [2018-09-30 20:35:22,631 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:22,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:22,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:22,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:22,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:22,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:22,769 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:35:22,769 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:35:22,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:35:22,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:35:22,770 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:22,770 INFO L87 Difference]: Start difference. First operand 427 states and 1051 transitions. Second operand 9 states. [2018-09-30 20:35:30,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:30,609 INFO L93 Difference]: Finished difference Result 1127 states and 2616 transitions. [2018-09-30 20:35:30,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 20:35:30,610 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:35:30,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:30,616 INFO L225 Difference]: With dead ends: 1127 [2018-09-30 20:35:30,616 INFO L226 Difference]: Without dead ends: 1119 [2018-09-30 20:35:30,617 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:35:30,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-09-30 20:35:30,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 387. [2018-09-30 20:35:30,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-09-30 20:35:30,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 937 transitions. [2018-09-30 20:35:30,806 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 937 transitions. Word has length 12 [2018-09-30 20:35:30,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:30,807 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 937 transitions. [2018-09-30 20:35:30,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:35:30,807 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 937 transitions. [2018-09-30 20:35:30,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:35:30,808 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:30,808 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:30,808 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:30,809 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:30,809 INFO L82 PathProgramCache]: Analyzing trace with hash -608805552, now seen corresponding path program 1 times [2018-09-30 20:35:30,809 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:30,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:30,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:30,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:30,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:31,014 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:31,015 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:35:31,015 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:35:31,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:35:31,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:35:31,016 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:31,016 INFO L87 Difference]: Start difference. First operand 387 states and 937 transitions. Second operand 9 states. [2018-09-30 20:35:38,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:38,041 INFO L93 Difference]: Finished difference Result 975 states and 2260 transitions. [2018-09-30 20:35:38,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 20:35:38,042 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:35:38,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:38,048 INFO L225 Difference]: With dead ends: 975 [2018-09-30 20:35:38,048 INFO L226 Difference]: Without dead ends: 967 [2018-09-30 20:35:38,048 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-09-30 20:35:38,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2018-09-30 20:35:38,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 411. [2018-09-30 20:35:38,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-09-30 20:35:38,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1004 transitions. [2018-09-30 20:35:38,221 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1004 transitions. Word has length 12 [2018-09-30 20:35:38,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:38,222 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 1004 transitions. [2018-09-30 20:35:38,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:35:38,223 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1004 transitions. [2018-09-30 20:35:38,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:35:38,224 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:38,224 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:38,224 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:38,224 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:38,225 INFO L82 PathProgramCache]: Analyzing trace with hash -608703407, now seen corresponding path program 1 times [2018-09-30 20:35:38,225 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:38,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:38,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:38,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:38,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:38,312 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:38,312 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:35:38,313 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:35:38,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:35:38,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:35:38,314 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:38,314 INFO L87 Difference]: Start difference. First operand 411 states and 1004 transitions. Second operand 9 states. [2018-09-30 20:35:46,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:46,027 INFO L93 Difference]: Finished difference Result 1011 states and 2327 transitions. [2018-09-30 20:35:46,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 20:35:46,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:35:46,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:46,032 INFO L225 Difference]: With dead ends: 1011 [2018-09-30 20:35:46,032 INFO L226 Difference]: Without dead ends: 1003 [2018-09-30 20:35:46,032 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:35:46,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-09-30 20:35:46,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 391. [2018-09-30 20:35:46,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-09-30 20:35:46,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 944 transitions. [2018-09-30 20:35:46,250 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 944 transitions. Word has length 12 [2018-09-30 20:35:46,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:46,250 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 944 transitions. [2018-09-30 20:35:46,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:35:46,250 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 944 transitions. [2018-09-30 20:35:46,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:35:46,251 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:46,251 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:46,252 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:46,252 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:46,252 INFO L82 PathProgramCache]: Analyzing trace with hash -500853260, now seen corresponding path program 1 times [2018-09-30 20:35:46,252 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:46,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:46,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:46,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:46,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:46,351 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:46,351 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:35:46,352 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:35:46,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:35:46,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:35:46,352 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:46,353 INFO L87 Difference]: Start difference. First operand 391 states and 944 transitions. Second operand 9 states. [2018-09-30 20:35:52,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:52,239 INFO L93 Difference]: Finished difference Result 859 states and 1980 transitions. [2018-09-30 20:35:52,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 20:35:52,239 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:35:52,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:52,243 INFO L225 Difference]: With dead ends: 859 [2018-09-30 20:35:52,243 INFO L226 Difference]: Without dead ends: 851 [2018-09-30 20:35:52,244 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:52,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-09-30 20:35:52,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 381. [2018-09-30 20:35:52,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-30 20:35:52,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-09-30 20:35:52,427 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-09-30 20:35:52,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:52,428 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-09-30 20:35:52,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:35:52,428 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-09-30 20:35:52,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:35:52,428 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:52,428 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:52,429 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:52,429 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:52,429 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-09-30 20:35:52,429 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:52,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:52,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:52,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:52,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:52,525 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:52,525 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:35:52,525 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:35:52,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:35:52,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:35:52,526 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:52,526 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-09-30 20:35:58,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:58,826 INFO L93 Difference]: Finished difference Result 962 states and 2175 transitions. [2018-09-30 20:35:58,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 20:35:58,827 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:35:58,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:58,831 INFO L225 Difference]: With dead ends: 962 [2018-09-30 20:35:58,831 INFO L226 Difference]: Without dead ends: 954 [2018-09-30 20:35:58,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:35:58,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-09-30 20:35:59,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 504. [2018-09-30 20:35:59,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-09-30 20:35:59,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1236 transitions. [2018-09-30 20:35:59,067 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1236 transitions. Word has length 12 [2018-09-30 20:35:59,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:59,067 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 1236 transitions. [2018-09-30 20:35:59,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:35:59,067 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1236 transitions. [2018-09-30 20:35:59,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:35:59,068 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:59,068 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:59,068 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:59,068 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:59,068 INFO L82 PathProgramCache]: Analyzing trace with hash 192721184, now seen corresponding path program 1 times [2018-09-30 20:35:59,068 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:59,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:59,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:59,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:59,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:59,158 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:59,158 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:35:59,158 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:35:59,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:35:59,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:35:59,159 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:59,160 INFO L87 Difference]: Start difference. First operand 504 states and 1236 transitions. Second operand 8 states. [2018-09-30 20:36:06,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:06,255 INFO L93 Difference]: Finished difference Result 1064 states and 2409 transitions. [2018-09-30 20:36:06,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 20:36:06,256 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:36:06,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:06,260 INFO L225 Difference]: With dead ends: 1064 [2018-09-30 20:36:06,260 INFO L226 Difference]: Without dead ends: 1056 [2018-09-30 20:36:06,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:36:06,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2018-09-30 20:36:06,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 522. [2018-09-30 20:36:06,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-09-30 20:36:06,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1279 transitions. [2018-09-30 20:36:06,526 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1279 transitions. Word has length 12 [2018-09-30 20:36:06,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:06,526 INFO L480 AbstractCegarLoop]: Abstraction has 522 states and 1279 transitions. [2018-09-30 20:36:06,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:36:06,526 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1279 transitions. [2018-09-30 20:36:06,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:36:06,527 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:06,527 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:06,527 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:06,527 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:06,528 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-09-30 20:36:06,528 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:06,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:06,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:06,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:06,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:06,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:06,629 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:36:06,629 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:36:06,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:36:06,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:36:06,630 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:06,630 INFO L87 Difference]: Start difference. First operand 522 states and 1279 transitions. Second operand 8 states. [2018-09-30 20:36:15,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:15,361 INFO L93 Difference]: Finished difference Result 1241 states and 2843 transitions. [2018-09-30 20:36:15,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-30 20:36:15,362 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:36:15,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:15,368 INFO L225 Difference]: With dead ends: 1241 [2018-09-30 20:36:15,368 INFO L226 Difference]: Without dead ends: 1233 [2018-09-30 20:36:15,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:36:15,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-09-30 20:36:15,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 570. [2018-09-30 20:36:15,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-09-30 20:36:15,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1411 transitions. [2018-09-30 20:36:15,694 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1411 transitions. Word has length 12 [2018-09-30 20:36:15,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:15,694 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1411 transitions. [2018-09-30 20:36:15,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:36:15,695 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1411 transitions. [2018-09-30 20:36:15,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:36:15,695 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:15,696 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:15,696 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:15,696 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:15,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1424310915, now seen corresponding path program 1 times [2018-09-30 20:36:15,697 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:15,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:15,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:15,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:15,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:15,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:36:15,770 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:36:15,770 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:36:15,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:36:15,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:36:15,771 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:15,771 INFO L87 Difference]: Start difference. First operand 570 states and 1411 transitions. Second operand 8 states. [2018-09-30 20:36:21,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:21,786 INFO L93 Difference]: Finished difference Result 1139 states and 2639 transitions. [2018-09-30 20:36:21,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 20:36:21,787 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:36:21,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:21,792 INFO L225 Difference]: With dead ends: 1139 [2018-09-30 20:36:21,792 INFO L226 Difference]: Without dead ends: 1131 [2018-09-30 20:36:21,793 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:36:21,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-09-30 20:36:22,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 588. [2018-09-30 20:36:22,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-09-30 20:36:22,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1454 transitions. [2018-09-30 20:36:22,108 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1454 transitions. Word has length 12 [2018-09-30 20:36:22,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:22,108 INFO L480 AbstractCegarLoop]: Abstraction has 588 states and 1454 transitions. [2018-09-30 20:36:22,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:36:22,109 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1454 transitions. [2018-09-30 20:36:22,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:36:22,109 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:22,109 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:22,110 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:22,110 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:22,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1424311194, now seen corresponding path program 1 times [2018-09-30 20:36:22,110 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:22,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:22,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:22,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:22,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:22,218 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:22,218 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:36:22,219 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:36:22,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:36:22,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:36:22,220 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:22,220 INFO L87 Difference]: Start difference. First operand 588 states and 1454 transitions. Second operand 8 states. [2018-09-30 20:36:30,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:30,261 INFO L93 Difference]: Finished difference Result 1325 states and 3082 transitions. [2018-09-30 20:36:30,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 20:36:30,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:36:30,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:30,267 INFO L225 Difference]: With dead ends: 1325 [2018-09-30 20:36:30,267 INFO L226 Difference]: Without dead ends: 1317 [2018-09-30 20:36:30,268 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:36:30,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2018-09-30 20:36:30,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 573. [2018-09-30 20:36:30,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-09-30 20:36:30,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1417 transitions. [2018-09-30 20:36:30,611 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1417 transitions. Word has length 12 [2018-09-30 20:36:30,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:30,611 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 1417 transitions. [2018-09-30 20:36:30,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:36:30,612 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1417 transitions. [2018-09-30 20:36:30,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:36:30,612 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:30,612 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:30,613 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:30,613 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:30,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-09-30 20:36:30,613 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:30,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:30,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:30,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:30,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:30,687 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,687 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:36:30,688 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:36:30,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:36:30,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:36:30,688 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:30,689 INFO L87 Difference]: Start difference. First operand 573 states and 1417 transitions. Second operand 8 states. [2018-09-30 20:36:38,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:38,803 INFO L93 Difference]: Finished difference Result 1334 states and 3099 transitions. [2018-09-30 20:36:38,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 20:36:38,804 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:36:38,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:38,809 INFO L225 Difference]: With dead ends: 1334 [2018-09-30 20:36:38,809 INFO L226 Difference]: Without dead ends: 1326 [2018-09-30 20:36:38,810 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:36:38,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2018-09-30 20:36:39,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 579. [2018-09-30 20:36:39,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-09-30 20:36:39,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1431 transitions. [2018-09-30 20:36:39,186 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1431 transitions. Word has length 12 [2018-09-30 20:36:39,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:39,186 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 1431 transitions. [2018-09-30 20:36:39,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:36:39,186 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1431 transitions. [2018-09-30 20:36:39,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:36:39,187 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:39,187 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:39,188 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:39,188 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:39,188 INFO L82 PathProgramCache]: Analyzing trace with hash 725999160, now seen corresponding path program 1 times [2018-09-30 20:36:39,188 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:39,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:39,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:39,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:39,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:39,258 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:36:39,258 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:36:39,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:36:39,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:36:39,259 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:39,260 INFO L87 Difference]: Start difference. First operand 579 states and 1431 transitions. Second operand 8 states. [2018-09-30 20:36:44,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:44,113 INFO L93 Difference]: Finished difference Result 919 states and 2156 transitions. [2018-09-30 20:36:44,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 20:36:44,113 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:36:44,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:44,118 INFO L225 Difference]: With dead ends: 919 [2018-09-30 20:36:44,118 INFO L226 Difference]: Without dead ends: 911 [2018-09-30 20:36:44,119 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:36:44,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-09-30 20:36:44,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 570. [2018-09-30 20:36:44,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-09-30 20:36:44,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1404 transitions. [2018-09-30 20:36:44,447 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1404 transitions. Word has length 12 [2018-09-30 20:36:44,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:44,447 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1404 transitions. [2018-09-30 20:36:44,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:36:44,448 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1404 transitions. [2018-09-30 20:36:44,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:36:44,448 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:44,448 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:44,449 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:44,449 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:44,449 INFO L82 PathProgramCache]: Analyzing trace with hash 725999439, now seen corresponding path program 1 times [2018-09-30 20:36:44,449 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:44,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:44,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:44,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:44,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:44,550 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:44,551 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:36:44,551 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:36:44,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:36:44,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:36:44,552 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:44,552 INFO L87 Difference]: Start difference. First operand 570 states and 1404 transitions. Second operand 8 states. [2018-09-30 20:36:51,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:51,368 INFO L93 Difference]: Finished difference Result 1095 states and 2579 transitions. [2018-09-30 20:36:51,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 20:36:51,370 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:36:51,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:51,376 INFO L225 Difference]: With dead ends: 1095 [2018-09-30 20:36:51,376 INFO L226 Difference]: Without dead ends: 1087 [2018-09-30 20:36:51,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:36:51,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2018-09-30 20:36:51,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 555. [2018-09-30 20:36:51,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-09-30 20:36:51,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1367 transitions. [2018-09-30 20:36:51,760 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1367 transitions. Word has length 12 [2018-09-30 20:36:51,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:51,761 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 1367 transitions. [2018-09-30 20:36:51,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:36:51,761 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1367 transitions. [2018-09-30 20:36:51,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:36:51,761 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:51,762 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:51,762 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:51,762 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:51,762 INFO L82 PathProgramCache]: Analyzing trace with hash 729878996, now seen corresponding path program 1 times [2018-09-30 20:36:51,762 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:51,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:51,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:51,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:51,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:51,846 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:51,846 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:36:51,847 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:36:51,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:36:51,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:36:51,847 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:51,848 INFO L87 Difference]: Start difference. First operand 555 states and 1367 transitions. Second operand 8 states. [2018-09-30 20:37:00,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:00,379 INFO L93 Difference]: Finished difference Result 1304 states and 3052 transitions. [2018-09-30 20:37:00,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 20:37:00,379 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:37:00,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:00,384 INFO L225 Difference]: With dead ends: 1304 [2018-09-30 20:37:00,384 INFO L226 Difference]: Without dead ends: 1296 [2018-09-30 20:37:00,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:37:00,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-09-30 20:37:00,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 552. [2018-09-30 20:37:00,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-09-30 20:37:00,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1361 transitions. [2018-09-30 20:37:00,782 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1361 transitions. Word has length 12 [2018-09-30 20:37:00,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:00,782 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 1361 transitions. [2018-09-30 20:37:00,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:37:00,783 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1361 transitions. [2018-09-30 20:37:00,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:37:00,783 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:00,784 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:00,784 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:00,784 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:00,784 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-09-30 20:37:00,785 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:00,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:00,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:00,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:00,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:00,855 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:37:00,855 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:37:00,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:37:00,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:37:00,856 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:00,856 INFO L87 Difference]: Start difference. First operand 552 states and 1361 transitions. Second operand 8 states. [2018-09-30 20:37:08,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:08,483 INFO L93 Difference]: Finished difference Result 1192 states and 2790 transitions. [2018-09-30 20:37:08,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 20:37:08,483 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:37:08,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:08,486 INFO L225 Difference]: With dead ends: 1192 [2018-09-30 20:37:08,486 INFO L226 Difference]: Without dead ends: 1184 [2018-09-30 20:37:08,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:37:08,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-09-30 20:37:08,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 602. [2018-09-30 20:37:08,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-09-30 20:37:08,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-09-30 20:37:08,984 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-09-30 20:37:08,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:08,984 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-09-30 20:37:08,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:37:08,985 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-09-30 20:37:08,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:37:08,985 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:08,986 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:08,986 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:08,986 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:08,986 INFO L82 PathProgramCache]: Analyzing trace with hash 308305537, now seen corresponding path program 1 times [2018-09-30 20:37:08,986 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:08,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:08,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:08,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:08,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:09,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:09,030 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:37:09,031 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:37:09,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:37:09,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:37:09,031 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:09,031 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-09-30 20:37:10,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:10,124 INFO L93 Difference]: Finished difference Result 1139 states and 2816 transitions. [2018-09-30 20:37:10,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:37:10,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-30 20:37:10,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:10,126 INFO L225 Difference]: With dead ends: 1139 [2018-09-30 20:37:10,126 INFO L226 Difference]: Without dead ends: 625 [2018-09-30 20:37:10,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:37:10,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-09-30 20:37:10,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 602. [2018-09-30 20:37:10,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-09-30 20:37:10,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1415 transitions. [2018-09-30 20:37:10,631 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1415 transitions. Word has length 13 [2018-09-30 20:37:10,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:10,631 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1415 transitions. [2018-09-30 20:37:10,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:37:10,631 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1415 transitions. [2018-09-30 20:37:10,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:37:10,632 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:10,632 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:10,632 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:10,632 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:10,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1757679849, now seen corresponding path program 1 times [2018-09-30 20:37:10,632 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:10,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:10,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:10,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:10,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:10,800 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:10,800 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:37:10,800 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:10,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:10,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:37:11,696 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:11,730 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:37:11,730 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-30 20:37:11,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 20:37:11,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 20:37:11,731 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:11,731 INFO L87 Difference]: Start difference. First operand 602 states and 1415 transitions. Second operand 16 states. [2018-09-30 20:37:21,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:21,244 INFO L93 Difference]: Finished difference Result 794 states and 1860 transitions. [2018-09-30 20:37:21,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 20:37:21,245 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-09-30 20:37:21,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:21,246 INFO L225 Difference]: With dead ends: 794 [2018-09-30 20:37:21,246 INFO L226 Difference]: Without dead ends: 789 [2018-09-30 20:37:21,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-09-30 20:37:21,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-09-30 20:37:21,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 664. [2018-09-30 20:37:21,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-09-30 20:37:21,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1563 transitions. [2018-09-30 20:37:21,958 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1563 transitions. Word has length 13 [2018-09-30 20:37:21,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:21,958 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 1563 transitions. [2018-09-30 20:37:21,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 20:37:21,959 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1563 transitions. [2018-09-30 20:37:21,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:37:21,959 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:21,959 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:21,960 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:21,960 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:21,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1161218619, now seen corresponding path program 1 times [2018-09-30 20:37:21,960 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:21,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:21,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:21,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:21,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:22,015 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:22,015 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:37:22,015 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:37:22,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:37:22,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:37:22,016 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:22,016 INFO L87 Difference]: Start difference. First operand 664 states and 1563 transitions. Second operand 5 states. [2018-09-30 20:37:23,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:23,667 INFO L93 Difference]: Finished difference Result 1317 states and 3113 transitions. [2018-09-30 20:37:23,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:37:23,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-30 20:37:23,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:23,668 INFO L225 Difference]: With dead ends: 1317 [2018-09-30 20:37:23,669 INFO L226 Difference]: Without dead ends: 729 [2018-09-30 20:37:23,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:37:23,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-09-30 20:37:24,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 690. [2018-09-30 20:37:24,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-30 20:37:24,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-09-30 20:37:24,347 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-09-30 20:37:24,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:24,347 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-09-30 20:37:24,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:37:24,348 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-09-30 20:37:24,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:37:24,349 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:24,349 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:24,349 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:24,349 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:24,350 INFO L82 PathProgramCache]: Analyzing trace with hash -942981820, now seen corresponding path program 1 times [2018-09-30 20:37:24,350 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:24,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:24,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:24,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:24,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:24,511 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:24,511 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:37:24,511 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:37:24,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:37:24,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:37:24,512 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:24,512 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 8 states. [2018-09-30 20:37:32,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:32,008 INFO L93 Difference]: Finished difference Result 1435 states and 3122 transitions. [2018-09-30 20:37:32,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 20:37:32,008 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 20:37:32,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:32,011 INFO L225 Difference]: With dead ends: 1435 [2018-09-30 20:37:32,011 INFO L226 Difference]: Without dead ends: 1427 [2018-09-30 20:37:32,012 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-09-30 20:37:32,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2018-09-30 20:37:32,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 789. [2018-09-30 20:37:32,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-09-30 20:37:32,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1779 transitions. [2018-09-30 20:37:32,872 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1779 transitions. Word has length 16 [2018-09-30 20:37:32,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:32,872 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 1779 transitions. [2018-09-30 20:37:32,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:37:32,872 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1779 transitions. [2018-09-30 20:37:32,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:37:32,873 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:32,873 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:32,874 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:32,874 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:32,874 INFO L82 PathProgramCache]: Analyzing trace with hash -945782174, now seen corresponding path program 1 times [2018-09-30 20:37:32,874 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:32,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:32,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:32,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:32,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:33,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:33,216 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:37:33,216 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:37:33,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:37:33,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:37:33,217 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:33,217 INFO L87 Difference]: Start difference. First operand 789 states and 1779 transitions. Second operand 8 states. [2018-09-30 20:37:41,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:41,045 INFO L93 Difference]: Finished difference Result 1599 states and 3473 transitions. [2018-09-30 20:37:41,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 20:37:41,045 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 20:37:41,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:41,049 INFO L225 Difference]: With dead ends: 1599 [2018-09-30 20:37:41,049 INFO L226 Difference]: Without dead ends: 1591 [2018-09-30 20:37:41,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-09-30 20:37:41,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-09-30 20:37:41,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 821. [2018-09-30 20:37:41,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-09-30 20:37:41,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1853 transitions. [2018-09-30 20:37:41,863 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1853 transitions. Word has length 16 [2018-09-30 20:37:41,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:41,863 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1853 transitions. [2018-09-30 20:37:41,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:37:41,863 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1853 transitions. [2018-09-30 20:37:41,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:37:41,864 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:41,864 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:41,864 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:41,864 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:41,864 INFO L82 PathProgramCache]: Analyzing trace with hash -945680029, now seen corresponding path program 1 times [2018-09-30 20:37:41,864 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:41,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:41,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:41,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:41,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:41,948 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:41,949 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:37:41,949 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:37:41,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:37:41,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:37:41,949 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:41,950 INFO L87 Difference]: Start difference. First operand 821 states and 1853 transitions. Second operand 8 states. [2018-09-30 20:37:48,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:48,668 INFO L93 Difference]: Finished difference Result 1411 states and 3060 transitions. [2018-09-30 20:37:48,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 20:37:48,668 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 20:37:48,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:48,672 INFO L225 Difference]: With dead ends: 1411 [2018-09-30 20:37:48,672 INFO L226 Difference]: Without dead ends: 1403 [2018-09-30 20:37:48,673 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:37:48,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-09-30 20:37:49,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 823. [2018-09-30 20:37:49,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-09-30 20:37:49,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1851 transitions. [2018-09-30 20:37:49,546 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1851 transitions. Word has length 16 [2018-09-30 20:37:49,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:49,547 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1851 transitions. [2018-09-30 20:37:49,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:37:49,547 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1851 transitions. [2018-09-30 20:37:49,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:37:49,547 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:49,547 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:49,548 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:49,548 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:49,548 INFO L82 PathProgramCache]: Analyzing trace with hash -648408412, now seen corresponding path program 1 times [2018-09-30 20:37:49,548 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:49,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:49,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:49,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:49,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:49,713 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:49,714 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:37:49,714 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:37:49,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:37:49,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:37:49,715 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:49,715 INFO L87 Difference]: Start difference. First operand 823 states and 1851 transitions. Second operand 8 states. [2018-09-30 20:37:57,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:57,283 INFO L93 Difference]: Finished difference Result 1490 states and 3255 transitions. [2018-09-30 20:37:57,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 20:37:57,284 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 20:37:57,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:57,285 INFO L225 Difference]: With dead ends: 1490 [2018-09-30 20:37:57,286 INFO L226 Difference]: Without dead ends: 1482 [2018-09-30 20:37:57,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:37:57,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2018-09-30 20:37:58,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 943. [2018-09-30 20:37:58,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2018-09-30 20:37:58,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 2141 transitions. [2018-09-30 20:37:58,233 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 2141 transitions. Word has length 16 [2018-09-30 20:37:58,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:58,233 INFO L480 AbstractCegarLoop]: Abstraction has 943 states and 2141 transitions. [2018-09-30 20:37:58,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:37:58,233 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2141 transitions. [2018-09-30 20:37:58,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:37:58,234 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:58,234 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:58,235 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:58,235 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:58,235 INFO L82 PathProgramCache]: Analyzing trace with hash -648306267, now seen corresponding path program 1 times [2018-09-30 20:37:58,235 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:58,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:58,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:58,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:58,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:58,384 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:58,384 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:37:58,384 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:37:58,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:37:58,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:37:58,385 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:58,385 INFO L87 Difference]: Start difference. First operand 943 states and 2141 transitions. Second operand 8 states. [2018-09-30 20:38:05,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:38:05,568 INFO L93 Difference]: Finished difference Result 1427 states and 3102 transitions. [2018-09-30 20:38:05,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 20:38:05,569 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 20:38:05,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:38:05,570 INFO L225 Difference]: With dead ends: 1427 [2018-09-30 20:38:05,571 INFO L226 Difference]: Without dead ends: 1419 [2018-09-30 20:38:05,571 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:38:05,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2018-09-30 20:38:06,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 927. [2018-09-30 20:38:06,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-09-30 20:38:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2109 transitions. [2018-09-30 20:38:06,517 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2109 transitions. Word has length 16 [2018-09-30 20:38:06,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:38:06,518 INFO L480 AbstractCegarLoop]: Abstraction has 927 states and 2109 transitions. [2018-09-30 20:38:06,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:38:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2109 transitions. [2018-09-30 20:38:06,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:38:06,519 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:38:06,519 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:38:06,519 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:38:06,519 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:38:06,519 INFO L82 PathProgramCache]: Analyzing trace with hash -639392031, now seen corresponding path program 1 times [2018-09-30 20:38:06,520 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:38:06,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:38:06,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:06,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:38:06,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:38:06,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:38:06,587 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:38:06,587 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:38:06,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:38:06,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:38:06,588 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:38:06,588 INFO L87 Difference]: Start difference. First operand 927 states and 2109 transitions. Second operand 8 states. [2018-09-30 20:38:13,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:38:13,469 INFO L93 Difference]: Finished difference Result 1306 states and 2848 transitions. [2018-09-30 20:38:13,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-30 20:38:13,469 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 20:38:13,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:38:13,470 INFO L225 Difference]: With dead ends: 1306 [2018-09-30 20:38:13,470 INFO L226 Difference]: Without dead ends: 1298 [2018-09-30 20:38:13,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:38:13,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2018-09-30 20:38:14,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 986. [2018-09-30 20:38:14,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-09-30 20:38:14,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2232 transitions. [2018-09-30 20:38:14,436 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2232 transitions. Word has length 16 [2018-09-30 20:38:14,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:38:14,436 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2232 transitions. [2018-09-30 20:38:14,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:38:14,436 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2232 transitions. [2018-09-30 20:38:14,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:38:14,437 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:38:14,437 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:38:14,437 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:38:14,437 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:38:14,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1639330009, now seen corresponding path program 1 times [2018-09-30 20:38:14,438 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:38:14,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:38:14,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:14,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:38:14,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:38:14,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:38:14,523 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:38:14,523 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:38:14,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:38:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:38:14,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:38:14,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:38:14,601 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:38:14,601 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 20:38:14,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:38:14,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:38:14,602 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:38:14,602 INFO L87 Difference]: Start difference. First operand 986 states and 2232 transitions. Second operand 8 states. [2018-09-30 20:38:20,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:38:20,730 INFO L93 Difference]: Finished difference Result 1285 states and 2841 transitions. [2018-09-30 20:38:20,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 20:38:20,730 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 20:38:20,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:38:20,732 INFO L225 Difference]: With dead ends: 1285 [2018-09-30 20:38:20,732 INFO L226 Difference]: Without dead ends: 1277 [2018-09-30 20:38:20,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:38:20,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2018-09-30 20:38:21,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 986. [2018-09-30 20:38:21,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-09-30 20:38:21,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2231 transitions. [2018-09-30 20:38:21,813 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2231 transitions. Word has length 16 [2018-09-30 20:38:21,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:38:21,813 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2231 transitions. [2018-09-30 20:38:21,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:38:21,813 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2231 transitions. [2018-09-30 20:38:21,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:38:21,813 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:38:21,814 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:38:21,814 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:38:21,814 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:38:21,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1609777337, now seen corresponding path program 1 times [2018-09-30 20:38:21,814 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:38:21,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:38:21,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:21,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:38:21,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:38:21,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:38:21,902 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:38:21,902 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:21,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:38:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:38:21,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:38:21,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:38:21,990 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:38:21,990 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 20:38:21,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:38:21,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:38:21,991 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:38:21,991 INFO L87 Difference]: Start difference. First operand 986 states and 2231 transitions. Second operand 8 states. [2018-09-30 20:38:29,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:38:29,637 INFO L93 Difference]: Finished difference Result 1518 states and 3315 transitions. [2018-09-30 20:38:29,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 20:38:29,637 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 20:38:29,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:38:29,639 INFO L225 Difference]: With dead ends: 1518 [2018-09-30 20:38:29,639 INFO L226 Difference]: Without dead ends: 1510 [2018-09-30 20:38:29,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:38:29,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-09-30 20:38:30,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 977. [2018-09-30 20:38:30,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2018-09-30 20:38:30,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 2210 transitions. [2018-09-30 20:38:30,675 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 2210 transitions. Word has length 16 [2018-09-30 20:38:30,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:38:30,676 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 2210 transitions. [2018-09-30 20:38:30,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:38:30,676 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 2210 transitions. [2018-09-30 20:38:30,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:38:30,676 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:38:30,676 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:38:30,677 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:38:30,677 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:38:30,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1612577691, now seen corresponding path program 1 times [2018-09-30 20:38:30,677 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:38:30,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:38:30,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:30,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:38:30,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-09-30 20:38:30,849 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 20:38:30,855 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 20:38:30,856 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:38:30 BoogieIcfgContainer [2018-09-30 20:38:30,856 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:38:30,857 INFO L168 Benchmark]: Toolchain (without parser) took 251703.38 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -67.6 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 274.4 MB). Peak memory consumption was 206.8 MB. Max. memory is 7.1 GB. [2018-09-30 20:38:30,860 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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:30,860 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.30 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:30,861 INFO L168 Benchmark]: Boogie Preprocessor took 39.24 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:30,864 INFO L168 Benchmark]: RCFGBuilder took 885.48 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:30,865 INFO L168 Benchmark]: TraceAbstraction took 250726.62 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -67.6 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 242.7 MB). Peak memory consumption was 175.0 MB. Max. memory is 7.1 GB. [2018-09-30 20:38:30,872 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.20 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 45.30 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 39.24 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 885.48 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 250726.62 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -67.6 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 242.7 MB). Peak memory consumption was 175.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 15 interpolants. - 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 InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 15 interpolants. - 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 InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 15 interpolants. - 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 InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 15 interpolants. - 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 InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 15 interpolants. - 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 InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 15 interpolants. - 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 InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 15 interpolants. - 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 InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 15 interpolants. - 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 InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 15 interpolants. - 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 InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 15 interpolants. - 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 InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 15 interpolants. - 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 InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 15 interpolants. - 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 InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 15 interpolants. - 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 InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 15 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 250.6s OverallTime, 36 OverallIterations, 2 TraceHistogramMax, 230.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9108 SDtfs, 25134 SDslu, 27882 SDs, 0 SdLazy, 51754 SolverSat, 5185 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 52.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 793 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 736 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=986occurred in iteration=33, 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: 14.3s AutomataMinimizationTime, 35 MinimizatonAttempts, 16303 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 484 NumberOfCodeBlocks, 484 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 446 ConstructedInterpolants, 0 QuantifiedInterpolants, 17007 SizeOfPredicates, 13 NumberOfNonLiveVariables, 115 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 38 InterpolantComputations, 32 PerfectInterpolantSequences, 11/21 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_Reals.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_20-38-30-900.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out_Reals.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_20-38-30-900.csv Completed graceful shutdown