java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:14:36,626 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:14:36,628 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:14:36,646 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:14:36,646 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:14:36,647 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:14:36,650 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:14:36,652 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:14:36,655 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:14:36,656 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:14:36,657 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:14:36,659 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:14:36,660 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:14:36,663 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:14:36,668 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:14:36,669 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:14:36,670 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:14:36,676 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:14:36,681 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:14:36,683 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:14:36,685 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:14:36,688 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:14:36,693 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:14:36,693 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:14:36,693 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:14:36,694 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:14:36,695 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:14:36,696 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:14:36,696 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:14:36,699 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:14:36,699 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:14:36,700 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:14:36,700 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:14:36,700 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:14:36,701 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:14:36,704 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:14:36,704 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-09-30 10:14:36,729 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:14:36,730 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:14:36,731 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:14:36,731 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:14:36,732 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:14:36,732 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:14:36,732 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:14:36,733 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:14:36,733 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:14:36,733 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:14:36,733 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:14:36,733 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:14:36,734 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:14:36,734 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:14:36,734 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:14:36,734 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:14:36,735 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:14:36,736 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:14:36,736 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:14:36,736 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:14:36,736 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:14:36,736 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:14:36,737 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:14:36,737 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:14:36,737 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:14:36,737 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:14:36,738 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:14:36,738 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:14:36,738 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:14:36,738 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:14:36,798 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:14:36,814 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:14:36,818 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:14:36,820 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:14:36,821 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:14:36,821 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl [2018-09-30 10:14:36,822 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl' [2018-09-30 10:14:36,913 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:14:36,917 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:14:36,918 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:14:36,918 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:14:36,918 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:14:36,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:36" (1/1) ... [2018-09-30 10:14:36,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:36" (1/1) ... [2018-09-30 10:14:36,973 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 10:14:36,973 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 10:14:36,974 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 10:14:36,976 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:14:36,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:14:36,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:14:36,977 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:14:36,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:36" (1/1) ... [2018-09-30 10:14:36,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:36" (1/1) ... [2018-09-30 10:14:36,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:36" (1/1) ... [2018-09-30 10:14:36,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:36" (1/1) ... [2018-09-30 10:14:37,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:36" (1/1) ... [2018-09-30 10:14:37,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:36" (1/1) ... [2018-09-30 10:14:37,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:36" (1/1) ... [2018-09-30 10:14:37,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:14:37,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:14:37,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:14:37,038 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:14:37,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:14:37,123 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-30 10:14:37,123 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-30 10:14:37,123 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-30 10:14:37,875 INFO L345 CfgBuilder]: Using library mode [2018-09-30 10:14:37,875 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:14:37 BoogieIcfgContainer [2018-09-30 10:14:37,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:14:37,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:14:37,877 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:14:37,880 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:14:37,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:36" (1/2) ... [2018-09-30 10:14:37,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e97fcf2 and model type threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:14:37, skipping insertion in model container [2018-09-30 10:14:37,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:14:37" (2/2) ... [2018-09-30 10:14:37,883 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out.bpl [2018-09-30 10:14:37,893 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:14:37,902 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-09-30 10:14:37,953 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:14:37,954 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:14:37,954 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:14:37,954 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:14:37,955 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:14:37,955 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:14:37,955 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:14:37,955 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:14:37,955 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:14:37,979 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-09-30 10:14:37,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 10:14:37,989 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:37,990 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:37,992 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:38,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:38,006 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-09-30 10:14:38,008 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:38,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:38,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:38,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:38,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:38,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:38,308 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:38,308 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:14:38,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 10:14:38,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 10:14:38,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-30 10:14:38,334 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-09-30 10:14:40,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:40,220 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-09-30 10:14:40,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 10:14:40,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-30 10:14:40,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:40,242 INFO L225 Difference]: With dead ends: 163 [2018-09-30 10:14:40,242 INFO L226 Difference]: Without dead ends: 158 [2018-09-30 10:14:40,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:14:40,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-30 10:14:40,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-09-30 10:14:40,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-30 10:14:40,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-09-30 10:14:40,311 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-09-30 10:14:40,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:40,311 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-09-30 10:14:40,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 10:14:40,312 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-09-30 10:14:40,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 10:14:40,313 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:40,313 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:40,314 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:40,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:40,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-09-30 10:14:40,315 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:40,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:40,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:40,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:40,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:40,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:40,434 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:40,434 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:14:40,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 10:14:40,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 10:14:40,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-30 10:14:40,436 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-09-30 10:14:41,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:41,303 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-09-30 10:14:41,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 10:14:41,304 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-30 10:14:41,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:41,309 INFO L225 Difference]: With dead ends: 188 [2018-09-30 10:14:41,309 INFO L226 Difference]: Without dead ends: 183 [2018-09-30 10:14:41,310 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-09-30 10:14:41,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-30 10:14:41,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-09-30 10:14:41,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-30 10:14:41,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-09-30 10:14:41,335 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-09-30 10:14:41,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:41,336 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-09-30 10:14:41,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 10:14:41,336 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-09-30 10:14:41,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 10:14:41,337 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:41,337 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:41,338 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:41,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:41,339 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-09-30 10:14:41,339 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:41,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:41,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:41,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:41,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:41,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:41,443 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:41,444 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:14:41,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:14:41,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:14:41,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:14:41,445 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-09-30 10:14:43,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:43,226 INFO L93 Difference]: Finished difference Result 361 states and 808 transitions. [2018-09-30 10:14:43,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:14:43,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-30 10:14:43,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:43,232 INFO L225 Difference]: With dead ends: 361 [2018-09-30 10:14:43,232 INFO L226 Difference]: Without dead ends: 349 [2018-09-30 10:14:43,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-09-30 10:14:43,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-09-30 10:14:43,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 174. [2018-09-30 10:14:43,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-09-30 10:14:43,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 387 transitions. [2018-09-30 10:14:43,273 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 387 transitions. Word has length 9 [2018-09-30 10:14:43,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:43,274 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 387 transitions. [2018-09-30 10:14:43,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:14:43,274 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 387 transitions. [2018-09-30 10:14:43,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 10:14:43,275 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:43,276 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:43,276 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:43,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:43,277 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-09-30 10:14:43,277 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:43,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:43,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:43,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:43,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:43,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:43,382 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:43,383 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:14:43,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:14:43,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:14:43,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:14:43,384 INFO L87 Difference]: Start difference. First operand 174 states and 387 transitions. Second operand 7 states. [2018-09-30 10:14:44,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:44,599 INFO L93 Difference]: Finished difference Result 307 states and 694 transitions. [2018-09-30 10:14:44,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 10:14:44,603 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-30 10:14:44,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:44,606 INFO L225 Difference]: With dead ends: 307 [2018-09-30 10:14:44,606 INFO L226 Difference]: Without dead ends: 302 [2018-09-30 10:14:44,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-09-30 10:14:44,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-09-30 10:14:44,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 203. [2018-09-30 10:14:44,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-30 10:14:44,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-09-30 10:14:44,649 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-09-30 10:14:44,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:44,649 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-09-30 10:14:44,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:14:44,650 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-09-30 10:14:44,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:14:44,652 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:44,652 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:44,653 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:44,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:44,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-09-30 10:14:44,654 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:44,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:44,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:44,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:44,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:44,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:44,977 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:44,977 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:14:44,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:14:44,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:14:44,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:14:44,978 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 8 states. [2018-09-30 10:14:50,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:50,045 INFO L93 Difference]: Finished difference Result 741 states and 1656 transitions. [2018-09-30 10:14:50,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 10:14:50,045 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:14:50,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:50,052 INFO L225 Difference]: With dead ends: 741 [2018-09-30 10:14:50,052 INFO L226 Difference]: Without dead ends: 733 [2018-09-30 10:14:50,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2018-09-30 10:14:50,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-09-30 10:14:50,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 315. [2018-09-30 10:14:50,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-09-30 10:14:50,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 743 transitions. [2018-09-30 10:14:50,110 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 743 transitions. Word has length 12 [2018-09-30 10:14:50,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:50,111 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 743 transitions. [2018-09-30 10:14:50,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:14:50,111 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 743 transitions. [2018-09-30 10:14:50,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:14:50,113 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:50,113 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:50,114 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:50,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:50,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-09-30 10:14:50,114 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:50,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:50,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:50,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:50,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:50,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:50,298 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:50,298 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:14:50,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:14:50,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:14:50,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:14:50,299 INFO L87 Difference]: Start difference. First operand 315 states and 743 transitions. Second operand 8 states. [2018-09-30 10:14:55,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:55,033 INFO L93 Difference]: Finished difference Result 797 states and 1784 transitions. [2018-09-30 10:14:55,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 10:14:55,033 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:14:55,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:55,040 INFO L225 Difference]: With dead ends: 797 [2018-09-30 10:14:55,040 INFO L226 Difference]: Without dead ends: 789 [2018-09-30 10:14:55,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-09-30 10:14:55,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-09-30 10:14:55,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 319. [2018-09-30 10:14:55,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-09-30 10:14:55,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 751 transitions. [2018-09-30 10:14:55,120 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 751 transitions. Word has length 12 [2018-09-30 10:14:55,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:55,120 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 751 transitions. [2018-09-30 10:14:55,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:14:55,121 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 751 transitions. [2018-09-30 10:14:55,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:14:55,122 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:55,122 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:55,123 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:55,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:55,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-09-30 10:14:55,123 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:55,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:55,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:55,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:55,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:55,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:55,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:55,285 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:55,285 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:14:55,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:14:55,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:14:55,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:14:55,286 INFO L87 Difference]: Start difference. First operand 319 states and 751 transitions. Second operand 8 states. [2018-09-30 10:14:57,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:57,129 INFO L93 Difference]: Finished difference Result 684 states and 1538 transitions. [2018-09-30 10:14:57,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 10:14:57,129 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:14:57,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:57,135 INFO L225 Difference]: With dead ends: 684 [2018-09-30 10:14:57,135 INFO L226 Difference]: Without dead ends: 676 [2018-09-30 10:14:57,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-09-30 10:14:57,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-09-30 10:14:57,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 330. [2018-09-30 10:14:57,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-09-30 10:14:57,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 778 transitions. [2018-09-30 10:14:57,200 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 778 transitions. Word has length 12 [2018-09-30 10:14:57,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:57,201 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 778 transitions. [2018-09-30 10:14:57,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:14:57,201 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 778 transitions. [2018-09-30 10:14:57,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:14:57,202 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:57,202 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:57,203 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:57,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:57,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-09-30 10:14:57,204 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:57,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:57,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:57,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:57,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:57,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:57,409 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:57,410 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:14:57,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:14:57,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:14:57,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:14:57,411 INFO L87 Difference]: Start difference. First operand 330 states and 778 transitions. Second operand 8 states. [2018-09-30 10:14:58,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:58,894 INFO L93 Difference]: Finished difference Result 605 states and 1360 transitions. [2018-09-30 10:14:58,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:14:58,895 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:14:58,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:58,899 INFO L225 Difference]: With dead ends: 605 [2018-09-30 10:14:58,899 INFO L226 Difference]: Without dead ends: 597 [2018-09-30 10:14:58,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-09-30 10:14:58,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-09-30 10:14:58,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 337. [2018-09-30 10:14:58,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-09-30 10:14:58,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 794 transitions. [2018-09-30 10:14:58,967 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 794 transitions. Word has length 12 [2018-09-30 10:14:58,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:58,967 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 794 transitions. [2018-09-30 10:14:58,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:14:58,968 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 794 transitions. [2018-09-30 10:14:58,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:14:58,969 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:58,969 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:58,969 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:58,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:58,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1088621469, now seen corresponding path program 1 times [2018-09-30 10:14:58,970 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:58,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:58,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:58,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:58,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:59,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:59,062 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:59,062 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:14:59,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:14:59,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:14:59,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:14:59,063 INFO L87 Difference]: Start difference. First operand 337 states and 794 transitions. Second operand 8 states. [2018-09-30 10:15:01,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:01,226 INFO L93 Difference]: Finished difference Result 935 states and 2104 transitions. [2018-09-30 10:15:01,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:15:01,227 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:15:01,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:01,233 INFO L225 Difference]: With dead ends: 935 [2018-09-30 10:15:01,233 INFO L226 Difference]: Without dead ends: 927 [2018-09-30 10:15:01,234 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2018-09-30 10:15:01,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-09-30 10:15:01,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 343. [2018-09-30 10:15:01,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-09-30 10:15:01,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 808 transitions. [2018-09-30 10:15:01,324 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 808 transitions. Word has length 12 [2018-09-30 10:15:01,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:01,324 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 808 transitions. [2018-09-30 10:15:01,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:15:01,325 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 808 transitions. [2018-09-30 10:15:01,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:01,325 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:01,326 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:01,326 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:01,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:01,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1085821115, now seen corresponding path program 1 times [2018-09-30 10:15:01,327 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:01,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:01,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:01,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:01,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:01,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:01,409 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:01,409 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:01,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:15:01,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:15:01,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:15:01,411 INFO L87 Difference]: Start difference. First operand 343 states and 808 transitions. Second operand 8 states. [2018-09-30 10:15:03,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:03,624 INFO L93 Difference]: Finished difference Result 923 states and 2061 transitions. [2018-09-30 10:15:03,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 10:15:03,625 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:15:03,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:03,630 INFO L225 Difference]: With dead ends: 923 [2018-09-30 10:15:03,631 INFO L226 Difference]: Without dead ends: 915 [2018-09-30 10:15:03,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-09-30 10:15:03,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-09-30 10:15:03,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 354. [2018-09-30 10:15:03,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-09-30 10:15:03,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 835 transitions. [2018-09-30 10:15:03,740 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 835 transitions. Word has length 12 [2018-09-30 10:15:03,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:03,740 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 835 transitions. [2018-09-30 10:15:03,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:15:03,740 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 835 transitions. [2018-09-30 10:15:03,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:03,741 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:03,741 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:03,742 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:03,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:03,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1085923260, now seen corresponding path program 1 times [2018-09-30 10:15:03,743 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:03,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:03,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:03,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:03,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:04,050 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:04,051 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:04,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:15:04,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:15:04,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:15:04,052 INFO L87 Difference]: Start difference. First operand 354 states and 835 transitions. Second operand 8 states. [2018-09-30 10:15:05,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:05,697 INFO L93 Difference]: Finished difference Result 837 states and 1868 transitions. [2018-09-30 10:15:05,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:15:05,698 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:15:05,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:05,704 INFO L225 Difference]: With dead ends: 837 [2018-09-30 10:15:05,704 INFO L226 Difference]: Without dead ends: 829 [2018-09-30 10:15:05,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-09-30 10:15:05,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-09-30 10:15:05,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 339. [2018-09-30 10:15:05,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-09-30 10:15:05,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 800 transitions. [2018-09-30 10:15:05,808 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 800 transitions. Word has length 12 [2018-09-30 10:15:05,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:05,809 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 800 transitions. [2018-09-30 10:15:05,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:15:05,809 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 800 transitions. [2018-09-30 10:15:05,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:05,810 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:05,810 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:05,810 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:05,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:05,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1383194877, now seen corresponding path program 1 times [2018-09-30 10:15:05,811 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:05,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:05,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:05,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:05,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:05,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:05,906 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:05,906 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:05,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:15:05,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:15:05,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:15:05,907 INFO L87 Difference]: Start difference. First operand 339 states and 800 transitions. Second operand 8 states. [2018-09-30 10:15:08,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:08,165 INFO L93 Difference]: Finished difference Result 996 states and 2227 transitions. [2018-09-30 10:15:08,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-30 10:15:08,166 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:15:08,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:08,172 INFO L225 Difference]: With dead ends: 996 [2018-09-30 10:15:08,172 INFO L226 Difference]: Without dead ends: 988 [2018-09-30 10:15:08,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-09-30 10:15:08,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-09-30 10:15:08,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 381. [2018-09-30 10:15:08,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-30 10:15:08,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-09-30 10:15:08,295 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-09-30 10:15:08,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:08,297 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-09-30 10:15:08,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:15:08,297 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-09-30 10:15:08,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:08,298 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:08,298 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:08,299 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:08,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:08,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1383297022, now seen corresponding path program 1 times [2018-09-30 10:15:08,299 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:08,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:08,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:08,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:08,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:08,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:08,425 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:08,426 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:08,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:15:08,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:15:08,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:15:08,427 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-09-30 10:15:10,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:10,440 INFO L93 Difference]: Finished difference Result 913 states and 2034 transitions. [2018-09-30 10:15:10,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 10:15:10,441 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:15:10,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:10,446 INFO L225 Difference]: With dead ends: 913 [2018-09-30 10:15:10,446 INFO L226 Difference]: Without dead ends: 905 [2018-09-30 10:15:10,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2018-09-30 10:15:10,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-09-30 10:15:10,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 371. [2018-09-30 10:15:10,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-09-30 10:15:10,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 890 transitions. [2018-09-30 10:15:10,573 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 890 transitions. Word has length 12 [2018-09-30 10:15:10,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:10,573 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 890 transitions. [2018-09-30 10:15:10,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:15:10,573 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 890 transitions. [2018-09-30 10:15:10,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:10,574 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:10,574 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:10,575 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:10,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:10,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1392211258, now seen corresponding path program 1 times [2018-09-30 10:15:10,575 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:10,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:10,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:10,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:10,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:10,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:10,678 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:10,678 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:10,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:15:10,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:15:10,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:15:10,679 INFO L87 Difference]: Start difference. First operand 371 states and 890 transitions. Second operand 8 states. [2018-09-30 10:15:12,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:12,319 INFO L93 Difference]: Finished difference Result 886 states and 2009 transitions. [2018-09-30 10:15:12,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 10:15:12,320 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:15:12,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:12,324 INFO L225 Difference]: With dead ends: 886 [2018-09-30 10:15:12,324 INFO L226 Difference]: Without dead ends: 878 [2018-09-30 10:15:12,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-09-30 10:15:12,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2018-09-30 10:15:12,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 372. [2018-09-30 10:15:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-09-30 10:15:12,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 891 transitions. [2018-09-30 10:15:12,440 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 891 transitions. Word has length 12 [2018-09-30 10:15:12,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:12,440 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 891 transitions. [2018-09-30 10:15:12,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:15:12,440 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 891 transitions. [2018-09-30 10:15:12,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:12,441 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:12,441 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:12,441 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:12,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:12,442 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-09-30 10:15:12,442 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:12,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:12,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:12,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:12,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:12,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:12,526 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:12,527 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:12,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:15:12,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:15:12,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:15:12,528 INFO L87 Difference]: Start difference. First operand 372 states and 891 transitions. Second operand 9 states. [2018-09-30 10:15:14,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:14,638 INFO L93 Difference]: Finished difference Result 801 states and 1838 transitions. [2018-09-30 10:15:14,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 10:15:14,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:15:14,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:14,643 INFO L225 Difference]: With dead ends: 801 [2018-09-30 10:15:14,644 INFO L226 Difference]: Without dead ends: 793 [2018-09-30 10:15:14,644 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-09-30 10:15:14,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-09-30 10:15:14,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 393. [2018-09-30 10:15:14,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-09-30 10:15:14,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 949 transitions. [2018-09-30 10:15:14,796 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 949 transitions. Word has length 12 [2018-09-30 10:15:14,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:14,796 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 949 transitions. [2018-09-30 10:15:14,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:15:14,797 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 949 transitions. [2018-09-30 10:15:14,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:14,797 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:14,797 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:14,798 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:14,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:14,798 INFO L82 PathProgramCache]: Analyzing trace with hash 192619318, now seen corresponding path program 1 times [2018-09-30 10:15:14,798 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:14,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:14,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:14,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:14,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:14,892 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:14,892 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:14,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:15:14,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:15:14,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:15:14,893 INFO L87 Difference]: Start difference. First operand 393 states and 949 transitions. Second operand 9 states. [2018-09-30 10:15:17,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:17,398 INFO L93 Difference]: Finished difference Result 962 states and 2211 transitions. [2018-09-30 10:15:17,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 10:15:17,399 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:15:17,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:17,404 INFO L225 Difference]: With dead ends: 962 [2018-09-30 10:15:17,405 INFO L226 Difference]: Without dead ends: 954 [2018-09-30 10:15:17,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-09-30 10:15:17,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-09-30 10:15:17,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 409. [2018-09-30 10:15:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-09-30 10:15:17,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 997 transitions. [2018-09-30 10:15:17,640 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 997 transitions. Word has length 12 [2018-09-30 10:15:17,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:17,640 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 997 transitions. [2018-09-30 10:15:17,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:15:17,640 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 997 transitions. [2018-09-30 10:15:17,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:17,641 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:17,641 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:17,642 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:17,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:17,642 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-09-30 10:15:17,642 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:17,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:17,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:17,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:17,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:18,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:18,232 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:18,233 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:18,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:15:18,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:15:18,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:15:18,234 INFO L87 Difference]: Start difference. First operand 409 states and 997 transitions. Second operand 9 states. [2018-09-30 10:15:20,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:20,742 INFO L93 Difference]: Finished difference Result 1000 states and 2329 transitions. [2018-09-30 10:15:20,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 10:15:20,742 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:15:20,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:20,748 INFO L225 Difference]: With dead ends: 1000 [2018-09-30 10:15:20,748 INFO L226 Difference]: Without dead ends: 992 [2018-09-30 10:15:20,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-09-30 10:15:20,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-09-30 10:15:20,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 430. [2018-09-30 10:15:20,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-09-30 10:15:20,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1052 transitions. [2018-09-30 10:15:20,930 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1052 transitions. Word has length 12 [2018-09-30 10:15:20,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:20,930 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 1052 transitions. [2018-09-30 10:15:20,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:15:20,931 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1052 transitions. [2018-09-30 10:15:20,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:20,931 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:20,931 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:20,932 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:20,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:20,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1320238459, now seen corresponding path program 1 times [2018-09-30 10:15:20,932 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:20,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:20,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:20,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:20,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:21,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-09-30 10:15:21,021 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:21,022 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:21,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:15:21,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:15:21,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:15:21,023 INFO L87 Difference]: Start difference. First operand 430 states and 1052 transitions. Second operand 9 states. [2018-09-30 10:15:23,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:23,825 INFO L93 Difference]: Finished difference Result 1065 states and 2466 transitions. [2018-09-30 10:15:23,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 10:15:23,826 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:15:23,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:23,832 INFO L225 Difference]: With dead ends: 1065 [2018-09-30 10:15:23,832 INFO L226 Difference]: Without dead ends: 1057 [2018-09-30 10:15:23,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 10:15:23,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2018-09-30 10:15:24,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 471. [2018-09-30 10:15:24,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-09-30 10:15:24,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1168 transitions. [2018-09-30 10:15:24,074 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1168 transitions. Word has length 12 [2018-09-30 10:15:24,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:24,075 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 1168 transitions. [2018-09-30 10:15:24,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:15:24,075 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1168 transitions. [2018-09-30 10:15:24,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:24,076 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:24,076 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:24,076 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:24,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:24,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1320340604, now seen corresponding path program 1 times [2018-09-30 10:15:24,077 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:24,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:24,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:24,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:24,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:24,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:24,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:24,162 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:24,162 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:24,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:15:24,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:15:24,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:15:24,163 INFO L87 Difference]: Start difference. First operand 471 states and 1168 transitions. Second operand 9 states. [2018-09-30 10:15:27,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:27,349 INFO L93 Difference]: Finished difference Result 1227 states and 2851 transitions. [2018-09-30 10:15:27,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-30 10:15:27,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:15:27,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:27,355 INFO L225 Difference]: With dead ends: 1227 [2018-09-30 10:15:27,355 INFO L226 Difference]: Without dead ends: 1219 [2018-09-30 10:15:27,356 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-09-30 10:15:27,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-09-30 10:15:27,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 438. [2018-09-30 10:15:27,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-09-30 10:15:27,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1072 transitions. [2018-09-30 10:15:27,580 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1072 transitions. Word has length 12 [2018-09-30 10:15:27,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:27,580 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 1072 transitions. [2018-09-30 10:15:27,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:15:27,580 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1072 transitions. [2018-09-30 10:15:27,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:27,581 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:27,581 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:27,581 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:27,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:27,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-09-30 10:15:27,582 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:27,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:27,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:27,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:27,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:27,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:27,678 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:27,678 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:27,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:15:27,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:15:27,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:15:27,678 INFO L87 Difference]: Start difference. First operand 438 states and 1072 transitions. Second operand 9 states. [2018-09-30 10:15:30,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:30,632 INFO L93 Difference]: Finished difference Result 1076 states and 2511 transitions. [2018-09-30 10:15:30,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 10:15:30,633 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:15:30,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:30,639 INFO L225 Difference]: With dead ends: 1076 [2018-09-30 10:15:30,639 INFO L226 Difference]: Without dead ends: 1068 [2018-09-30 10:15:30,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 10:15:30,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2018-09-30 10:15:30,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 445. [2018-09-30 10:15:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-09-30 10:15:30,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1088 transitions. [2018-09-30 10:15:30,869 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1088 transitions. Word has length 12 [2018-09-30 10:15:30,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:30,870 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 1088 transitions. [2018-09-30 10:15:30,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:15:30,870 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1088 transitions. [2018-09-30 10:15:30,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:30,870 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:30,870 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:30,871 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:30,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:30,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1838990990, now seen corresponding path program 1 times [2018-09-30 10:15:30,871 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:30,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:30,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:30,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:30,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:30,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:30,968 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:30,969 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:30,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:15:30,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:15:30,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:15:30,970 INFO L87 Difference]: Start difference. First operand 445 states and 1088 transitions. Second operand 9 states. [2018-09-30 10:15:33,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:33,526 INFO L93 Difference]: Finished difference Result 1111 states and 2606 transitions. [2018-09-30 10:15:33,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:15:33,527 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:15:33,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:33,532 INFO L225 Difference]: With dead ends: 1111 [2018-09-30 10:15:33,532 INFO L226 Difference]: Without dead ends: 1103 [2018-09-30 10:15:33,533 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-09-30 10:15:33,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2018-09-30 10:15:33,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 520. [2018-09-30 10:15:33,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-09-30 10:15:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1295 transitions. [2018-09-30 10:15:33,859 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1295 transitions. Word has length 12 [2018-09-30 10:15:33,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:33,860 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 1295 transitions. [2018-09-30 10:15:33,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:15:33,860 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1295 transitions. [2018-09-30 10:15:33,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:33,860 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:33,861 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:33,861 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:33,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:33,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1838888845, now seen corresponding path program 1 times [2018-09-30 10:15:33,862 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:33,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:33,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:33,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:33,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:34,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:34,033 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:34,033 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:34,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:15:34,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:15:34,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:15:34,034 INFO L87 Difference]: Start difference. First operand 520 states and 1295 transitions. Second operand 9 states. [2018-09-30 10:15:37,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:37,545 INFO L93 Difference]: Finished difference Result 1304 states and 3059 transitions. [2018-09-30 10:15:37,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 10:15:37,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:15:37,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:37,553 INFO L225 Difference]: With dead ends: 1304 [2018-09-30 10:15:37,553 INFO L226 Difference]: Without dead ends: 1296 [2018-09-30 10:15:37,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2018-09-30 10:15:37,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-09-30 10:15:37,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 487. [2018-09-30 10:15:37,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-09-30 10:15:37,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1199 transitions. [2018-09-30 10:15:37,849 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1199 transitions. Word has length 12 [2018-09-30 10:15:37,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:37,849 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 1199 transitions. [2018-09-30 10:15:37,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:15:37,849 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1199 transitions. [2018-09-30 10:15:37,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:37,850 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:37,850 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:37,851 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:37,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:37,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1731038698, now seen corresponding path program 1 times [2018-09-30 10:15:37,851 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:37,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:37,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:37,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:37,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:37,932 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:37,932 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:37,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:15:37,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:15:37,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:15:37,933 INFO L87 Difference]: Start difference. First operand 487 states and 1199 transitions. Second operand 9 states. [2018-09-30 10:15:41,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:41,763 INFO L93 Difference]: Finished difference Result 1370 states and 3217 transitions. [2018-09-30 10:15:41,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:15:41,763 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:15:41,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:41,771 INFO L225 Difference]: With dead ends: 1370 [2018-09-30 10:15:41,771 INFO L226 Difference]: Without dead ends: 1362 [2018-09-30 10:15:41,772 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2018-09-30 10:15:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2018-09-30 10:15:42,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 479. [2018-09-30 10:15:42,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-09-30 10:15:42,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1179 transitions. [2018-09-30 10:15:42,159 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1179 transitions. Word has length 12 [2018-09-30 10:15:42,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:42,159 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 1179 transitions. [2018-09-30 10:15:42,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:15:42,159 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1179 transitions. [2018-09-30 10:15:42,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:42,160 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:42,160 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:42,161 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:42,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:42,161 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-09-30 10:15:42,161 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:42,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:42,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:42,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:42,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:42,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:42,243 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:42,243 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:42,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:15:42,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:15:42,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:15:42,244 INFO L87 Difference]: Start difference. First operand 479 states and 1179 transitions. Second operand 9 states. [2018-09-30 10:15:45,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:45,150 INFO L93 Difference]: Finished difference Result 1298 states and 3068 transitions. [2018-09-30 10:15:45,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 10:15:45,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:15:45,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:45,156 INFO L225 Difference]: With dead ends: 1298 [2018-09-30 10:15:45,156 INFO L226 Difference]: Without dead ends: 1290 [2018-09-30 10:15:45,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-09-30 10:15:45,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-09-30 10:15:45,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 602. [2018-09-30 10:15:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-09-30 10:15:45,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-09-30 10:15:45,588 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-09-30 10:15:45,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:45,589 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-09-30 10:15:45,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:15:45,589 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-09-30 10:15:45,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:15:45,589 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:45,589 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:45,590 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:45,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:45,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1080362888, now seen corresponding path program 1 times [2018-09-30 10:15:45,590 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:45,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:45,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:45,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:45,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:45,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:45,650 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:45,650 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:15:45,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:15:45,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:15:45,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:15:45,651 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-09-30 10:15:46,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:46,550 INFO L93 Difference]: Finished difference Result 1242 states and 3091 transitions. [2018-09-30 10:15:46,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:15:46,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-30 10:15:46,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:46,553 INFO L225 Difference]: With dead ends: 1242 [2018-09-30 10:15:46,553 INFO L226 Difference]: Without dead ends: 673 [2018-09-30 10:15:46,556 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-09-30 10:15:46,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-09-30 10:15:47,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 612. [2018-09-30 10:15:47,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-09-30 10:15:47,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1463 transitions. [2018-09-30 10:15:47,078 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1463 transitions. Word has length 13 [2018-09-30 10:15:47,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:47,078 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 1463 transitions. [2018-09-30 10:15:47,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:15:47,078 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1463 transitions. [2018-09-30 10:15:47,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:15:47,079 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:47,079 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:47,080 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:47,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:47,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1652407871, now seen corresponding path program 1 times [2018-09-30 10:15:47,080 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:47,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:47,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:47,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:47,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15: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-09-30 10:15:47,182 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:47,182 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:47,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:47,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:47,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:47,941 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:47,941 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-30 10:15:47,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 10:15:47,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 10:15:47,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-09-30 10:15:47,942 INFO L87 Difference]: Start difference. First operand 612 states and 1463 transitions. Second operand 16 states. [2018-09-30 10:15:52,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:52,275 INFO L93 Difference]: Finished difference Result 854 states and 1987 transitions. [2018-09-30 10:15:52,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 10:15:52,276 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-09-30 10:15:52,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:52,279 INFO L225 Difference]: With dead ends: 854 [2018-09-30 10:15:52,279 INFO L226 Difference]: Without dead ends: 849 [2018-09-30 10:15:52,280 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-09-30 10:15:52,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-09-30 10:15:53,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 690. [2018-09-30 10:15:53,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-30 10:15:53,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1639 transitions. [2018-09-30 10:15:53,292 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1639 transitions. Word has length 13 [2018-09-30 10:15:53,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:53,293 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1639 transitions. [2018-09-30 10:15:53,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 10:15:53,293 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1639 transitions. [2018-09-30 10:15:53,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:15:53,294 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:53,294 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:53,294 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:53,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:53,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1456173380, now seen corresponding path program 1 times [2018-09-30 10:15:53,295 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:53,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:53,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:53,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:53,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:53,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:53,403 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:53,403 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:15:53,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:15:53,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:15:53,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:15:53,404 INFO L87 Difference]: Start difference. First operand 690 states and 1639 transitions. Second operand 5 states. [2018-09-30 10:15:54,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:54,395 INFO L93 Difference]: Finished difference Result 1308 states and 3113 transitions. [2018-09-30 10:15:54,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:15:54,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-30 10:15:54,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:54,397 INFO L225 Difference]: With dead ends: 1308 [2018-09-30 10:15:54,397 INFO L226 Difference]: Without dead ends: 709 [2018-09-30 10:15:54,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:15:54,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-09-30 10:15:55,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 690. [2018-09-30 10:15:55,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-30 10:15:55,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-09-30 10:15:55,056 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-09-30 10:15:55,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:55,056 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-09-30 10:15:55,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:15:55,056 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-09-30 10:15:55,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:15:55,057 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:55,057 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:55,059 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:55,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:55,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1952744875, now seen corresponding path program 1 times [2018-09-30 10:15:55,059 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:55,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:55,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:55,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:55,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:55,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:55,782 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:55,783 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:55,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:55,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:56,014 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:56,014 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 10:15:56,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 10:15:56,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 10:15:56,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-30 10:15:56,015 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 17 states. [2018-09-30 10:16:03,616 WARN L178 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-30 10:16:08,968 WARN L178 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-30 10:16:12,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:12,481 INFO L93 Difference]: Finished difference Result 2011 states and 4412 transitions. [2018-09-30 10:16:12,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-30 10:16:12,482 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 10:16:12,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:12,485 INFO L225 Difference]: With dead ends: 2011 [2018-09-30 10:16:12,485 INFO L226 Difference]: Without dead ends: 2003 [2018-09-30 10:16:12,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9561 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=3074, Invalid=22366, Unknown=0, NotChecked=0, Total=25440 [2018-09-30 10:16:12,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2018-09-30 10:16:13,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1151. [2018-09-30 10:16:13,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-09-30 10:16:13,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 2622 transitions. [2018-09-30 10:16:13,703 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 2622 transitions. Word has length 16 [2018-09-30 10:16:13,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:13,704 INFO L480 AbstractCegarLoop]: Abstraction has 1151 states and 2622 transitions. [2018-09-30 10:16:13,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 10:16:13,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 2622 transitions. [2018-09-30 10:16:13,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:16:13,705 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:13,705 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:13,705 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:13,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:13,706 INFO L82 PathProgramCache]: Analyzing trace with hash -51223093, now seen corresponding path program 1 times [2018-09-30 10:16:13,706 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:13,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:13,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:13,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:13,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:13,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:13,812 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:16:13,812 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:16:13,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:13,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:16:13,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:13,987 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:16:13,987 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 10:16:13,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 10:16:13,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 10:16:13,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-30 10:16:13,988 INFO L87 Difference]: Start difference. First operand 1151 states and 2622 transitions. Second operand 17 states. [2018-09-30 10:16:27,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:27,110 INFO L93 Difference]: Finished difference Result 2797 states and 6168 transitions. [2018-09-30 10:16:27,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-09-30 10:16:27,111 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 10:16:27,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:27,118 INFO L225 Difference]: With dead ends: 2797 [2018-09-30 10:16:27,118 INFO L226 Difference]: Without dead ends: 2789 [2018-09-30 10:16:27,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6171 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2430, Invalid=14862, Unknown=0, NotChecked=0, Total=17292 [2018-09-30 10:16:27,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2789 states. [2018-09-30 10:16:28,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2789 to 1186. [2018-09-30 10:16:28,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2018-09-30 10:16:28,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 2705 transitions. [2018-09-30 10:16:28,834 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 2705 transitions. Word has length 16 [2018-09-30 10:16:28,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:28,835 INFO L480 AbstractCegarLoop]: Abstraction has 1186 states and 2705 transitions. [2018-09-30 10:16:28,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 10:16:28,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 2705 transitions. [2018-09-30 10:16:28,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:16:28,836 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:28,836 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:28,837 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:28,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:28,837 INFO L82 PathProgramCache]: Analyzing trace with hash -666637335, now seen corresponding path program 1 times [2018-09-30 10:16:28,837 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:28,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:28,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:28,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:28,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:29,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:29,073 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:16:29,073 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-09-30 10:16:29,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:29,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:16:29,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:29,344 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:16:29,345 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 10:16:29,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 10:16:29,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 10:16:29,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-30 10:16:29,346 INFO L87 Difference]: Start difference. First operand 1186 states and 2705 transitions. Second operand 17 states. [2018-09-30 10:16:41,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:41,261 INFO L93 Difference]: Finished difference Result 2492 states and 5544 transitions. [2018-09-30 10:16:41,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-09-30 10:16:41,262 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 10:16:41,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:41,269 INFO L225 Difference]: With dead ends: 2492 [2018-09-30 10:16:41,269 INFO L226 Difference]: Without dead ends: 2484 [2018-09-30 10:16:41,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4610 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1718, Invalid=11392, Unknown=0, NotChecked=0, Total=13110 [2018-09-30 10:16:41,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2018-09-30 10:16:42,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 1219. [2018-09-30 10:16:42,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1219 states. [2018-09-30 10:16:42,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 2792 transitions. [2018-09-30 10:16:42,767 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 2792 transitions. Word has length 16 [2018-09-30 10:16:42,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:42,767 INFO L480 AbstractCegarLoop]: Abstraction has 1219 states and 2792 transitions. [2018-09-30 10:16:42,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 10:16:42,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 2792 transitions. [2018-09-30 10:16:42,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:16:42,768 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:42,768 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:42,769 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:42,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:42,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1212722005, now seen corresponding path program 1 times [2018-09-30 10:16:42,769 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:42,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:42,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:42,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:42,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:42,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:42,851 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:16:42,851 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-09-30 10:16:42,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:42,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:16:43,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:43,092 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 10:16:43,092 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2018-09-30 10:16:43,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 10:16:43,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 10:16:43,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-09-30 10:16:43,093 INFO L87 Difference]: Start difference. First operand 1219 states and 2792 transitions. Second operand 17 states. [2018-09-30 10:16:59,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:59,850 INFO L93 Difference]: Finished difference Result 3178 states and 7226 transitions. [2018-09-30 10:16:59,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-09-30 10:16:59,851 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 10:16:59,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:59,858 INFO L225 Difference]: With dead ends: 3178 [2018-09-30 10:16:59,858 INFO L226 Difference]: Without dead ends: 3170 [2018-09-30 10:16:59,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9560 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2932, Invalid=21248, Unknown=0, NotChecked=0, Total=24180 [2018-09-30 10:16:59,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2018-09-30 10:17:01,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 1242. [2018-09-30 10:17:01,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1242 states. [2018-09-30 10:17:01,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 2857 transitions. [2018-09-30 10:17:01,354 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 2857 transitions. Word has length 16 [2018-09-30 10:17:01,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:01,354 INFO L480 AbstractCegarLoop]: Abstraction has 1242 states and 2857 transitions. [2018-09-30 10:17:01,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 10:17:01,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 2857 transitions. [2018-09-30 10:17:01,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:17:01,355 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:01,355 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:17:01,356 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:01,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:01,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1212619860, now seen corresponding path program 1 times [2018-09-30 10:17:01,356 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:01,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:01,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:01,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:01,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:01,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:01,447 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:17:01,447 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-09-30 10:17:01,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:01,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:17:01,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:01,671 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 10:17:01,672 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2018-09-30 10:17:01,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 10:17:01,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 10:17:01,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-09-30 10:17:01,673 INFO L87 Difference]: Start difference. First operand 1242 states and 2857 transitions. Second operand 17 states. [2018-09-30 10:17:15,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:17:15,026 INFO L93 Difference]: Finished difference Result 2638 states and 5927 transitions. [2018-09-30 10:17:15,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-30 10:17:15,026 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 10:17:15,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:17:15,032 INFO L225 Difference]: With dead ends: 2638 [2018-09-30 10:17:15,032 INFO L226 Difference]: Without dead ends: 2630 [2018-09-30 10:17:15,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5685 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1807, Invalid=13199, Unknown=0, NotChecked=0, Total=15006 [2018-09-30 10:17:15,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2018-09-30 10:17:16,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 1469. [2018-09-30 10:17:16,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2018-09-30 10:17:16,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 3433 transitions. [2018-09-30 10:17:16,785 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 3433 transitions. Word has length 16 [2018-09-30 10:17:16,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:16,785 INFO L480 AbstractCegarLoop]: Abstraction has 1469 states and 3433 transitions. [2018-09-30 10:17:16,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 10:17:16,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 3433 transitions. [2018-09-30 10:17:16,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:17:16,786 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:16,786 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:17:16,787 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:16,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:16,787 INFO L82 PathProgramCache]: Analyzing trace with hash 780585054, now seen corresponding path program 1 times [2018-09-30 10:17:16,787 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:16,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:16,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:16,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:16,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:17,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:17,041 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:17:17,042 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-09-30 10:17:17,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:17,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:17:17,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:17,203 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:17:17,203 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 10:17:17,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 10:17:17,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 10:17:17,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-30 10:17:17,204 INFO L87 Difference]: Start difference. First operand 1469 states and 3433 transitions. Second operand 17 states. [2018-09-30 10:17:30,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:17:30,754 INFO L93 Difference]: Finished difference Result 2854 states and 6510 transitions. [2018-09-30 10:17:30,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-30 10:17:30,754 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 10:17:30,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:17:30,758 INFO L225 Difference]: With dead ends: 2854 [2018-09-30 10:17:30,758 INFO L226 Difference]: Without dead ends: 2846 [2018-09-30 10:17:30,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1456, Invalid=7664, Unknown=0, NotChecked=0, Total=9120 [2018-09-30 10:17:30,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2846 states. [2018-09-30 10:17:32,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2846 to 1479. [2018-09-30 10:17:32,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1479 states. [2018-09-30 10:17:32,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 3457 transitions. [2018-09-30 10:17:32,502 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 3457 transitions. Word has length 16 [2018-09-30 10:17:32,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:32,502 INFO L480 AbstractCegarLoop]: Abstraction has 1479 states and 3457 transitions. [2018-09-30 10:17:32,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 10:17:32,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 3457 transitions. [2018-09-30 10:17:32,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:17:32,503 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:32,503 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:17:32,503 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:32,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:32,504 INFO L82 PathProgramCache]: Analyzing trace with hash 165170812, now seen corresponding path program 1 times [2018-09-30 10:17:32,504 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:32,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:32,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:32,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:32,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:32,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:32,617 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:17:32,617 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-09-30 10:17:32,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:32,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:17:32,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:32,831 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:17:32,831 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 10:17:32,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 10:17:32,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 10:17:32,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-30 10:17:32,832 INFO L87 Difference]: Start difference. First operand 1479 states and 3457 transitions. Second operand 17 states. [2018-09-30 10:17:48,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:17:48,287 INFO L93 Difference]: Finished difference Result 3363 states and 7697 transitions. [2018-09-30 10:17:48,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-30 10:17:48,287 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 10:17:48,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:17:48,291 INFO L225 Difference]: With dead ends: 3363 [2018-09-30 10:17:48,291 INFO L226 Difference]: Without dead ends: 3355 [2018-09-30 10:17:48,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3712 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1635, Invalid=9495, Unknown=0, NotChecked=0, Total=11130 [2018-09-30 10:17:48,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2018-09-30 10:17:50,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 1535. [2018-09-30 10:17:50,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states. [2018-09-30 10:17:50,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 3580 transitions. [2018-09-30 10:17:50,196 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 3580 transitions. Word has length 16 [2018-09-30 10:17:50,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:50,196 INFO L480 AbstractCegarLoop]: Abstraction has 1535 states and 3580 transitions. [2018-09-30 10:17:50,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 10:17:50,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 3580 transitions. [2018-09-30 10:17:50,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:17:50,197 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:50,197 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:17:50,198 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:50,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:50,198 INFO L82 PathProgramCache]: Analyzing trace with hash 723989304, now seen corresponding path program 1 times [2018-09-30 10:17:50,198 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:50,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:50,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:50,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:50,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:50,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:50,309 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:17:50,309 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-09-30 10:17:50,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:50,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:17:50,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:50,484 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:17:50,484 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2018-09-30 10:17:50,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 10:17:50,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 10:17:50,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-09-30 10:17:50,485 INFO L87 Difference]: Start difference. First operand 1535 states and 3580 transitions. Second operand 18 states. [2018-09-30 10:18:07,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:18:07,208 INFO L93 Difference]: Finished difference Result 2910 states and 6684 transitions. [2018-09-30 10:18:07,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-30 10:18:07,208 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16 [2018-09-30 10:18:07,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:18:07,212 INFO L225 Difference]: With dead ends: 2910 [2018-09-30 10:18:07,213 INFO L226 Difference]: Without dead ends: 2902 [2018-09-30 10:18:07,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3369 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1407, Invalid=8693, Unknown=0, NotChecked=0, Total=10100 [2018-09-30 10:18:07,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2018-09-30 10:18:08,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 1226. [2018-09-30 10:18:08,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-09-30 10:18:08,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 2816 transitions. [2018-09-30 10:18:08,821 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 2816 transitions. Word has length 16 [2018-09-30 10:18:08,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:18:08,821 INFO L480 AbstractCegarLoop]: Abstraction has 1226 states and 2816 transitions. [2018-09-30 10:18:08,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 10:18:08,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 2816 transitions. [2018-09-30 10:18:08,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:18:08,822 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:18:08,822 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:18:08,823 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:18:08,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:18:08,823 INFO L82 PathProgramCache]: Analyzing trace with hash 876461633, now seen corresponding path program 1 times [2018-09-30 10:18:08,823 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:18:08,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:18:08,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:08,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:08,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:08,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:18:08,917 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:18:08,917 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-09-30 10:18:08,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:08,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:18:09,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:18:09,141 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:18:09,141 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 10:18:09,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 10:18:09,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 10:18:09,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-30 10:18:09,142 INFO L87 Difference]: Start difference. First operand 1226 states and 2816 transitions. Second operand 17 states. [2018-09-30 10:18:22,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:18:22,934 INFO L93 Difference]: Finished difference Result 2474 states and 5593 transitions. [2018-09-30 10:18:22,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-30 10:18:22,934 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 10:18:22,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:18:22,937 INFO L225 Difference]: With dead ends: 2474 [2018-09-30 10:18:22,937 INFO L226 Difference]: Without dead ends: 2466 [2018-09-30 10:18:22,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2722 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1240, Invalid=6950, Unknown=0, NotChecked=0, Total=8190 [2018-09-30 10:18:22,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states. [2018-09-30 10:18:24,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 1069. [2018-09-30 10:18:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2018-09-30 10:18:24,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 2444 transitions. [2018-09-30 10:18:24,435 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 2444 transitions. Word has length 16 [2018-09-30 10:18:24,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:18:24,435 INFO L480 AbstractCegarLoop]: Abstraction has 1069 states and 2444 transitions. [2018-09-30 10:18:24,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 10:18:24,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 2444 transitions. [2018-09-30 10:18:24,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:18:24,436 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:18:24,436 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:18:24,437 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:18:24,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:18:24,438 INFO L82 PathProgramCache]: Analyzing trace with hash -345007351, now seen corresponding path program 1 times [2018-09-30 10:18:24,438 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:18:24,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:18:24,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:24,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:24,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:24,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 10:18:24,541 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:18:24,541 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-09-30 10:18:24,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:24,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:18:24,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 10:18:24,582 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:18:24,582 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 10:18:24,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:18:24,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:18:24,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:18:24,583 INFO L87 Difference]: Start difference. First operand 1069 states and 2444 transitions. Second operand 8 states. [2018-09-30 10:18:28,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:18:28,177 INFO L93 Difference]: Finished difference Result 1522 states and 3375 transitions. [2018-09-30 10:18:28,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-30 10:18:28,178 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 10:18:28,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:18:28,180 INFO L225 Difference]: With dead ends: 1522 [2018-09-30 10:18:28,180 INFO L226 Difference]: Without dead ends: 1514 [2018-09-30 10:18:28,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-09-30 10:18:28,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2018-09-30 10:18:29,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1225. [2018-09-30 10:18:29,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-09-30 10:18:29,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 2809 transitions. [2018-09-30 10:18:29,850 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 2809 transitions. Word has length 16 [2018-09-30 10:18:29,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:18:29,850 INFO L480 AbstractCegarLoop]: Abstraction has 1225 states and 2809 transitions. [2018-09-30 10:18:29,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:18:29,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 2809 transitions. [2018-09-30 10:18:29,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:18:29,851 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:18:29,852 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:18:29,852 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:18:29,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:18:29,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521947, now seen corresponding path program 1 times [2018-09-30 10:18:29,852 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:18:29,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:18:29,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:29,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:29,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:29,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 10:18:29,937 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:18:29,937 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-09-30 10:18:29,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:29,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:18:29,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 10:18:30,002 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:18:30,002 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 10:18:30,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:18:30,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:18:30,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:18:30,003 INFO L87 Difference]: Start difference. First operand 1225 states and 2809 transitions. Second operand 8 states. [2018-09-30 10:18:34,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:18:34,027 INFO L93 Difference]: Finished difference Result 1661 states and 3674 transitions. [2018-09-30 10:18:34,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 10:18:34,028 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 10:18:34,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:18:34,030 INFO L225 Difference]: With dead ends: 1661 [2018-09-30 10:18:34,030 INFO L226 Difference]: Without dead ends: 1653 [2018-09-30 10:18:34,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-09-30 10:18:34,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2018-09-30 10:18:35,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1237. [2018-09-30 10:18:35,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2018-09-30 10:18:35,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 2833 transitions. [2018-09-30 10:18:35,687 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 2833 transitions. Word has length 16 [2018-09-30 10:18:35,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:18:35,688 INFO L480 AbstractCegarLoop]: Abstraction has 1237 states and 2833 transitions. [2018-09-30 10:18:35,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:18:35,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 2833 transitions. [2018-09-30 10:18:35,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:18:35,689 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:18:35,689 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:18:35,689 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:18:35,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:18:35,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521668, now seen corresponding path program 1 times [2018-09-30 10:18:35,690 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:18:35,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:18:35,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:35,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:35,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:35,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 10:18:35,812 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:18:35,812 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-09-30 10:18:35,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:35,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:18:35,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 10:18:35,850 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:18:35,850 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 10:18:35,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:18:35,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:18:35,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:18:35,851 INFO L87 Difference]: Start difference. First operand 1237 states and 2833 transitions. Second operand 8 states. [2018-09-30 10:18:40,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:18:40,754 INFO L93 Difference]: Finished difference Result 1772 states and 3936 transitions. [2018-09-30 10:18:40,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:18:40,754 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 10:18:40,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:18:40,756 INFO L225 Difference]: With dead ends: 1772 [2018-09-30 10:18:40,756 INFO L226 Difference]: Without dead ends: 1764 [2018-09-30 10:18:40,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-09-30 10:18:40,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2018-09-30 10:18:42,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1318. [2018-09-30 10:18:42,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1318 states. [2018-09-30 10:18:42,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 3019 transitions. [2018-09-30 10:18:42,507 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 3019 transitions. Word has length 16 [2018-09-30 10:18:42,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:18:42,507 INFO L480 AbstractCegarLoop]: Abstraction has 1318 states and 3019 transitions. [2018-09-30 10:18:42,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:18:42,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 3019 transitions. [2018-09-30 10:18:42,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:18:42,508 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:18:42,508 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:18:42,508 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:18:42,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:18:42,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1133346772, now seen corresponding path program 1 times [2018-09-30 10:18:42,509 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:18:42,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:18:42,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:42,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:42,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:42,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 10:18:42,683 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:18:42,684 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-09-30 10:18:42,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:42,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:18:42,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 10:18:42,721 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:18:42,722 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 10:18:42,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:18:42,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:18:42,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:18:42,722 INFO L87 Difference]: Start difference. First operand 1318 states and 3019 transitions. Second operand 8 states. [2018-09-30 10:18:46,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:18:46,874 INFO L93 Difference]: Finished difference Result 1789 states and 3956 transitions. [2018-09-30 10:18:46,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:18:46,875 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 10:18:46,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:18:46,877 INFO L225 Difference]: With dead ends: 1789 [2018-09-30 10:18:46,877 INFO L226 Difference]: Without dead ends: 1781 [2018-09-30 10:18:46,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-09-30 10:18:46,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2018-09-30 10:18:48,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1345. [2018-09-30 10:18:48,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states. [2018-09-30 10:18:48,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 3076 transitions. [2018-09-30 10:18:48,596 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 3076 transitions. Word has length 16 [2018-09-30 10:18:48,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:18:48,597 INFO L480 AbstractCegarLoop]: Abstraction has 1345 states and 3076 transitions. [2018-09-30 10:18:48,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:18:48,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 3076 transitions. [2018-09-30 10:18:48,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:18:48,597 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:18:48,597 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:18:48,598 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:18:48,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:18:48,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1133347051, now seen corresponding path program 1 times [2018-09-30 10:18:48,598 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:18:48,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:18:48,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:48,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:48,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:48,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 10:18:48,698 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:18:48,698 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-09-30 10:18:48,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:48,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:18:48,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 10:18:48,738 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:18:48,738 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 10:18:48,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:18:48,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:18:48,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:18:48,739 INFO L87 Difference]: Start difference. First operand 1345 states and 3076 transitions. Second operand 8 states. Received shutdown request... [2018-09-30 10:18:50,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:18:50,833 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 10:18:50,839 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 10:18:50,839 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:18:50 BoogieIcfgContainer [2018-09-30 10:18:50,839 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:18:50,840 INFO L168 Benchmark]: Toolchain (without parser) took 253926.05 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 431.5 MB). Free memory was 1.5 GB in the beginning and 929.4 MB in the end (delta: 542.5 MB). Peak memory consumption was 974.0 MB. Max. memory is 7.1 GB. [2018-09-30 10:18:50,841 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:18:50,842 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:18:50,842 INFO L168 Benchmark]: Boogie Preprocessor took 60.11 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:18:50,843 INFO L168 Benchmark]: RCFGBuilder took 838.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-30 10:18:50,843 INFO L168 Benchmark]: TraceAbstraction took 252962.63 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 431.5 MB). Free memory was 1.4 GB in the beginning and 929.4 MB in the end (delta: 510.8 MB). Peak memory consumption was 942.3 MB. Max. memory is 7.1 GB. [2018-09-30 10:18:50,847 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.87 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 60.11 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 838.22 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 252962.63 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 431.5 MB). Free memory was 1.4 GB in the beginning and 929.4 MB in the end (delta: 510.8 MB). Peak memory consumption was 942.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 205]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 205). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (476 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 240]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 240). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (476 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 54). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (476 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 284]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 284). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (476 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 229]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 229). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (476 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 247]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 247). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (476 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 250]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 250). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (476 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 154). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (476 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 264]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 264). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (476 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 (1345states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (476 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 222]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 222). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (476 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 364]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 364). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (476 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 294]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 294). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (476 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 332]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 332). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (476 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 252.8s OverallTime, 41 OverallIterations, 2 TraceHistogramMax, 216.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12226 SDtfs, 40944 SDslu, 48991 SDs, 0 SdLazy, 118788 SolverSat, 8850 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 107.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2033 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 1717 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 51510 ImplicationChecksByTransitivity, 39.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1535occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 27.1s AutomataMinimizationTime, 40 MinimizatonAttempts, 26535 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 772 NumberOfCodeBlocks, 772 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 716 ConstructedInterpolants, 78 QuantifiedInterpolants, 46500 SizeOfPredicates, 88 NumberOfNonLiveVariables, 595 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 56 InterpolantComputations, 28 PerfectInterpolantSequences, 40/83 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-18-50-858.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-18-50-858.csv Completed graceful shutdown