java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 11:35:07,899 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 11:35:07,902 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 11:35:07,914 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 11:35:07,914 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 11:35:07,916 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 11:35:07,917 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 11:35:07,919 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 11:35:07,920 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 11:35:07,921 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 11:35:07,922 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 11:35:07,922 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 11:35:07,923 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 11:35:07,924 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 11:35:07,925 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 11:35:07,926 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 11:35:07,927 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 11:35:07,929 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 11:35:07,931 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 11:35:07,933 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 11:35:07,934 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 11:35:07,935 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 11:35:07,940 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 11:35:07,940 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 11:35:07,941 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 11:35:07,942 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 11:35:07,943 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 11:35:07,944 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 11:35:07,944 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 11:35:07,946 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 11:35:07,946 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 11:35:07,947 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 11:35:07,947 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 11:35:07,947 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 11:35:07,948 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 11:35:07,949 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 11:35:07,949 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-02 11:35:07,967 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 11:35:07,967 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 11:35:07,971 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 11:35:07,971 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 11:35:07,972 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 11:35:07,972 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 11:35:07,972 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 11:35:07,973 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 11:35:07,973 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 11:35:07,973 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 11:35:07,973 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 11:35:07,973 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 11:35:07,973 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 11:35:07,974 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 11:35:07,974 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 11:35:07,974 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 11:35:07,974 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 11:35:07,974 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 11:35:07,975 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 11:35:07,975 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 11:35:07,975 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 11:35:07,975 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 11:35:07,976 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:35:07,976 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 11:35:07,976 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 11:35:07,976 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 11:35:07,976 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 11:35:07,977 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 11:35:07,977 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 11:35:07,977 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 11:35:08,022 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 11:35:08,038 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 11:35:08,043 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 11:35:08,045 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 11:35:08,046 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 11:35:08,047 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-10-02 11:35:08,048 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl' [2018-10-02 11:35:08,153 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 11:35:08,156 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 11:35:08,157 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 11:35:08,157 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 11:35:08,158 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 11:35:08,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 02.10 11:35:08" (1/1) ... [2018-10-02 11:35:08,196 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 02.10 11:35:08" (1/1) ... [2018-10-02 11:35:08,203 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-02 11:35:08,203 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-02 11:35:08,203 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-02 11:35:08,206 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 11:35:08,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 11:35:08,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 11:35:08,207 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 11:35:08,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:08" (1/1) ... [2018-10-02 11:35:08,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:08" (1/1) ... [2018-10-02 11:35:08,229 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:08" (1/1) ... [2018-10-02 11:35:08,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:08" (1/1) ... [2018-10-02 11:35:08,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:08" (1/1) ... [2018-10-02 11:35:08,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:08" (1/1) ... [2018-10-02 11:35:08,259 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:08" (1/1) ... [2018-10-02 11:35:08,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 11:35:08,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 11:35:08,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 11:35:08,270 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 11:35:08,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:35:08,343 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-02 11:35:08,343 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-02 11:35:08,343 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-02 11:35:09,166 INFO L337 CfgBuilder]: Using library mode [2018-10-02 11:35:09,167 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:35:09 BoogieIcfgContainer [2018-10-02 11:35:09,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 11:35:09,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 11:35:09,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 11:35:09,172 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 11:35:09,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:08" (1/2) ... [2018-10-02 11:35:09,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9acb2f and model type threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:35:09, skipping insertion in model container [2018-10-02 11:35:09,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:35:09" (2/2) ... [2018-10-02 11:35:09,175 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out_Reals.bpl [2018-10-02 11:35:09,185 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 11:35:09,194 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-10-02 11:35:09,247 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 11:35:09,248 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 11:35:09,248 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 11:35:09,248 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 11:35:09,248 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 11:35:09,248 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 11:35:09,248 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 11:35:09,249 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 11:35:09,249 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 11:35:09,270 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-10-02 11:35:09,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-02 11:35:09,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:09,286 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:09,293 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:09,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:09,301 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-10-02 11:35:09,303 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:09,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:09,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:09,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:09,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:09,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:09,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:09,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 11:35:09,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-02 11:35:09,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-02 11:35:09,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-02 11:35:09,641 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-10-02 11:35:11,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:11,422 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-10-02 11:35:11,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-02 11:35:11,426 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-02 11:35:11,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:11,443 INFO L225 Difference]: With dead ends: 163 [2018-10-02 11:35:11,443 INFO L226 Difference]: Without dead ends: 158 [2018-10-02 11:35:11,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:35:11,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-02 11:35:11,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-10-02 11:35:11,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-02 11:35:11,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-10-02 11:35:11,508 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-10-02 11:35:11,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:11,508 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-10-02 11:35:11,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-02 11:35:11,508 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-10-02 11:35:11,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-02 11:35:11,509 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:11,510 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:11,511 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:11,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:11,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-10-02 11:35:11,512 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:11,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:11,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:11,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:11,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:11,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:11,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:11,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 11:35:11,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-02 11:35:11,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-02 11:35:11,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-02 11:35:11,638 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-10-02 11:35:12,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:12,553 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-10-02 11:35:12,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-02 11:35:12,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-02 11:35:12,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:12,558 INFO L225 Difference]: With dead ends: 188 [2018-10-02 11:35:12,558 INFO L226 Difference]: Without dead ends: 183 [2018-10-02 11:35:12,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:35:12,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-02 11:35:12,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-10-02 11:35:12,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-02 11:35:12,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-10-02 11:35:12,584 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-10-02 11:35:12,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:12,585 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-10-02 11:35:12,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-02 11:35:12,585 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-10-02 11:35:12,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 11:35:12,586 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:12,587 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:12,587 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:12,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:12,588 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-10-02 11:35:12,588 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:12,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:12,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:12,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:12,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:12,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:12,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:12,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 11:35:12,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:35:12,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:35:12,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:35:12,707 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-10-02 11:35:14,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:14,096 INFO L93 Difference]: Finished difference Result 283 states and 637 transitions. [2018-10-02 11:35:14,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 11:35:14,096 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-10-02 11:35:14,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:14,100 INFO L225 Difference]: With dead ends: 283 [2018-10-02 11:35:14,100 INFO L226 Difference]: Without dead ends: 278 [2018-10-02 11:35:14,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:35:14,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-02 11:35:14,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 147. [2018-10-02 11:35:14,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-02 11:35:14,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 323 transitions. [2018-10-02 11:35:14,132 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 323 transitions. Word has length 9 [2018-10-02 11:35:14,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:14,133 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 323 transitions. [2018-10-02 11:35:14,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:35:14,133 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 323 transitions. [2018-10-02 11:35:14,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 11:35:14,134 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:14,135 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:14,135 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:14,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:14,136 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-10-02 11:35:14,136 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:14,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:14,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:14,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:14,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:14,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:14,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:14,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 11:35:14,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:35:14,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:35:14,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:35:14,338 INFO L87 Difference]: Start difference. First operand 147 states and 323 transitions. Second operand 7 states. [2018-10-02 11:35:16,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:16,124 INFO L93 Difference]: Finished difference Result 387 states and 869 transitions. [2018-10-02 11:35:16,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 11:35:16,127 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-10-02 11:35:16,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:16,129 INFO L225 Difference]: With dead ends: 387 [2018-10-02 11:35:16,129 INFO L226 Difference]: Without dead ends: 375 [2018-10-02 11:35:16,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:35:16,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-10-02 11:35:16,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 203. [2018-10-02 11:35:16,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-02 11:35:16,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-10-02 11:35:16,174 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-10-02 11:35:16,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:16,174 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-10-02 11:35:16,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:35:16,174 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-10-02 11:35:16,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:16,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:16,177 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:16,177 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:16,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:16,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-10-02 11:35:16,178 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:16,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:16,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:16,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:16,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:16,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:16,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:16,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:16,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:35:16,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:35:16,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:35:16,316 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 9 states. [2018-10-02 11:35:17,571 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-02 11:35:21,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:21,563 INFO L93 Difference]: Finished difference Result 725 states and 1622 transitions. [2018-10-02 11:35:21,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-02 11:35:21,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-02 11:35:21,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:21,571 INFO L225 Difference]: With dead ends: 725 [2018-10-02 11:35:21,571 INFO L226 Difference]: Without dead ends: 717 [2018-10-02 11:35:21,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-10-02 11:35:21,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-02 11:35:21,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 354. [2018-10-02 11:35:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-10-02 11:35:21,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 843 transitions. [2018-10-02 11:35:21,635 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 843 transitions. Word has length 12 [2018-10-02 11:35:21,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:21,635 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 843 transitions. [2018-10-02 11:35:21,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:35:21,636 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 843 transitions. [2018-10-02 11:35:21,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:21,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:21,638 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:21,638 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:21,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:21,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-10-02 11:35:21,639 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:21,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:21,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:21,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:21,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:21,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:21,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:21,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:21,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:35:21,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:35:21,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:35:21,826 INFO L87 Difference]: Start difference. First operand 354 states and 843 transitions. Second operand 9 states. [2018-10-02 11:35:24,477 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-02 11:35:28,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:28,063 INFO L93 Difference]: Finished difference Result 1008 states and 2278 transitions. [2018-10-02 11:35:28,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 11:35:28,065 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-02 11:35:28,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:28,072 INFO L225 Difference]: With dead ends: 1008 [2018-10-02 11:35:28,072 INFO L226 Difference]: Without dead ends: 1000 [2018-10-02 11:35:28,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2018-10-02 11:35:28,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-10-02 11:35:28,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 364. [2018-10-02 11:35:28,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-02 11:35:28,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 868 transitions. [2018-10-02 11:35:28,142 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 868 transitions. Word has length 12 [2018-10-02 11:35:28,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:28,142 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 868 transitions. [2018-10-02 11:35:28,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:35:28,143 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 868 transitions. [2018-10-02 11:35:28,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:28,144 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:28,144 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:28,145 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:28,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:28,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-10-02 11:35:28,145 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:28,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:28,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:28,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:28,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:28,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:28,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:28,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:28,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:35:28,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:35:28,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:35:28,281 INFO L87 Difference]: Start difference. First operand 364 states and 868 transitions. Second operand 9 states. [2018-10-02 11:35:30,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:30,767 INFO L93 Difference]: Finished difference Result 924 states and 2097 transitions. [2018-10-02 11:35:30,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-02 11:35:30,768 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-02 11:35:30,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:30,774 INFO L225 Difference]: With dead ends: 924 [2018-10-02 11:35:30,774 INFO L226 Difference]: Without dead ends: 916 [2018-10-02 11:35:30,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2018-10-02 11:35:30,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2018-10-02 11:35:30,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 394. [2018-10-02 11:35:30,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-10-02 11:35:30,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 957 transitions. [2018-10-02 11:35:30,859 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 957 transitions. Word has length 12 [2018-10-02 11:35:30,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:30,859 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 957 transitions. [2018-10-02 11:35:30,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:35:30,859 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 957 transitions. [2018-10-02 11:35:30,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:30,860 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:30,860 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:30,861 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:30,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:30,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-10-02 11:35:30,862 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:30,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:30,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:30,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:30,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:30,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:30,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:30,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:30,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:35:30,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:35:30,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:35:30,945 INFO L87 Difference]: Start difference. First operand 394 states and 957 transitions. Second operand 9 states. [2018-10-02 11:35:33,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:33,004 INFO L93 Difference]: Finished difference Result 791 states and 1795 transitions. [2018-10-02 11:35:33,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 11:35:33,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-02 11:35:33,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:33,010 INFO L225 Difference]: With dead ends: 791 [2018-10-02 11:35:33,010 INFO L226 Difference]: Without dead ends: 783 [2018-10-02 11:35:33,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:35:33,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-10-02 11:35:33,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 392. [2018-10-02 11:35:33,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-02 11:35:33,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 950 transitions. [2018-10-02 11:35:33,112 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 950 transitions. Word has length 12 [2018-10-02 11:35:33,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:33,113 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 950 transitions. [2018-10-02 11:35:33,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:35:33,113 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 950 transitions. [2018-10-02 11:35:33,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:33,114 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:33,114 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:33,115 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:33,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:33,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1733624339, now seen corresponding path program 1 times [2018-10-02 11:35:33,115 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:33,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:33,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:33,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:33,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:33,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:33,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:33,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:33,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:35:33,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:35:33,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:35:33,202 INFO L87 Difference]: Start difference. First operand 392 states and 950 transitions. Second operand 9 states. [2018-10-02 11:35:35,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:35,399 INFO L93 Difference]: Finished difference Result 1040 states and 2400 transitions. [2018-10-02 11:35:35,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-02 11:35:35,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-02 11:35:35,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:35,406 INFO L225 Difference]: With dead ends: 1040 [2018-10-02 11:35:35,406 INFO L226 Difference]: Without dead ends: 1032 [2018-10-02 11:35:35,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-10-02 11:35:35,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2018-10-02 11:35:35,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 397. [2018-10-02 11:35:35,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-10-02 11:35:35,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 962 transitions. [2018-10-02 11:35:35,521 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 962 transitions. Word has length 12 [2018-10-02 11:35:35,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:35,522 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 962 transitions. [2018-10-02 11:35:35,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:35:35,522 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 962 transitions. [2018-10-02 11:35:35,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:35,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:35,523 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:35,523 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:35,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:35,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1736424693, now seen corresponding path program 1 times [2018-10-02 11:35:35,524 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:35,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:35,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:35,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:35,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:35,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:35,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:35,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:35,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:35:35,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:35:35,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:35:35,614 INFO L87 Difference]: Start difference. First operand 397 states and 962 transitions. Second operand 9 states. [2018-10-02 11:35:38,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:38,398 INFO L93 Difference]: Finished difference Result 1166 states and 2697 transitions. [2018-10-02 11:35:38,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-02 11:35:38,399 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-02 11:35:38,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:38,405 INFO L225 Difference]: With dead ends: 1166 [2018-10-02 11:35:38,406 INFO L226 Difference]: Without dead ends: 1158 [2018-10-02 11:35:38,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=365, Invalid=967, Unknown=0, NotChecked=0, Total=1332 [2018-10-02 11:35:38,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2018-10-02 11:35:38,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 427. [2018-10-02 11:35:38,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-10-02 11:35:38,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1051 transitions. [2018-10-02 11:35:38,589 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1051 transitions. Word has length 12 [2018-10-02 11:35:38,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:38,589 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 1051 transitions. [2018-10-02 11:35:38,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:35:38,589 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1051 transitions. [2018-10-02 11:35:38,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:38,590 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:38,590 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:38,591 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:38,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:38,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1736322548, now seen corresponding path program 1 times [2018-10-02 11:35:38,591 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:38,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:38,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:38,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:38,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:38,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:38,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:38,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:38,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:35:38,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:35:38,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:35:38,944 INFO L87 Difference]: Start difference. First operand 427 states and 1051 transitions. Second operand 9 states. [2018-10-02 11:35:41,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:41,526 INFO L93 Difference]: Finished difference Result 1127 states and 2616 transitions. [2018-10-02 11:35:41,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-02 11:35:41,526 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-02 11:35:41,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:41,532 INFO L225 Difference]: With dead ends: 1127 [2018-10-02 11:35:41,533 INFO L226 Difference]: Without dead ends: 1119 [2018-10-02 11:35:41,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-10-02 11:35:41,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-10-02 11:35:41,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 387. [2018-10-02 11:35:41,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-10-02 11:35:41,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 937 transitions. [2018-10-02 11:35:41,666 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 937 transitions. Word has length 12 [2018-10-02 11:35:41,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:41,667 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 937 transitions. [2018-10-02 11:35:41,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:35:41,667 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 937 transitions. [2018-10-02 11:35:41,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:41,668 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:41,668 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:41,668 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:41,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:41,669 INFO L82 PathProgramCache]: Analyzing trace with hash -608805552, now seen corresponding path program 1 times [2018-10-02 11:35:41,669 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:41,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:41,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:41,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:41,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:41,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:41,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:41,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:41,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:35:41,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:35:41,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:35:41,801 INFO L87 Difference]: Start difference. First operand 387 states and 937 transitions. Second operand 9 states. [2018-10-02 11:35:44,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:44,268 INFO L93 Difference]: Finished difference Result 975 states and 2260 transitions. [2018-10-02 11:35:44,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-02 11:35:44,268 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-02 11:35:44,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:44,274 INFO L225 Difference]: With dead ends: 975 [2018-10-02 11:35:44,274 INFO L226 Difference]: Without dead ends: 967 [2018-10-02 11:35:44,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-10-02 11:35:44,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2018-10-02 11:35:44,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 411. [2018-10-02 11:35:44,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-10-02 11:35:44,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1004 transitions. [2018-10-02 11:35:44,444 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1004 transitions. Word has length 12 [2018-10-02 11:35:44,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:44,445 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 1004 transitions. [2018-10-02 11:35:44,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:35:44,446 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1004 transitions. [2018-10-02 11:35:44,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:44,446 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:44,447 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:44,447 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:44,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:44,448 INFO L82 PathProgramCache]: Analyzing trace with hash -608703407, now seen corresponding path program 1 times [2018-10-02 11:35:44,448 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:44,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:44,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:44,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:44,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:44,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:44,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:44,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:44,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:35:44,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:35:44,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:35:44,543 INFO L87 Difference]: Start difference. First operand 411 states and 1004 transitions. Second operand 9 states. [2018-10-02 11:35:47,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:47,143 INFO L93 Difference]: Finished difference Result 1011 states and 2327 transitions. [2018-10-02 11:35:47,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-02 11:35:47,144 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-02 11:35:47,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:47,149 INFO L225 Difference]: With dead ends: 1011 [2018-10-02 11:35:47,149 INFO L226 Difference]: Without dead ends: 1003 [2018-10-02 11:35:47,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-10-02 11:35:47,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-10-02 11:35:47,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 391. [2018-10-02 11:35:47,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-10-02 11:35:47,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 944 transitions. [2018-10-02 11:35:47,337 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 944 transitions. Word has length 12 [2018-10-02 11:35:47,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:47,338 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 944 transitions. [2018-10-02 11:35:47,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:35:47,338 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 944 transitions. [2018-10-02 11:35:47,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:47,339 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:47,339 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:47,339 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:47,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:47,340 INFO L82 PathProgramCache]: Analyzing trace with hash -500853260, now seen corresponding path program 1 times [2018-10-02 11:35:47,340 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:47,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:47,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:47,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:47,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:47,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:47,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:47,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:47,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:35:47,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:35:47,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:35:47,432 INFO L87 Difference]: Start difference. First operand 391 states and 944 transitions. Second operand 9 states. [2018-10-02 11:35:49,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:49,605 INFO L93 Difference]: Finished difference Result 859 states and 1980 transitions. [2018-10-02 11:35:49,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-02 11:35:49,605 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-02 11:35:49,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:49,610 INFO L225 Difference]: With dead ends: 859 [2018-10-02 11:35:49,610 INFO L226 Difference]: Without dead ends: 851 [2018-10-02 11:35:49,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2018-10-02 11:35:49,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-10-02 11:35:49,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 381. [2018-10-02 11:35:49,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-02 11:35:49,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-10-02 11:35:49,782 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-10-02 11:35:49,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:49,782 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-10-02 11:35:49,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:35:49,782 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-10-02 11:35:49,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:49,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:49,783 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:49,783 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:49,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:49,784 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-10-02 11:35:49,784 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:49,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:49,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:49,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:49,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:49,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:49,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:49,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:49,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:49,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:49,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:49,860 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-10-02 11:35:52,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:52,062 INFO L93 Difference]: Finished difference Result 962 states and 2175 transitions. [2018-10-02 11:35:52,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-02 11:35:52,062 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 11:35:52,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:52,068 INFO L225 Difference]: With dead ends: 962 [2018-10-02 11:35:52,068 INFO L226 Difference]: Without dead ends: 954 [2018-10-02 11:35:52,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-10-02 11:35:52,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-10-02 11:35:52,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 504. [2018-10-02 11:35:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-10-02 11:35:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1236 transitions. [2018-10-02 11:35:52,359 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1236 transitions. Word has length 12 [2018-10-02 11:35:52,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:52,360 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 1236 transitions. [2018-10-02 11:35:52,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:52,360 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1236 transitions. [2018-10-02 11:35:52,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:52,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:52,361 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:52,361 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:52,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:52,361 INFO L82 PathProgramCache]: Analyzing trace with hash 192721184, now seen corresponding path program 1 times [2018-10-02 11:35:52,362 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:52,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:52,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:52,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:52,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:52,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:52,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:52,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:52,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:52,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:52,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:52,476 INFO L87 Difference]: Start difference. First operand 504 states and 1236 transitions. Second operand 8 states. [2018-10-02 11:35:55,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:55,222 INFO L93 Difference]: Finished difference Result 1064 states and 2409 transitions. [2018-10-02 11:35:55,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-02 11:35:55,223 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 11:35:55,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:55,229 INFO L225 Difference]: With dead ends: 1064 [2018-10-02 11:35:55,229 INFO L226 Difference]: Without dead ends: 1056 [2018-10-02 11:35:55,230 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2018-10-02 11:35:55,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2018-10-02 11:35:55,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 522. [2018-10-02 11:35:55,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-10-02 11:35:55,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1279 transitions. [2018-10-02 11:35:55,552 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1279 transitions. Word has length 12 [2018-10-02 11:35:55,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:55,552 INFO L480 AbstractCegarLoop]: Abstraction has 522 states and 1279 transitions. [2018-10-02 11:35:55,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:55,553 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1279 transitions. [2018-10-02 11:35:55,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:55,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:55,553 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:55,554 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:55,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:55,554 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-10-02 11:35:55,555 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:55,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:55,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:55,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:55,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:55,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:55,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:55,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:55,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:55,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:55,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:55,634 INFO L87 Difference]: Start difference. First operand 522 states and 1279 transitions. Second operand 8 states. [2018-10-02 11:35:58,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:58,923 INFO L93 Difference]: Finished difference Result 1241 states and 2843 transitions. [2018-10-02 11:35:58,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-02 11:35:58,923 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 11:35:58,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:58,929 INFO L225 Difference]: With dead ends: 1241 [2018-10-02 11:35:58,930 INFO L226 Difference]: Without dead ends: 1233 [2018-10-02 11:35:58,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-10-02 11:35:58,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-10-02 11:35:59,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 570. [2018-10-02 11:35:59,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-10-02 11:35:59,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1411 transitions. [2018-10-02 11:35:59,296 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1411 transitions. Word has length 12 [2018-10-02 11:35:59,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:59,296 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1411 transitions. [2018-10-02 11:35:59,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:59,296 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1411 transitions. [2018-10-02 11:35:59,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:59,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:59,297 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:59,298 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:59,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:59,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1424310915, now seen corresponding path program 1 times [2018-10-02 11:35:59,299 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:59,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:59,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:59,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:59,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:59,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:59,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:59,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:59,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:59,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:59,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:59,385 INFO L87 Difference]: Start difference. First operand 570 states and 1411 transitions. Second operand 8 states. [2018-10-02 11:36:01,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:01,726 INFO L93 Difference]: Finished difference Result 1139 states and 2639 transitions. [2018-10-02 11:36:01,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 11:36:01,726 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 11:36:01,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:01,732 INFO L225 Difference]: With dead ends: 1139 [2018-10-02 11:36:01,732 INFO L226 Difference]: Without dead ends: 1131 [2018-10-02 11:36:01,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:36:01,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-10-02 11:36:02,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 588. [2018-10-02 11:36:02,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-10-02 11:36:02,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1454 transitions. [2018-10-02 11:36:02,050 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1454 transitions. Word has length 12 [2018-10-02 11:36:02,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:02,050 INFO L480 AbstractCegarLoop]: Abstraction has 588 states and 1454 transitions. [2018-10-02 11:36:02,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:36:02,050 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1454 transitions. [2018-10-02 11:36:02,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:36:02,051 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:02,051 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:02,051 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:02,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:02,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1424311194, now seen corresponding path program 1 times [2018-10-02 11:36:02,052 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:02,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:02,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:02,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:02,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:02,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:02,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:02,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:36:02,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:36:02,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:36:02,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:36:02,144 INFO L87 Difference]: Start difference. First operand 588 states and 1454 transitions. Second operand 8 states. [2018-10-02 11:36:05,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:05,261 INFO L93 Difference]: Finished difference Result 1325 states and 3082 transitions. [2018-10-02 11:36:05,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-02 11:36:05,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 11:36:05,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:05,267 INFO L225 Difference]: With dead ends: 1325 [2018-10-02 11:36:05,267 INFO L226 Difference]: Without dead ends: 1317 [2018-10-02 11:36:05,268 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-10-02 11:36:05,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2018-10-02 11:36:05,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 573. [2018-10-02 11:36:05,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-10-02 11:36:05,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1417 transitions. [2018-10-02 11:36:05,605 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1417 transitions. Word has length 12 [2018-10-02 11:36:05,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:05,605 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 1417 transitions. [2018-10-02 11:36:05,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:36:05,605 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1417 transitions. [2018-10-02 11:36:05,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:36:05,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:05,606 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:05,606 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:05,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:05,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-10-02 11:36:05,607 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:05,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:05,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:05,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:05,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:05,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:05,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:05,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:36:05,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:36:05,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:36:05,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:36:05,696 INFO L87 Difference]: Start difference. First operand 573 states and 1417 transitions. Second operand 8 states. [2018-10-02 11:36:09,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:09,133 INFO L93 Difference]: Finished difference Result 1334 states and 3099 transitions. [2018-10-02 11:36:09,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 11:36:09,133 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 11:36:09,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:09,139 INFO L225 Difference]: With dead ends: 1334 [2018-10-02 11:36:09,139 INFO L226 Difference]: Without dead ends: 1326 [2018-10-02 11:36:09,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2018-10-02 11:36:09,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2018-10-02 11:36:09,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 579. [2018-10-02 11:36:09,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-10-02 11:36:09,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1431 transitions. [2018-10-02 11:36:09,493 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1431 transitions. Word has length 12 [2018-10-02 11:36:09,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:09,493 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 1431 transitions. [2018-10-02 11:36:09,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:36:09,493 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1431 transitions. [2018-10-02 11:36:09,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:36:09,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:09,494 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:09,494 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:09,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:09,495 INFO L82 PathProgramCache]: Analyzing trace with hash 725999160, now seen corresponding path program 1 times [2018-10-02 11:36:09,495 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:09,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:09,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:09,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:09,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:09,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:09,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:09,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:36:09,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:36:09,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:36:09,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:36:09,571 INFO L87 Difference]: Start difference. First operand 579 states and 1431 transitions. Second operand 8 states. [2018-10-02 11:36:11,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:11,564 INFO L93 Difference]: Finished difference Result 919 states and 2156 transitions. [2018-10-02 11:36:11,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 11:36:11,565 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 11:36:11,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:11,570 INFO L225 Difference]: With dead ends: 919 [2018-10-02 11:36:11,570 INFO L226 Difference]: Without dead ends: 911 [2018-10-02 11:36:11,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:36:11,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-10-02 11:36:11,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 570. [2018-10-02 11:36:11,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-10-02 11:36:11,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1404 transitions. [2018-10-02 11:36:11,950 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1404 transitions. Word has length 12 [2018-10-02 11:36:11,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:11,950 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1404 transitions. [2018-10-02 11:36:11,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:36:11,950 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1404 transitions. [2018-10-02 11:36:11,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:36:11,951 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:11,951 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:11,951 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:11,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:11,952 INFO L82 PathProgramCache]: Analyzing trace with hash 725999439, now seen corresponding path program 1 times [2018-10-02 11:36:11,952 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:11,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:11,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:11,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:11,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:12,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:12,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:12,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:36:12,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:36:12,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:36:12,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:36:12,021 INFO L87 Difference]: Start difference. First operand 570 states and 1404 transitions. Second operand 8 states. [2018-10-02 11:36:14,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:14,792 INFO L93 Difference]: Finished difference Result 1095 states and 2579 transitions. [2018-10-02 11:36:14,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-02 11:36:14,794 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 11:36:14,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:14,800 INFO L225 Difference]: With dead ends: 1095 [2018-10-02 11:36:14,800 INFO L226 Difference]: Without dead ends: 1087 [2018-10-02 11:36:14,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-10-02 11:36:14,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2018-10-02 11:36:15,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 555. [2018-10-02 11:36:15,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-10-02 11:36:15,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1367 transitions. [2018-10-02 11:36:15,153 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1367 transitions. Word has length 12 [2018-10-02 11:36:15,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:15,153 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 1367 transitions. [2018-10-02 11:36:15,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:36:15,153 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1367 transitions. [2018-10-02 11:36:15,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:36:15,153 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:15,154 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:15,154 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:15,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:15,154 INFO L82 PathProgramCache]: Analyzing trace with hash 729878996, now seen corresponding path program 1 times [2018-10-02 11:36:15,155 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:15,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:15,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:15,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:15,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:15,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:15,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:15,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:36:15,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:36:15,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:36:15,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:36:15,227 INFO L87 Difference]: Start difference. First operand 555 states and 1367 transitions. Second operand 8 states. [2018-10-02 11:36:19,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:19,078 INFO L93 Difference]: Finished difference Result 1304 states and 3052 transitions. [2018-10-02 11:36:19,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 11:36:19,078 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 11:36:19,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:19,082 INFO L225 Difference]: With dead ends: 1304 [2018-10-02 11:36:19,082 INFO L226 Difference]: Without dead ends: 1296 [2018-10-02 11:36:19,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-10-02 11:36:19,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-10-02 11:36:19,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 552. [2018-10-02 11:36:19,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-10-02 11:36:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1361 transitions. [2018-10-02 11:36:19,443 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1361 transitions. Word has length 12 [2018-10-02 11:36:19,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:19,443 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 1361 transitions. [2018-10-02 11:36:19,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:36:19,443 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1361 transitions. [2018-10-02 11:36:19,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:36:19,444 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:19,444 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:19,445 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:19,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:19,445 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-10-02 11:36:19,445 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:19,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:19,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:19,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:19,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:19,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:19,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:19,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:36:19,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:36:19,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:36:19,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:36:19,532 INFO L87 Difference]: Start difference. First operand 552 states and 1361 transitions. Second operand 8 states. [2018-10-02 11:36:22,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:22,861 INFO L93 Difference]: Finished difference Result 1192 states and 2790 transitions. [2018-10-02 11:36:22,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-02 11:36:22,861 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 11:36:22,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:22,864 INFO L225 Difference]: With dead ends: 1192 [2018-10-02 11:36:22,864 INFO L226 Difference]: Without dead ends: 1184 [2018-10-02 11:36:22,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2018-10-02 11:36:22,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-10-02 11:36:23,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 602. [2018-10-02 11:36:23,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-10-02 11:36:23,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-10-02 11:36:23,368 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-10-02 11:36:23,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:23,368 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-10-02 11:36:23,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:36:23,368 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-10-02 11:36:23,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 11:36:23,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:23,369 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:23,369 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:23,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:23,370 INFO L82 PathProgramCache]: Analyzing trace with hash 308305537, now seen corresponding path program 1 times [2018-10-02 11:36:23,370 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:23,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:23,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:23,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:23,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:23,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:23,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:23,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 11:36:23,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 11:36:23,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 11:36:23,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:36:23,429 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-10-02 11:36:24,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:24,228 INFO L93 Difference]: Finished difference Result 1139 states and 2816 transitions. [2018-10-02 11:36:24,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 11:36:24,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-02 11:36:24,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:24,230 INFO L225 Difference]: With dead ends: 1139 [2018-10-02 11:36:24,230 INFO L226 Difference]: Without dead ends: 625 [2018-10-02 11:36:24,232 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:36:24,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-10-02 11:36:24,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 602. [2018-10-02 11:36:24,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-10-02 11:36:24,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1415 transitions. [2018-10-02 11:36:24,698 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1415 transitions. Word has length 13 [2018-10-02 11:36:24,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:24,698 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1415 transitions. [2018-10-02 11:36:24,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 11:36:24,698 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1415 transitions. [2018-10-02 11:36:24,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 11:36:24,699 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:24,699 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:24,699 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:24,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:24,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1757679849, now seen corresponding path program 1 times [2018-10-02 11:36:24,700 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:24,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:24,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:24,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:24,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:24,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:24,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:24,871 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:24,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:24,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:25,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:25,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:25,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-10-02 11:36:25,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 11:36:25,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 11:36:25,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:36:25,898 INFO L87 Difference]: Start difference. First operand 602 states and 1415 transitions. Second operand 16 states. [2018-10-02 11:36:29,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:29,305 INFO L93 Difference]: Finished difference Result 794 states and 1860 transitions. [2018-10-02 11:36:29,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-02 11:36:29,306 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-10-02 11:36:29,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:29,307 INFO L225 Difference]: With dead ends: 794 [2018-10-02 11:36:29,308 INFO L226 Difference]: Without dead ends: 789 [2018-10-02 11:36:29,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-10-02 11:36:29,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-10-02 11:36:30,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 664. [2018-10-02 11:36:30,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-10-02 11:36:30,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1563 transitions. [2018-10-02 11:36:30,031 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1563 transitions. Word has length 13 [2018-10-02 11:36:30,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:30,031 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 1563 transitions. [2018-10-02 11:36:30,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 11:36:30,032 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1563 transitions. [2018-10-02 11:36:30,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 11:36:30,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:30,032 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:30,033 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:30,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:30,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1161218619, now seen corresponding path program 1 times [2018-10-02 11:36:30,033 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:30,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:30,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:30,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:30,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:30,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:30,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:30,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 11:36:30,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 11:36:30,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 11:36:30,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:36:30,085 INFO L87 Difference]: Start difference. First operand 664 states and 1563 transitions. Second operand 5 states. [2018-10-02 11:36:31,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:31,527 INFO L93 Difference]: Finished difference Result 1317 states and 3113 transitions. [2018-10-02 11:36:31,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 11:36:31,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-02 11:36:31,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:31,528 INFO L225 Difference]: With dead ends: 1317 [2018-10-02 11:36:31,529 INFO L226 Difference]: Without dead ends: 729 [2018-10-02 11:36:31,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:36:31,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-10-02 11:36:32,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 690. [2018-10-02 11:36:32,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-10-02 11:36:32,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-10-02 11:36:32,150 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-10-02 11:36:32,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:32,150 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-10-02 11:36:32,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 11:36:32,150 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-10-02 11:36:32,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:36:32,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:32,151 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:32,152 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:32,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:32,152 INFO L82 PathProgramCache]: Analyzing trace with hash -942981820, now seen corresponding path program 1 times [2018-10-02 11:36:32,152 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:32,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:32,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:32,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:32,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:32,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:32,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:32,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:36:32,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:36:32,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:36:32,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:36:32,349 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 8 states. [2018-10-02 11:36:35,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:35,819 INFO L93 Difference]: Finished difference Result 1435 states and 3122 transitions. [2018-10-02 11:36:35,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-02 11:36:35,820 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-02 11:36:35,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:35,823 INFO L225 Difference]: With dead ends: 1435 [2018-10-02 11:36:35,823 INFO L226 Difference]: Without dead ends: 1427 [2018-10-02 11:36:35,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-10-02 11:36:35,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2018-10-02 11:36:36,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 789. [2018-10-02 11:36:36,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-10-02 11:36:36,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1779 transitions. [2018-10-02 11:36:36,733 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1779 transitions. Word has length 16 [2018-10-02 11:36:36,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:36,733 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 1779 transitions. [2018-10-02 11:36:36,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:36:36,733 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1779 transitions. [2018-10-02 11:36:36,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:36:36,734 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:36,734 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:36,734 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:36,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:36,735 INFO L82 PathProgramCache]: Analyzing trace with hash -945782174, now seen corresponding path program 1 times [2018-10-02 11:36:36,735 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:36,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:36,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:36,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:36,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:37,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:37,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:37,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:36:37,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:36:37,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:36:37,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:36:37,014 INFO L87 Difference]: Start difference. First operand 789 states and 1779 transitions. Second operand 8 states. [2018-10-02 11:36:40,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:40,717 INFO L93 Difference]: Finished difference Result 1599 states and 3473 transitions. [2018-10-02 11:36:40,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 11:36:40,718 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-02 11:36:40,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:40,721 INFO L225 Difference]: With dead ends: 1599 [2018-10-02 11:36:40,722 INFO L226 Difference]: Without dead ends: 1591 [2018-10-02 11:36:40,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-10-02 11:36:40,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-10-02 11:36:41,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 821. [2018-10-02 11:36:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-10-02 11:36:41,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1853 transitions. [2018-10-02 11:36:41,516 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1853 transitions. Word has length 16 [2018-10-02 11:36:41,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:41,516 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1853 transitions. [2018-10-02 11:36:41,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:36:41,516 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1853 transitions. [2018-10-02 11:36:41,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:36:41,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:41,517 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:41,517 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:41,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:41,517 INFO L82 PathProgramCache]: Analyzing trace with hash -945680029, now seen corresponding path program 1 times [2018-10-02 11:36:41,518 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:41,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:41,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:41,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:41,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:41,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:41,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:41,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:36:41,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:36:41,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:36:41,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:36:41,606 INFO L87 Difference]: Start difference. First operand 821 states and 1853 transitions. Second operand 8 states. [2018-10-02 11:36:44,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:44,786 INFO L93 Difference]: Finished difference Result 1411 states and 3060 transitions. [2018-10-02 11:36:44,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 11:36:44,786 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-02 11:36:44,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:44,791 INFO L225 Difference]: With dead ends: 1411 [2018-10-02 11:36:44,792 INFO L226 Difference]: Without dead ends: 1403 [2018-10-02 11:36:44,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:36:44,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-10-02 11:36:45,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 823. [2018-10-02 11:36:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-10-02 11:36:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1851 transitions. [2018-10-02 11:36:45,709 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1851 transitions. Word has length 16 [2018-10-02 11:36:45,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:45,709 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1851 transitions. [2018-10-02 11:36:45,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:36:45,709 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1851 transitions. [2018-10-02 11:36:45,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:36:45,710 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:45,710 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:45,710 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:45,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:45,710 INFO L82 PathProgramCache]: Analyzing trace with hash -648408412, now seen corresponding path program 1 times [2018-10-02 11:36:45,710 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:45,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:45,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:45,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:45,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:45,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:45,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:45,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:36:45,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:36:45,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:36:45,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:36:45,835 INFO L87 Difference]: Start difference. First operand 823 states and 1851 transitions. Second operand 8 states. [2018-10-02 11:36:49,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:49,379 INFO L93 Difference]: Finished difference Result 1490 states and 3255 transitions. [2018-10-02 11:36:49,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 11:36:49,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-02 11:36:49,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:49,382 INFO L225 Difference]: With dead ends: 1490 [2018-10-02 11:36:49,382 INFO L226 Difference]: Without dead ends: 1482 [2018-10-02 11:36:49,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-10-02 11:36:49,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2018-10-02 11:36:50,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 943. [2018-10-02 11:36:50,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2018-10-02 11:36:50,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 2141 transitions. [2018-10-02 11:36:50,259 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 2141 transitions. Word has length 16 [2018-10-02 11:36:50,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:50,260 INFO L480 AbstractCegarLoop]: Abstraction has 943 states and 2141 transitions. [2018-10-02 11:36:50,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:36:50,260 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2141 transitions. [2018-10-02 11:36:50,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:36:50,260 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:50,260 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:50,261 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:50,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:50,261 INFO L82 PathProgramCache]: Analyzing trace with hash -648306267, now seen corresponding path program 1 times [2018-10-02 11:36:50,261 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:50,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:50,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:50,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:50,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:50,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:50,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:50,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:36:50,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:36:50,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:36:50,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:36:50,337 INFO L87 Difference]: Start difference. First operand 943 states and 2141 transitions. Second operand 8 states. [2018-10-02 11:36:53,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:53,723 INFO L93 Difference]: Finished difference Result 1427 states and 3102 transitions. [2018-10-02 11:36:53,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-02 11:36:53,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-02 11:36:53,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:53,725 INFO L225 Difference]: With dead ends: 1427 [2018-10-02 11:36:53,725 INFO L226 Difference]: Without dead ends: 1419 [2018-10-02 11:36:53,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-10-02 11:36:53,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2018-10-02 11:36:54,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 927. [2018-10-02 11:36:54,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-10-02 11:36:54,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2109 transitions. [2018-10-02 11:36:54,638 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2109 transitions. Word has length 16 [2018-10-02 11:36:54,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:54,639 INFO L480 AbstractCegarLoop]: Abstraction has 927 states and 2109 transitions. [2018-10-02 11:36:54,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:36:54,639 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2109 transitions. [2018-10-02 11:36:54,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:36:54,640 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:54,640 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:54,640 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:54,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:54,640 INFO L82 PathProgramCache]: Analyzing trace with hash -639392031, now seen corresponding path program 1 times [2018-10-02 11:36:54,641 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:54,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:54,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:54,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:54,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:54,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:54,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:54,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:36:54,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:36:54,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:36:54,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:36:54,757 INFO L87 Difference]: Start difference. First operand 927 states and 2109 transitions. Second operand 8 states. [2018-10-02 11:36:57,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:57,914 INFO L93 Difference]: Finished difference Result 1306 states and 2848 transitions. [2018-10-02 11:36:57,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-02 11:36:57,915 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-02 11:36:57,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:57,916 INFO L225 Difference]: With dead ends: 1306 [2018-10-02 11:36:57,916 INFO L226 Difference]: Without dead ends: 1298 [2018-10-02 11:36:57,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-10-02 11:36:57,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2018-10-02 11:36:58,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 986. [2018-10-02 11:36:58,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-10-02 11:36:58,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2232 transitions. [2018-10-02 11:36:58,974 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2232 transitions. Word has length 16 [2018-10-02 11:36:58,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:58,975 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2232 transitions. [2018-10-02 11:36:58,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:36:58,975 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2232 transitions. [2018-10-02 11:36:58,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:36:58,975 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:58,975 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:58,976 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:58,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:58,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1639330009, now seen corresponding path program 1 times [2018-10-02 11:36:58,976 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:58,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:58,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:58,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:58,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:59,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:36:59,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:59,048 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:59,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:59,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:59,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:36:59,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:59,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-02 11:36:59,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:36:59,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:36:59,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:36:59,093 INFO L87 Difference]: Start difference. First operand 986 states and 2232 transitions. Second operand 8 states. [2018-10-02 11:37:02,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:02,295 INFO L93 Difference]: Finished difference Result 1285 states and 2841 transitions. [2018-10-02 11:37:02,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-02 11:37:02,296 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-02 11:37:02,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:02,298 INFO L225 Difference]: With dead ends: 1285 [2018-10-02 11:37:02,298 INFO L226 Difference]: Without dead ends: 1277 [2018-10-02 11:37:02,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2018-10-02 11:37:02,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2018-10-02 11:37:03,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 986. [2018-10-02 11:37:03,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-10-02 11:37:03,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2231 transitions. [2018-10-02 11:37:03,369 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2231 transitions. Word has length 16 [2018-10-02 11:37:03,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:03,369 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2231 transitions. [2018-10-02 11:37:03,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:37:03,369 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2231 transitions. [2018-10-02 11:37:03,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:37:03,370 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:03,370 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:03,370 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:03,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:03,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1609777337, now seen corresponding path program 1 times [2018-10-02 11:37:03,371 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:03,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:03,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:03,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:03,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:03,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:37:03,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:03,472 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:03,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:03,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:03,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:37:03,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:03,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-02 11:37:03,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:37:03,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:37:03,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:37:03,523 INFO L87 Difference]: Start difference. First operand 986 states and 2231 transitions. Second operand 8 states. [2018-10-02 11:37:07,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:07,245 INFO L93 Difference]: Finished difference Result 1518 states and 3315 transitions. [2018-10-02 11:37:07,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-02 11:37:07,245 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-02 11:37:07,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:07,247 INFO L225 Difference]: With dead ends: 1518 [2018-10-02 11:37:07,247 INFO L226 Difference]: Without dead ends: 1510 [2018-10-02 11:37:07,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2018-10-02 11:37:07,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-10-02 11:37:08,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 977. [2018-10-02 11:37:08,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2018-10-02 11:37:08,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 2210 transitions. [2018-10-02 11:37:08,292 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 2210 transitions. Word has length 16 [2018-10-02 11:37:08,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:08,292 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 2210 transitions. [2018-10-02 11:37:08,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:37:08,292 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 2210 transitions. [2018-10-02 11:37:08,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:37:08,293 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:08,293 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:08,293 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:08,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:08,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1612577691, now seen corresponding path program 1 times [2018-10-02 11:37:08,294 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:08,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:08,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:08,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:08,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:08,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:37:08,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:08,368 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:08,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:08,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:08,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:37:08,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:08,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-02 11:37:08,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:37:08,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:37:08,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:37:08,424 INFO L87 Difference]: Start difference. First operand 977 states and 2210 transitions. Second operand 8 states. [2018-10-02 11:37:12,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:12,094 INFO L93 Difference]: Finished difference Result 1448 states and 3170 transitions. [2018-10-02 11:37:12,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-02 11:37:12,094 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-02 11:37:12,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:12,096 INFO L225 Difference]: With dead ends: 1448 [2018-10-02 11:37:12,096 INFO L226 Difference]: Without dead ends: 1440 [2018-10-02 11:37:12,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2018-10-02 11:37:12,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2018-10-02 11:37:13,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 941. [2018-10-02 11:37:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-10-02 11:37:13,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 2120 transitions. [2018-10-02 11:37:13,109 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 2120 transitions. Word has length 16 [2018-10-02 11:37:13,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:13,109 INFO L480 AbstractCegarLoop]: Abstraction has 941 states and 2120 transitions. [2018-10-02 11:37:13,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:37:13,110 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 2120 transitions. [2018-10-02 11:37:13,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:37:13,110 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:13,111 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:13,111 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:13,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:13,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1612475546, now seen corresponding path program 1 times [2018-10-02 11:37:13,112 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:13,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:13,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:13,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:13,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:13,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:37:13,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:13,229 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:13,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:13,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:13,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:37:13,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:13,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-02 11:37:13,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:37:13,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:37:13,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:37:13,268 INFO L87 Difference]: Start difference. First operand 941 states and 2120 transitions. Second operand 8 states. [2018-10-02 11:37:16,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:16,301 INFO L93 Difference]: Finished difference Result 1254 states and 2743 transitions. [2018-10-02 11:37:16,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 11:37:16,302 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-02 11:37:16,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:16,303 INFO L225 Difference]: With dead ends: 1254 [2018-10-02 11:37:16,303 INFO L226 Difference]: Without dead ends: 1246 [2018-10-02 11:37:16,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:37:16,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2018-10-02 11:37:17,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 896. [2018-10-02 11:37:17,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-10-02 11:37:17,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 2017 transitions. [2018-10-02 11:37:17,299 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 2017 transitions. Word has length 16 [2018-10-02 11:37:17,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:17,300 INFO L480 AbstractCegarLoop]: Abstraction has 896 states and 2017 transitions. [2018-10-02 11:37:17,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:37:17,300 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 2017 transitions. [2018-10-02 11:37:17,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:37:17,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:17,301 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:17,301 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:17,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:17,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1200558936, now seen corresponding path program 1 times [2018-10-02 11:37:17,302 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:17,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:17,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:17,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:17,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:17,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:17,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:17,396 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:17,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:17,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:17,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:17,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:17,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-02 11:37:17,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 11:37:17,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 11:37:17,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:37:17,760 INFO L87 Difference]: Start difference. First operand 896 states and 2017 transitions. Second operand 17 states. [2018-10-02 11:37:22,191 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-02 11:37:23,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:23,821 INFO L93 Difference]: Finished difference Result 1278 states and 2792 transitions. [2018-10-02 11:37:23,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-02 11:37:23,822 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-02 11:37:23,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:23,823 INFO L225 Difference]: With dead ends: 1278 [2018-10-02 11:37:23,823 INFO L226 Difference]: Without dead ends: 1270 [2018-10-02 11:37:23,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=519, Invalid=2133, Unknown=0, NotChecked=0, Total=2652 [2018-10-02 11:37:23,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2018-10-02 11:37:24,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 970. [2018-10-02 11:37:24,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2018-10-02 11:37:24,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2200 transitions. [2018-10-02 11:37:24,904 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 2200 transitions. Word has length 16 [2018-10-02 11:37:24,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:24,904 INFO L480 AbstractCegarLoop]: Abstraction has 970 states and 2200 transitions. [2018-10-02 11:37:24,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 11:37:24,904 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 2200 transitions. [2018-10-02 11:37:24,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:37:24,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:24,904 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:24,905 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:24,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:24,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257424, now seen corresponding path program 1 times [2018-10-02 11:37:24,905 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:24,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:24,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:24,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:24,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:25,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:25,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:37:25,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-02 11:37:25,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:37:25,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:37:25,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:37:25,068 INFO L87 Difference]: Start difference. First operand 970 states and 2200 transitions. Second operand 9 states. [2018-10-02 11:37:28,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:28,506 INFO L93 Difference]: Finished difference Result 1180 states and 2573 transitions. [2018-10-02 11:37:28,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-02 11:37:28,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-02 11:37:28,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:28,508 INFO L225 Difference]: With dead ends: 1180 [2018-10-02 11:37:28,508 INFO L226 Difference]: Without dead ends: 1172 [2018-10-02 11:37:28,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2018-10-02 11:37:28,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2018-10-02 11:37:29,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 948. [2018-10-02 11:37:29,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-10-02 11:37:29,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 2144 transitions. [2018-10-02 11:37:29,532 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 2144 transitions. Word has length 16 [2018-10-02 11:37:29,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:29,532 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 2144 transitions. [2018-10-02 11:37:29,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:37:29,532 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 2144 transitions. [2018-10-02 11:37:29,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:37:29,533 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:29,533 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:29,533 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:29,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:29,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257145, now seen corresponding path program 1 times [2018-10-02 11:37:29,533 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:29,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:29,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:29,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:29,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:30,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:30,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:37:30,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-02 11:37:30,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:37:30,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:37:30,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:37:30,089 INFO L87 Difference]: Start difference. First operand 948 states and 2144 transitions. Second operand 9 states. [2018-10-02 11:37:33,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:33,894 INFO L93 Difference]: Finished difference Result 1233 states and 2705 transitions. [2018-10-02 11:37:33,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 11:37:33,895 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-02 11:37:33,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:33,896 INFO L225 Difference]: With dead ends: 1233 [2018-10-02 11:37:33,896 INFO L226 Difference]: Without dead ends: 1225 [2018-10-02 11:37:33,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2018-10-02 11:37:33,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2018-10-02 11:37:35,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 966. [2018-10-02 11:37:35,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-10-02 11:37:35,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 2192 transitions. [2018-10-02 11:37:35,054 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 2192 transitions. Word has length 16 [2018-10-02 11:37:35,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:35,055 INFO L480 AbstractCegarLoop]: Abstraction has 966 states and 2192 transitions. [2018-10-02 11:37:35,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:37:35,055 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 2192 transitions. [2018-10-02 11:37:35,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:37:35,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:35,056 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:35,056 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:35,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:35,056 INFO L82 PathProgramCache]: Analyzing trace with hash -2004746308, now seen corresponding path program 1 times [2018-10-02 11:37:35,056 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:35,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:35,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:35,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:35,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:35,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:35,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:37:35,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-02 11:37:35,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:37:35,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:37:35,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:37:35,341 INFO L87 Difference]: Start difference. First operand 966 states and 2192 transitions. Second operand 9 states. [2018-10-02 11:37:39,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:39,722 INFO L93 Difference]: Finished difference Result 1537 states and 3410 transitions. [2018-10-02 11:37:39,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-02 11:37:39,722 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-02 11:37:39,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:39,724 INFO L225 Difference]: With dead ends: 1537 [2018-10-02 11:37:39,724 INFO L226 Difference]: Without dead ends: 1529 [2018-10-02 11:37:39,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=824, Unknown=0, NotChecked=0, Total=1056 [2018-10-02 11:37:39,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2018-10-02 11:37:40,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1013. [2018-10-02 11:37:40,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2018-10-02 11:37:40,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 2297 transitions. [2018-10-02 11:37:40,947 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 2297 transitions. Word has length 16 [2018-10-02 11:37:40,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:40,948 INFO L480 AbstractCegarLoop]: Abstraction has 1013 states and 2297 transitions. [2018-10-02 11:37:40,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:37:40,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 2297 transitions. [2018-10-02 11:37:40,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:37:40,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:40,948 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:40,949 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:40,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:40,949 INFO L82 PathProgramCache]: Analyzing trace with hash -35185992, now seen corresponding path program 1 times [2018-10-02 11:37:40,949 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:40,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:40,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:40,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:40,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:41,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:41,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:37:41,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-02 11:37:41,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:37:41,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:37:41,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:37:41,083 INFO L87 Difference]: Start difference. First operand 1013 states and 2297 transitions. Second operand 9 states. [2018-10-02 11:37:45,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:45,724 INFO L93 Difference]: Finished difference Result 1590 states and 3484 transitions. [2018-10-02 11:37:45,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-02 11:37:45,725 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-02 11:37:45,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:45,727 INFO L225 Difference]: With dead ends: 1590 [2018-10-02 11:37:45,727 INFO L226 Difference]: Without dead ends: 1582 [2018-10-02 11:37:45,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2018-10-02 11:37:45,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2018-10-02 11:37:46,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1020. [2018-10-02 11:37:46,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2018-10-02 11:37:46,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2311 transitions. [2018-10-02 11:37:46,978 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2311 transitions. Word has length 16 [2018-10-02 11:37:46,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:46,978 INFO L480 AbstractCegarLoop]: Abstraction has 1020 states and 2311 transitions. [2018-10-02 11:37:46,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:37:46,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2311 transitions. [2018-10-02 11:37:46,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:37:46,978 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:46,979 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:46,979 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:46,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:46,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1174622531, now seen corresponding path program 1 times [2018-10-02 11:37:46,979 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:46,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:46,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:46,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:46,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:47,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:47,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:47,045 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:47,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:47,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:47,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:47,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:47,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-02 11:37:47,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 11:37:47,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 11:37:47,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:37:47,204 INFO L87 Difference]: Start difference. First operand 1020 states and 2311 transitions. Second operand 17 states. [2018-10-02 11:37:57,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:57,012 INFO L93 Difference]: Finished difference Result 1949 states and 4288 transitions. [2018-10-02 11:37:57,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-02 11:37:57,012 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-02 11:37:57,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:57,014 INFO L225 Difference]: With dead ends: 1949 [2018-10-02 11:37:57,014 INFO L226 Difference]: Without dead ends: 1941 [2018-10-02 11:37:57,017 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2996 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1453, Invalid=7667, Unknown=0, NotChecked=0, Total=9120 [2018-10-02 11:37:57,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2018-10-02 11:37:58,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1031. [2018-10-02 11:37:58,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2018-10-02 11:37:58,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 2337 transitions. [2018-10-02 11:37:58,239 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 2337 transitions. Word has length 16 [2018-10-02 11:37:58,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:58,240 INFO L480 AbstractCegarLoop]: Abstraction has 1031 states and 2337 transitions. [2018-10-02 11:37:58,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 11:37:58,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 2337 transitions. [2018-10-02 11:37:58,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:37:58,240 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:58,240 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:58,241 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:58,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:58,241 INFO L82 PathProgramCache]: Analyzing trace with hash 913888237, now seen corresponding path program 1 times [2018-10-02 11:37:58,241 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:58,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:58,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:58,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:58,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:59,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:59,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:37:59,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-02 11:37:59,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:37:59,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:37:59,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:37:59,022 INFO L87 Difference]: Start difference. First operand 1031 states and 2337 transitions. Second operand 9 states. [2018-10-02 11:38:03,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:03,748 INFO L93 Difference]: Finished difference Result 1420 states and 3128 transitions. [2018-10-02 11:38:03,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-02 11:38:03,748 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-02 11:38:03,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:03,750 INFO L225 Difference]: With dead ends: 1420 [2018-10-02 11:38:03,750 INFO L226 Difference]: Without dead ends: 1412 [2018-10-02 11:38:03,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2018-10-02 11:38:03,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2018-10-02 11:38:05,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 963. [2018-10-02 11:38:05,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2018-10-02 11:38:05,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2173 transitions. [2018-10-02 11:38:05,162 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2173 transitions. Word has length 16 [2018-10-02 11:38:05,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:05,162 INFO L480 AbstractCegarLoop]: Abstraction has 963 states and 2173 transitions. [2018-10-02 11:38:05,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:38:05,162 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2173 transitions. [2018-10-02 11:38:05,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:38:05,163 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:05,163 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:05,163 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:05,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:05,163 INFO L82 PathProgramCache]: Analyzing trace with hash 2123696760, now seen corresponding path program 1 times [2018-10-02 11:38:05,163 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:05,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:05,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:05,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:05,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:05,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:38:05,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:38:05,235 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:38:05,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:05,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:38:05,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:38:05,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:38:05,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-02 11:38:05,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 11:38:05,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 11:38:05,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:38:05,388 INFO L87 Difference]: Start difference. First operand 963 states and 2173 transitions. Second operand 17 states. [2018-10-02 11:38:18,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:18,649 INFO L93 Difference]: Finished difference Result 2767 states and 6075 transitions. [2018-10-02 11:38:18,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-02 11:38:18,650 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-02 11:38:18,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:18,653 INFO L225 Difference]: With dead ends: 2767 [2018-10-02 11:38:18,653 INFO L226 Difference]: Without dead ends: 2759 [2018-10-02 11:38:18,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6116 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2425, Invalid=14867, Unknown=0, NotChecked=0, Total=17292 [2018-10-02 11:38:18,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-10-02 11:38:20,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 1094. [2018-10-02 11:38:20,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2018-10-02 11:38:20,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 2474 transitions. [2018-10-02 11:38:20,178 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 2474 transitions. Word has length 16 [2018-10-02 11:38:20,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:20,179 INFO L480 AbstractCegarLoop]: Abstraction has 1094 states and 2474 transitions. [2018-10-02 11:38:20,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 11:38:20,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 2474 transitions. [2018-10-02 11:38:20,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:38:20,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:20,180 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:20,181 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:20,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:20,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1400694311, now seen corresponding path program 1 times [2018-10-02 11:38:20,181 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:20,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:20,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:20,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:20,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:20,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:20,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:38:20,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:38:20,274 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:38:20,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:20,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:38:20,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:38:20,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:38:20,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-02 11:38:20,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 11:38:20,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 11:38:20,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:38:20,433 INFO L87 Difference]: Start difference. First operand 1094 states and 2474 transitions. Second operand 17 states. [2018-10-02 11:38:34,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:34,237 INFO L93 Difference]: Finished difference Result 2361 states and 5206 transitions. [2018-10-02 11:38:34,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-10-02 11:38:34,249 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-02 11:38:34,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:34,251 INFO L225 Difference]: With dead ends: 2361 [2018-10-02 11:38:34,251 INFO L226 Difference]: Without dead ends: 2353 [2018-10-02 11:38:34,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9524 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3069, Invalid=22371, Unknown=0, NotChecked=0, Total=25440 [2018-10-02 11:38:34,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2018-10-02 11:38:35,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 1155. [2018-10-02 11:38:35,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155 states. [2018-10-02 11:38:35,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 2607 transitions. [2018-10-02 11:38:35,786 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 2607 transitions. Word has length 16 [2018-10-02 11:38:35,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:35,786 INFO L480 AbstractCegarLoop]: Abstraction has 1155 states and 2607 transitions. [2018-10-02 11:38:35,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 11:38:35,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 2607 transitions. [2018-10-02 11:38:35,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-02 11:38:35,787 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:35,787 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:35,787 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:35,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:35,788 INFO L82 PathProgramCache]: Analyzing trace with hash 417107387, now seen corresponding path program 1 times [2018-10-02 11:38:35,788 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:35,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:35,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:35,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:35,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:35,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:38:35,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:38:35,896 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:38:35,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:35,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:38:35,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:38:36,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:38:36,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-10-02 11:38:36,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 11:38:36,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 11:38:36,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:38:36,015 INFO L87 Difference]: Start difference. First operand 1155 states and 2607 transitions. Second operand 14 states. [2018-10-02 11:38:38,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:38,906 INFO L93 Difference]: Finished difference Result 1507 states and 3367 transitions. [2018-10-02 11:38:38,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-02 11:38:38,907 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2018-10-02 11:38:38,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:38,909 INFO L225 Difference]: With dead ends: 1507 [2018-10-02 11:38:38,909 INFO L226 Difference]: Without dead ends: 1502 [2018-10-02 11:38:38,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:38:38,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2018-10-02 11:38:40,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1339. [2018-10-02 11:38:40,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2018-10-02 11:38:40,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2995 transitions. [2018-10-02 11:38:40,939 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2995 transitions. Word has length 17 [2018-10-02 11:38:40,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:40,939 INFO L480 AbstractCegarLoop]: Abstraction has 1339 states and 2995 transitions. [2018-10-02 11:38:40,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 11:38:40,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2995 transitions. [2018-10-02 11:38:40,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-02 11:38:40,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:40,940 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:40,941 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:40,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:40,941 INFO L82 PathProgramCache]: Analyzing trace with hash 524852653, now seen corresponding path program 1 times [2018-10-02 11:38:40,941 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:40,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:40,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:40,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:40,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:41,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:38:41,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:38:41,077 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:38:41,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:41,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:38:41,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:38:41,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:38:41,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 18 [2018-10-02 11:38:41,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-02 11:38:41,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-02 11:38:41,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:38:41,880 INFO L87 Difference]: Start difference. First operand 1339 states and 2995 transitions. Second operand 19 states. [2018-10-02 11:38:42,456 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-10-02 11:38:52,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:52,639 INFO L93 Difference]: Finished difference Result 3654 states and 8066 transitions. [2018-10-02 11:38:52,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-02 11:38:52,639 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2018-10-02 11:38:52,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:52,644 INFO L225 Difference]: With dead ends: 3654 [2018-10-02 11:38:52,644 INFO L226 Difference]: Without dead ends: 3646 [2018-10-02 11:38:52,645 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1127, Invalid=3703, Unknown=0, NotChecked=0, Total=4830 [2018-10-02 11:38:52,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3646 states. [2018-10-02 11:38:55,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3646 to 2136. [2018-10-02 11:38:55,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2136 states. [2018-10-02 11:38:55,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 4855 transitions. [2018-10-02 11:38:55,594 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 4855 transitions. Word has length 17 [2018-10-02 11:38:55,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:55,595 INFO L480 AbstractCegarLoop]: Abstraction has 2136 states and 4855 transitions. [2018-10-02 11:38:55,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-02 11:38:55,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 4855 transitions. [2018-10-02 11:38:55,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-02 11:38:55,596 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:55,596 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:55,596 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:55,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:55,596 INFO L82 PathProgramCache]: Analyzing trace with hash -405945350, now seen corresponding path program 1 times [2018-10-02 11:38:55,596 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:55,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:55,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:55,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:55,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:55,690 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:38:55,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:38:55,691 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:38:55,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:55,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:38:55,747 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:38:55,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:38:55,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-02 11:38:55,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-02 11:38:55,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-02 11:38:55,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-10-02 11:38:55,769 INFO L87 Difference]: Start difference. First operand 2136 states and 4855 transitions. Second operand 11 states. [2018-10-02 11:39:01,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:39:01,531 INFO L93 Difference]: Finished difference Result 2767 states and 6209 transitions. [2018-10-02 11:39:01,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 11:39:01,532 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-02 11:39:01,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:39:01,535 INFO L225 Difference]: With dead ends: 2767 [2018-10-02 11:39:01,535 INFO L226 Difference]: Without dead ends: 2759 [2018-10-02 11:39:01,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2018-10-02 11:39:01,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-10-02 11:39:04,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 2216. [2018-10-02 11:39:04,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2018-10-02 11:39:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 5027 transitions. [2018-10-02 11:39:04,452 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 5027 transitions. Word has length 20 [2018-10-02 11:39:04,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:39:04,452 INFO L480 AbstractCegarLoop]: Abstraction has 2216 states and 5027 transitions. [2018-10-02 11:39:04,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-02 11:39:04,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 5027 transitions. [2018-10-02 11:39:04,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-02 11:39:04,453 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:39:04,453 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:39:04,453 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:39:04,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:39:04,453 INFO L82 PathProgramCache]: Analyzing trace with hash -408745704, now seen corresponding path program 1 times [2018-10-02 11:39:04,453 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:39:04,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:39:04,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:04,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:39:04,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:04,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:39:04,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:39:04,535 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:39:04,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:39:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:04,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:39:04,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:39:04,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:39:04,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-02 11:39:04,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-02 11:39:04,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-02 11:39:04,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-10-02 11:39:04,609 INFO L87 Difference]: Start difference. First operand 2216 states and 5027 transitions. Second operand 11 states. [2018-10-02 11:39:11,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:39:11,014 INFO L93 Difference]: Finished difference Result 3146 states and 7011 transitions. [2018-10-02 11:39:11,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 11:39:11,014 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-02 11:39:11,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:39:11,018 INFO L225 Difference]: With dead ends: 3146 [2018-10-02 11:39:11,018 INFO L226 Difference]: Without dead ends: 3138 [2018-10-02 11:39:11,019 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2018-10-02 11:39:11,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2018-10-02 11:39:13,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2248. [2018-10-02 11:39:13,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2018-10-02 11:39:14,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 5091 transitions. [2018-10-02 11:39:14,001 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 5091 transitions. Word has length 20 [2018-10-02 11:39:14,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:39:14,001 INFO L480 AbstractCegarLoop]: Abstraction has 2248 states and 5091 transitions. [2018-10-02 11:39:14,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-02 11:39:14,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 5091 transitions. [2018-10-02 11:39:14,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-02 11:39:14,002 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:39:14,002 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:39:14,002 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:39:14,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:39:14,003 INFO L82 PathProgramCache]: Analyzing trace with hash -408643559, now seen corresponding path program 1 times [2018-10-02 11:39:14,003 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:39:14,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:39:14,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:14,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:39:14,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:14,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:39:14,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:39:14,146 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:39:14,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:39:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:14,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:39:14,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:39:14,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:39:14,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-02 11:39:14,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-02 11:39:14,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-02 11:39:14,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-10-02 11:39:14,231 INFO L87 Difference]: Start difference. First operand 2248 states and 5091 transitions. Second operand 11 states. [2018-10-02 11:39:21,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:39:21,097 INFO L93 Difference]: Finished difference Result 3089 states and 6919 transitions. [2018-10-02 11:39:21,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-02 11:39:21,098 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-02 11:39:21,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:39:21,102 INFO L225 Difference]: With dead ends: 3089 [2018-10-02 11:39:21,102 INFO L226 Difference]: Without dead ends: 3081 [2018-10-02 11:39:21,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2018-10-02 11:39:21,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2018-10-02 11:39:24,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 2246. [2018-10-02 11:39:24,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2018-10-02 11:39:24,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 5087 transitions. [2018-10-02 11:39:24,154 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 5087 transitions. Word has length 20 [2018-10-02 11:39:24,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:39:24,154 INFO L480 AbstractCegarLoop]: Abstraction has 2246 states and 5087 transitions. [2018-10-02 11:39:24,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-02 11:39:24,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 5087 transitions. [2018-10-02 11:39:24,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-02 11:39:24,156 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:39:24,156 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:39:24,156 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:39:24,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:39:24,157 INFO L82 PathProgramCache]: Analyzing trace with hash 718873437, now seen corresponding path program 1 times [2018-10-02 11:39:24,157 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:39:24,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:39:24,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:24,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:39:24,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:24,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:39:24,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:39:24,257 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:39:24,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:39:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:24,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:39:24,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:39:24,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:39:24,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-02 11:39:24,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-02 11:39:24,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-02 11:39:24,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-10-02 11:39:24,317 INFO L87 Difference]: Start difference. First operand 2246 states and 5087 transitions. Second operand 11 states. Received shutdown request... [2018-10-02 11:39:25,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-02 11:39:25,328 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-02 11:39:25,334 WARN L205 ceAbstractionStarter]: Timeout [2018-10-02 11:39:25,334 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:39:25 BoogieIcfgContainer [2018-10-02 11:39:25,334 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 11:39:25,335 INFO L168 Benchmark]: Toolchain (without parser) took 257181.64 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 685.8 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -49.9 MB). Peak memory consumption was 635.8 MB. Max. memory is 7.1 GB. [2018-10-02 11:39:25,336 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:39:25,336 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.95 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:39:25,337 INFO L168 Benchmark]: Boogie Preprocessor took 62.93 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:39:25,337 INFO L168 Benchmark]: RCFGBuilder took 897.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-02 11:39:25,338 INFO L168 Benchmark]: TraceAbstraction took 256166.04 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 685.8 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -81.6 MB). Peak memory consumption was 604.1 MB. Max. memory is 7.1 GB. [2018-10-02 11:39:25,340 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.25 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 48.95 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 62.93 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 897.32 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 256166.04 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 685.8 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -81.6 MB). Peak memory consumption was 604.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 364]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 364). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 9 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (147 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 277]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 277). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 9 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (147 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 229]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 229). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 9 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (147 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 250]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 250). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 9 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (147 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 294]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 294). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 9 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (147 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 54). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 9 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (147 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 240]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 240). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 9 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (147 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 222]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 222). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 9 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (147 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 284]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 284). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 9 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (147 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 205]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 205). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 9 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (147 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 264]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 264). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 9 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (147 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 332]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 332). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 9 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (147 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 247]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 247). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 9 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (147 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 154). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 9 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (147 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 256.0s OverallTime, 52 OverallIterations, 2 TraceHistogramMax, 203.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13452 SDtfs, 45246 SDslu, 46487 SDs, 0 SdLazy, 95043 SolverSat, 9904 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 92.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1832 GetRequests, 327 SyntacticMatches, 4 SemanticMatches, 1501 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25543 ImplicationChecksByTransitivity, 29.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2248occurred in iteration=50, 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: 41.7s AutomataMinimizationTime, 51 MinimizatonAttempts, 27176 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 984 NumberOfCodeBlocks, 984 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 917 ConstructedInterpolants, 0 QuantifiedInterpolants, 47980 SizeOfPredicates, 77 NumberOfNonLiveVariables, 645 ConjunctsInSsa, 146 ConjunctsInUnsatCore, 67 InterpolantComputations, 37 PerfectInterpolantSequences, 43/111 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.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_11-39-25-351.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out_Reals.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_11-39-25-351.csv Completed graceful shutdown