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 -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:06:10,908 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:06:10,910 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:06:10,924 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:06:10,924 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:06:10,925 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:06:10,927 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:06:10,929 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:06:10,931 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:06:10,932 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:06:10,934 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:06:10,934 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:06:10,936 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:06:10,943 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:06:10,946 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:06:10,949 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:06:10,951 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:06:10,956 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:06:10,961 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:06:10,964 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:06:10,966 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:06:10,969 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:06:10,975 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:06:10,976 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:06:10,976 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:06:10,977 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:06:10,980 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:06:10,982 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:06:10,983 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:06:10,984 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:06:10,984 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:06:10,985 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:06:10,987 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:06:10,987 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:06:10,988 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:06:10,990 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:06:10,991 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:06:11,008 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:06:11,009 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:06:11,011 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:06:11,011 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:06:11,011 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:06:11,011 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:06:11,012 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:06:11,012 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:06:11,090 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:06:11,104 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:06:11,108 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:06:11,110 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:06:11,111 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:06:11,111 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl [2018-09-26 08:06:11,112 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl' [2018-09-26 08:06:11,181 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:06:11,184 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:06:11,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:06:11,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:06:11,186 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:06:11,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:11" (1/1) ... [2018-09-26 08:06:11,226 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:11" (1/1) ... [2018-09-26 08:06:11,232 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 08:06:11,233 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 08:06:11,233 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 08:06:11,235 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:06:11,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:06:11,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:06:11,237 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:06:11,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:11" (1/1) ... [2018-09-26 08:06:11,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:11" (1/1) ... [2018-09-26 08:06:11,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:11" (1/1) ... [2018-09-26 08:06:11,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:11" (1/1) ... [2018-09-26 08:06:11,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:11" (1/1) ... [2018-09-26 08:06:11,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:11" (1/1) ... [2018-09-26 08:06:11,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:11" (1/1) ... [2018-09-26 08:06:11,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:06:11,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:06:11,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:06:11,271 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:06:11,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:11" (1/1) ... [2018-09-26 08:06:11,368 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-26 08:06:11,368 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-26 08:06:11,368 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-26 08:06:11,583 INFO L343 CfgBuilder]: Using library mode [2018-09-26 08:06:11,584 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:06:11 BoogieIcfgContainer [2018-09-26 08:06:11,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:06:11,586 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:06:11,586 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:06:11,590 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:06:11,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:11" (1/2) ... [2018-09-26 08:06:11,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d65299f and model type threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:06:11, skipping insertion in model container [2018-09-26 08:06:11,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:06:11" (2/2) ... [2018-09-26 08:06:11,594 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out2.mover.bpl [2018-09-26 08:06:11,605 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:06:11,613 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-09-26 08:06:11,660 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:06:11,661 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:06:11,662 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:06:11,662 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:06:11,662 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:06:11,662 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:06:11,663 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:06:11,663 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:06:11,663 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:06:11,680 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-09-26 08:06:11,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:06:11,690 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:11,691 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:06:11,692 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:11,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:11,700 INFO L82 PathProgramCache]: Analyzing trace with hash 934210, now seen corresponding path program 1 times [2018-09-26 08:06:11,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:11,852 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-26 08:06:11,854 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:11,855 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:06:11,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:06:11,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:06:11,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:06:11,877 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 5 states. [2018-09-26 08:06:12,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:12,190 INFO L93 Difference]: Finished difference Result 30 states and 67 transitions. [2018-09-26 08:06:12,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:06:12,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-09-26 08:06:12,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:12,206 INFO L225 Difference]: With dead ends: 30 [2018-09-26 08:06:12,207 INFO L226 Difference]: Without dead ends: 28 [2018-09-26 08:06:12,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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-26 08:06:12,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-09-26 08:06:12,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2018-09-26 08:06:12,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-26 08:06:12,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 48 transitions. [2018-09-26 08:06:12,272 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 48 transitions. Word has length 4 [2018-09-26 08:06:12,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:12,272 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 48 transitions. [2018-09-26 08:06:12,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:06:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 48 transitions. [2018-09-26 08:06:12,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:06:12,274 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:12,274 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:06:12,275 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:12,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:12,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1042904, now seen corresponding path program 1 times [2018-09-26 08:06:12,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:12,311 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-26 08:06:12,312 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:12,312 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:06:12,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:06:12,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:06:12,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:06:12,315 INFO L87 Difference]: Start difference. First operand 22 states and 48 transitions. Second operand 5 states. [2018-09-26 08:06:12,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:12,568 INFO L93 Difference]: Finished difference Result 50 states and 117 transitions. [2018-09-26 08:06:12,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:06:12,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-09-26 08:06:12,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:12,570 INFO L225 Difference]: With dead ends: 50 [2018-09-26 08:06:12,570 INFO L226 Difference]: Without dead ends: 46 [2018-09-26 08:06:12,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:12,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-26 08:06:12,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2018-09-26 08:06:12,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-26 08:06:12,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 101 transitions. [2018-09-26 08:06:12,606 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 101 transitions. Word has length 4 [2018-09-26 08:06:12,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:12,606 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 101 transitions. [2018-09-26 08:06:12,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:06:12,607 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 101 transitions. [2018-09-26 08:06:12,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:12,610 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:12,610 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:12,611 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:12,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:12,611 INFO L82 PathProgramCache]: Analyzing trace with hash 897576008, now seen corresponding path program 1 times [2018-09-26 08:06:12,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:12,652 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-26 08:06:12,653 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:12,653 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:12,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:06:12,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:06:12,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:12,654 INFO L87 Difference]: Start difference. First operand 40 states and 101 transitions. Second operand 6 states. [2018-09-26 08:06:12,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:12,961 INFO L93 Difference]: Finished difference Result 152 states and 379 transitions. [2018-09-26 08:06:12,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:06:12,962 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-09-26 08:06:12,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:12,973 INFO L225 Difference]: With dead ends: 152 [2018-09-26 08:06:12,973 INFO L226 Difference]: Without dead ends: 148 [2018-09-26 08:06:12,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:12,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-09-26 08:06:13,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 76. [2018-09-26 08:06:13,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-26 08:06:13,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 225 transitions. [2018-09-26 08:06:13,030 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 225 transitions. Word has length 6 [2018-09-26 08:06:13,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:13,032 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 225 transitions. [2018-09-26 08:06:13,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:06:13,032 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 225 transitions. [2018-09-26 08:06:13,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:13,034 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:13,034 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:13,035 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:13,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:13,036 INFO L82 PathProgramCache]: Analyzing trace with hash 897578922, now seen corresponding path program 1 times [2018-09-26 08:06:13,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:13,056 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-26 08:06:13,057 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:13,057 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:13,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:06:13,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:06:13,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:13,059 INFO L87 Difference]: Start difference. First operand 76 states and 225 transitions. Second operand 6 states. [2018-09-26 08:06:13,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:13,249 INFO L93 Difference]: Finished difference Result 148 states and 381 transitions. [2018-09-26 08:06:13,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:06:13,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-09-26 08:06:13,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:13,253 INFO L225 Difference]: With dead ends: 148 [2018-09-26 08:06:13,253 INFO L226 Difference]: Without dead ends: 144 [2018-09-26 08:06:13,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:13,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-09-26 08:06:13,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 87. [2018-09-26 08:06:13,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 08:06:13,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 262 transitions. [2018-09-26 08:06:13,283 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 262 transitions. Word has length 6 [2018-09-26 08:06:13,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:13,284 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 262 transitions. [2018-09-26 08:06:13,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:06:13,284 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 262 transitions. [2018-09-26 08:06:13,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:13,285 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:13,285 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:13,286 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:13,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:13,287 INFO L82 PathProgramCache]: Analyzing trace with hash 897783584, now seen corresponding path program 1 times [2018-09-26 08:06:13,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:13,299 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-26 08:06:13,300 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:13,300 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:13,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:06:13,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:06:13,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:13,302 INFO L87 Difference]: Start difference. First operand 87 states and 262 transitions. Second operand 6 states. [2018-09-26 08:06:13,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:13,501 INFO L93 Difference]: Finished difference Result 171 states and 457 transitions. [2018-09-26 08:06:13,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:06:13,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-09-26 08:06:13,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:13,504 INFO L225 Difference]: With dead ends: 171 [2018-09-26 08:06:13,504 INFO L226 Difference]: Without dead ends: 167 [2018-09-26 08:06:13,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:06:13,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-09-26 08:06:13,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 96. [2018-09-26 08:06:13,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-26 08:06:13,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 287 transitions. [2018-09-26 08:06:13,562 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 287 transitions. Word has length 6 [2018-09-26 08:06:13,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:13,563 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 287 transitions. [2018-09-26 08:06:13,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:06:13,563 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 287 transitions. [2018-09-26 08:06:13,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:13,565 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:13,566 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-09-26 08:06:13,566 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:13,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:13,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1002235768, now seen corresponding path program 1 times [2018-09-26 08:06:13,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:13,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:13,589 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:13,590 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:06:13,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:06:13,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:06:13,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:13,592 INFO L87 Difference]: Start difference. First operand 96 states and 287 transitions. Second operand 6 states. [2018-09-26 08:06:13,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:13,756 INFO L93 Difference]: Finished difference Result 117 states and 345 transitions. [2018-09-26 08:06:13,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:06:13,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-09-26 08:06:13,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:13,758 INFO L225 Difference]: With dead ends: 117 [2018-09-26 08:06:13,761 INFO L226 Difference]: Without dead ends: 115 [2018-09-26 08:06:13,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:06:13,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-26 08:06:13,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 89. [2018-09-26 08:06:13,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 08:06:13,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 261 transitions. [2018-09-26 08:06:13,808 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 261 transitions. Word has length 6 [2018-09-26 08:06:13,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:13,808 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 261 transitions. [2018-09-26 08:06:13,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:06:13,809 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 261 transitions. [2018-09-26 08:06:13,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:13,810 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:13,810 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:13,811 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:13,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:13,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1002208758, now seen corresponding path program 1 times [2018-09-26 08:06:13,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:13,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:13,830 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:13,830 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:13,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:06:13,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:06:13,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:13,832 INFO L87 Difference]: Start difference. First operand 89 states and 261 transitions. Second operand 6 states. [2018-09-26 08:06:14,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:14,118 INFO L93 Difference]: Finished difference Result 203 states and 555 transitions. [2018-09-26 08:06:14,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:14,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-09-26 08:06:14,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:14,121 INFO L225 Difference]: With dead ends: 203 [2018-09-26 08:06:14,122 INFO L226 Difference]: Without dead ends: 199 [2018-09-26 08:06:14,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:06:14,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-09-26 08:06:14,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 138. [2018-09-26 08:06:14,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-09-26 08:06:14,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 418 transitions. [2018-09-26 08:06:14,195 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 418 transitions. Word has length 6 [2018-09-26 08:06:14,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:14,195 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 418 transitions. [2018-09-26 08:06:14,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:06:14,196 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 418 transitions. [2018-09-26 08:06:14,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:14,197 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:14,197 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:14,198 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:14,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:14,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1000027257, now seen corresponding path program 1 times [2018-09-26 08:06:14,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:14,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-26 08:06:14,233 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:14,233 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:14,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:06:14,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:06:14,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:14,236 INFO L87 Difference]: Start difference. First operand 138 states and 418 transitions. Second operand 6 states. [2018-09-26 08:06:14,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:14,522 INFO L93 Difference]: Finished difference Result 233 states and 646 transitions. [2018-09-26 08:06:14,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:06:14,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-09-26 08:06:14,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:14,525 INFO L225 Difference]: With dead ends: 233 [2018-09-26 08:06:14,526 INFO L226 Difference]: Without dead ends: 229 [2018-09-26 08:06:14,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:14,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-09-26 08:06:14,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 150. [2018-09-26 08:06:14,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-09-26 08:06:14,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 463 transitions. [2018-09-26 08:06:14,596 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 463 transitions. Word has length 6 [2018-09-26 08:06:14,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:14,596 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 463 transitions. [2018-09-26 08:06:14,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:06:14,599 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 463 transitions. [2018-09-26 08:06:14,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:14,600 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:14,601 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:06:14,601 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:14,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:14,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1000030171, now seen corresponding path program 1 times [2018-09-26 08:06:14,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:14,626 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-26 08:06:14,626 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:14,626 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:14,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:06:14,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:06:14,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:14,628 INFO L87 Difference]: Start difference. First operand 150 states and 463 transitions. Second operand 6 states. [2018-09-26 08:06:14,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:14,918 INFO L93 Difference]: Finished difference Result 246 states and 685 transitions. [2018-09-26 08:06:14,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:06:14,918 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-09-26 08:06:14,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:14,921 INFO L225 Difference]: With dead ends: 246 [2018-09-26 08:06:14,921 INFO L226 Difference]: Without dead ends: 242 [2018-09-26 08:06:14,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:06:14,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-09-26 08:06:14,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 150. [2018-09-26 08:06:14,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-09-26 08:06:14,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 463 transitions. [2018-09-26 08:06:14,989 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 463 transitions. Word has length 6 [2018-09-26 08:06:14,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:14,990 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 463 transitions. [2018-09-26 08:06:14,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:06:14,990 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 463 transitions. [2018-09-26 08:06:14,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:14,991 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:14,991 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:14,992 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:14,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:14,994 INFO L82 PathProgramCache]: Analyzing trace with hash -735598757, now seen corresponding path program 1 times [2018-09-26 08:06:14,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:15,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:15,030 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:15,030 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:15,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:15,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:15,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:15,031 INFO L87 Difference]: Start difference. First operand 150 states and 463 transitions. Second operand 8 states. [2018-09-26 08:06:15,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:15,495 INFO L93 Difference]: Finished difference Result 281 states and 789 transitions. [2018-09-26 08:06:15,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:06:15,495 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 08:06:15,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:15,498 INFO L225 Difference]: With dead ends: 281 [2018-09-26 08:06:15,499 INFO L226 Difference]: Without dead ends: 277 [2018-09-26 08:06:15,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:06:15,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-09-26 08:06:15,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 171. [2018-09-26 08:06:15,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-09-26 08:06:15,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 536 transitions. [2018-09-26 08:06:15,576 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 536 transitions. Word has length 8 [2018-09-26 08:06:15,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:15,576 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 536 transitions. [2018-09-26 08:06:15,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:15,577 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 536 transitions. [2018-09-26 08:06:15,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:15,578 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:15,578 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:15,579 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:15,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:15,579 INFO L82 PathProgramCache]: Analyzing trace with hash -735595843, now seen corresponding path program 1 times [2018-09-26 08:06:15,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:15,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:15,607 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:15,607 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:15,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:15,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:15,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:15,609 INFO L87 Difference]: Start difference. First operand 171 states and 536 transitions. Second operand 8 states. [2018-09-26 08:06:16,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:16,054 INFO L93 Difference]: Finished difference Result 260 states and 736 transitions. [2018-09-26 08:06:16,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:06:16,054 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 08:06:16,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:16,057 INFO L225 Difference]: With dead ends: 260 [2018-09-26 08:06:16,057 INFO L226 Difference]: Without dead ends: 256 [2018-09-26 08:06:16,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:06:16,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-09-26 08:06:16,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 167. [2018-09-26 08:06:16,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-26 08:06:16,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 523 transitions. [2018-09-26 08:06:16,148 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 523 transitions. Word has length 8 [2018-09-26 08:06:16,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:16,148 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 523 transitions. [2018-09-26 08:06:16,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:16,148 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 523 transitions. [2018-09-26 08:06:16,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:16,150 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:16,150 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:16,151 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:16,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:16,151 INFO L82 PathProgramCache]: Analyzing trace with hash -735391181, now seen corresponding path program 1 times [2018-09-26 08:06:16,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:16,184 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-26 08:06:16,185 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:16,185 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:16,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:16,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:16,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:16,186 INFO L87 Difference]: Start difference. First operand 167 states and 523 transitions. Second operand 8 states. [2018-09-26 08:06:16,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:16,718 INFO L93 Difference]: Finished difference Result 329 states and 931 transitions. [2018-09-26 08:06:16,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:06:16,718 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 08:06:16,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:16,722 INFO L225 Difference]: With dead ends: 329 [2018-09-26 08:06:16,722 INFO L226 Difference]: Without dead ends: 325 [2018-09-26 08:06:16,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:06:16,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-09-26 08:06:16,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 211. [2018-09-26 08:06:16,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-09-26 08:06:16,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 662 transitions. [2018-09-26 08:06:16,843 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 662 transitions. Word has length 8 [2018-09-26 08:06:16,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:16,843 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 662 transitions. [2018-09-26 08:06:16,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:16,844 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 662 transitions. [2018-09-26 08:06:16,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:16,845 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:16,845 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:16,845 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:16,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:16,846 INFO L82 PathProgramCache]: Analyzing trace with hash -717875034, now seen corresponding path program 1 times [2018-09-26 08:06:16,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:16,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:16,861 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:16,861 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:16,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:16,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:16,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:16,862 INFO L87 Difference]: Start difference. First operand 211 states and 662 transitions. Second operand 7 states. [2018-09-26 08:06:17,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:17,318 INFO L93 Difference]: Finished difference Result 339 states and 980 transitions. [2018-09-26 08:06:17,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:17,319 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 08:06:17,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:17,322 INFO L225 Difference]: With dead ends: 339 [2018-09-26 08:06:17,322 INFO L226 Difference]: Without dead ends: 335 [2018-09-26 08:06:17,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:06:17,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-09-26 08:06:17,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 233. [2018-09-26 08:06:17,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-09-26 08:06:17,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 731 transitions. [2018-09-26 08:06:17,454 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 731 transitions. Word has length 8 [2018-09-26 08:06:17,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:17,454 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 731 transitions. [2018-09-26 08:06:17,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:17,454 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 731 transitions. [2018-09-26 08:06:17,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:17,455 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:17,455 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:17,456 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:17,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:17,456 INFO L82 PathProgramCache]: Analyzing trace with hash -715996279, now seen corresponding path program 1 times [2018-09-26 08:06:17,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:17,471 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-26 08:06:17,471 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:17,471 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:17,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:17,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:17,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:17,472 INFO L87 Difference]: Start difference. First operand 233 states and 731 transitions. Second operand 7 states. [2018-09-26 08:06:17,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:17,944 INFO L93 Difference]: Finished difference Result 379 states and 1067 transitions. [2018-09-26 08:06:17,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:06:17,944 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 08:06:17,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:17,948 INFO L225 Difference]: With dead ends: 379 [2018-09-26 08:06:17,948 INFO L226 Difference]: Without dead ends: 375 [2018-09-26 08:06:17,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:06:17,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-09-26 08:06:18,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 227. [2018-09-26 08:06:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-26 08:06:18,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 710 transitions. [2018-09-26 08:06:18,068 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 710 transitions. Word has length 8 [2018-09-26 08:06:18,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:18,068 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 710 transitions. [2018-09-26 08:06:18,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:18,068 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 710 transitions. [2018-09-26 08:06:18,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:18,069 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:18,069 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:18,070 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:18,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:18,070 INFO L82 PathProgramCache]: Analyzing trace with hash -715993365, now seen corresponding path program 1 times [2018-09-26 08:06:18,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:18,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:18,083 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:18,083 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:18,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:18,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:18,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:18,084 INFO L87 Difference]: Start difference. First operand 227 states and 710 transitions. Second operand 7 states. [2018-09-26 08:06:18,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:18,504 INFO L93 Difference]: Finished difference Result 372 states and 1062 transitions. [2018-09-26 08:06:18,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:06:18,504 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 08:06:18,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:18,508 INFO L225 Difference]: With dead ends: 372 [2018-09-26 08:06:18,508 INFO L226 Difference]: Without dead ends: 368 [2018-09-26 08:06:18,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:06:18,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-09-26 08:06:18,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 225. [2018-09-26 08:06:18,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-26 08:06:18,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 702 transitions. [2018-09-26 08:06:18,630 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 702 transitions. Word has length 8 [2018-09-26 08:06:18,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:18,630 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 702 transitions. [2018-09-26 08:06:18,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:18,630 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 702 transitions. [2018-09-26 08:06:18,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:18,631 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:18,631 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:18,632 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:18,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:18,632 INFO L82 PathProgramCache]: Analyzing trace with hash -518810611, now seen corresponding path program 1 times [2018-09-26 08:06:18,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:18,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:18,648 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:18,648 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:18,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:18,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:18,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:18,650 INFO L87 Difference]: Start difference. First operand 225 states and 702 transitions. Second operand 7 states. [2018-09-26 08:06:19,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:19,034 INFO L93 Difference]: Finished difference Result 389 states and 1133 transitions. [2018-09-26 08:06:19,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:06:19,034 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 08:06:19,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:19,037 INFO L225 Difference]: With dead ends: 389 [2018-09-26 08:06:19,038 INFO L226 Difference]: Without dead ends: 385 [2018-09-26 08:06:19,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:06:19,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-09-26 08:06:19,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 267. [2018-09-26 08:06:19,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-09-26 08:06:19,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 829 transitions. [2018-09-26 08:06:19,188 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 829 transitions. Word has length 8 [2018-09-26 08:06:19,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:19,188 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 829 transitions. [2018-09-26 08:06:19,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:19,189 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 829 transitions. [2018-09-26 08:06:19,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:19,190 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:19,190 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:19,190 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:19,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:19,191 INFO L82 PathProgramCache]: Analyzing trace with hash -518394498, now seen corresponding path program 1 times [2018-09-26 08:06:19,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:19,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:19,207 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:19,207 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:19,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:19,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:19,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:19,209 INFO L87 Difference]: Start difference. First operand 267 states and 829 transitions. Second operand 7 states. [2018-09-26 08:06:19,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:19,711 INFO L93 Difference]: Finished difference Result 339 states and 995 transitions. [2018-09-26 08:06:19,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:19,711 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 08:06:19,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:19,715 INFO L225 Difference]: With dead ends: 339 [2018-09-26 08:06:19,716 INFO L226 Difference]: Without dead ends: 335 [2018-09-26 08:06:19,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:19,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-09-26 08:06:19,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 236. [2018-09-26 08:06:19,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-09-26 08:06:19,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 725 transitions. [2018-09-26 08:06:19,902 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 725 transitions. Word has length 8 [2018-09-26 08:06:19,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:19,903 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 725 transitions. [2018-09-26 08:06:19,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:19,903 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 725 transitions. [2018-09-26 08:06:19,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:19,904 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:19,904 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:19,905 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:19,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:19,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1075876758, now seen corresponding path program 1 times [2018-09-26 08:06:19,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:19,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:19,917 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:19,917 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 08:06:19,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:06:19,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:06:19,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:06:19,918 INFO L87 Difference]: Start difference. First operand 236 states and 725 transitions. Second operand 4 states. [2018-09-26 08:06:20,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:20,082 INFO L93 Difference]: Finished difference Result 405 states and 1236 transitions. [2018-09-26 08:06:20,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:06:20,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-09-26 08:06:20,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:20,084 INFO L225 Difference]: With dead ends: 405 [2018-09-26 08:06:20,085 INFO L226 Difference]: Without dead ends: 218 [2018-09-26 08:06:20,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:06:20,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-09-26 08:06:20,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 160. [2018-09-26 08:06:20,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-09-26 08:06:20,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 459 transitions. [2018-09-26 08:06:20,213 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 459 transitions. Word has length 8 [2018-09-26 08:06:20,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:20,213 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 459 transitions. [2018-09-26 08:06:20,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:06:20,214 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 459 transitions. [2018-09-26 08:06:20,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:20,214 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:20,214 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:20,215 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:20,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:20,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1049947056, now seen corresponding path program 1 times [2018-09-26 08:06:20,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:20,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:20,232 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:20,233 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:20,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:20,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:20,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:20,235 INFO L87 Difference]: Start difference. First operand 160 states and 459 transitions. Second operand 7 states. [2018-09-26 08:06:20,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:20,757 INFO L93 Difference]: Finished difference Result 346 states and 967 transitions. [2018-09-26 08:06:20,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:06:20,757 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 08:06:20,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:20,760 INFO L225 Difference]: With dead ends: 346 [2018-09-26 08:06:20,760 INFO L226 Difference]: Without dead ends: 342 [2018-09-26 08:06:20,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:20,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-09-26 08:06:20,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 144. [2018-09-26 08:06:20,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-09-26 08:06:20,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 415 transitions. [2018-09-26 08:06:20,927 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 415 transitions. Word has length 8 [2018-09-26 08:06:20,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:20,927 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 415 transitions. [2018-09-26 08:06:20,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:20,927 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 415 transitions. [2018-09-26 08:06:20,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:20,928 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:20,928 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:20,928 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:20,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:20,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1049062448, now seen corresponding path program 1 times [2018-09-26 08:06:20,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:20,944 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:20,944 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:20,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:20,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:20,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:20,945 INFO L87 Difference]: Start difference. First operand 144 states and 415 transitions. Second operand 7 states. [2018-09-26 08:06:21,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:21,657 INFO L93 Difference]: Finished difference Result 316 states and 819 transitions. [2018-09-26 08:06:21,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:06:21,657 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 08:06:21,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:21,660 INFO L225 Difference]: With dead ends: 316 [2018-09-26 08:06:21,660 INFO L226 Difference]: Without dead ends: 312 [2018-09-26 08:06:21,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:06:21,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-09-26 08:06:21,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 146. [2018-09-26 08:06:21,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-09-26 08:06:21,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 423 transitions. [2018-09-26 08:06:21,851 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 423 transitions. Word has length 8 [2018-09-26 08:06:21,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:21,851 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 423 transitions. [2018-09-26 08:06:21,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:21,852 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 423 transitions. [2018-09-26 08:06:21,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:21,852 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:21,852 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:21,853 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:21,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:21,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1049059534, now seen corresponding path program 1 times [2018-09-26 08:06:21,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:21,865 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-26 08:06:21,866 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:21,866 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:21,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:21,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:21,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:21,867 INFO L87 Difference]: Start difference. First operand 146 states and 423 transitions. Second operand 7 states. [2018-09-26 08:06:22,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:22,540 INFO L93 Difference]: Finished difference Result 314 states and 817 transitions. [2018-09-26 08:06:22,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:06:22,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 08:06:22,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:22,544 INFO L225 Difference]: With dead ends: 314 [2018-09-26 08:06:22,544 INFO L226 Difference]: Without dead ends: 310 [2018-09-26 08:06:22,545 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:06:22,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-09-26 08:06:22,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 168. [2018-09-26 08:06:22,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-09-26 08:06:22,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 488 transitions. [2018-09-26 08:06:22,771 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 488 transitions. Word has length 8 [2018-09-26 08:06:22,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:22,772 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 488 transitions. [2018-09-26 08:06:22,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:22,772 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 488 transitions. [2018-09-26 08:06:22,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:22,773 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:22,773 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:22,774 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:22,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:22,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1046475405, now seen corresponding path program 1 times [2018-09-26 08:06:22,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:22,787 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-26 08:06:22,788 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:22,788 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:22,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:22,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:22,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:22,789 INFO L87 Difference]: Start difference. First operand 168 states and 488 transitions. Second operand 7 states. [2018-09-26 08:06:23,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:23,522 INFO L93 Difference]: Finished difference Result 315 states and 832 transitions. [2018-09-26 08:06:23,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:06:23,522 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 08:06:23,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:23,525 INFO L225 Difference]: With dead ends: 315 [2018-09-26 08:06:23,525 INFO L226 Difference]: Without dead ends: 311 [2018-09-26 08:06:23,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:06:23,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-09-26 08:06:23,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 151. [2018-09-26 08:06:23,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-26 08:06:23,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 435 transitions. [2018-09-26 08:06:23,713 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 435 transitions. Word has length 8 [2018-09-26 08:06:23,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:23,713 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 435 transitions. [2018-09-26 08:06:23,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:23,713 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 435 transitions. [2018-09-26 08:06:23,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:23,714 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:23,714 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:23,714 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:23,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:23,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1117485617, now seen corresponding path program 1 times [2018-09-26 08:06:23,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:23,727 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-26 08:06:23,727 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:23,727 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:23,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:23,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:23,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:23,728 INFO L87 Difference]: Start difference. First operand 151 states and 435 transitions. Second operand 7 states. [2018-09-26 08:06:24,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:24,485 INFO L93 Difference]: Finished difference Result 329 states and 898 transitions. [2018-09-26 08:06:24,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:06:24,485 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 08:06:24,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:24,488 INFO L225 Difference]: With dead ends: 329 [2018-09-26 08:06:24,488 INFO L226 Difference]: Without dead ends: 325 [2018-09-26 08:06:24,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:06:24,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-09-26 08:06:24,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 173. [2018-09-26 08:06:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-26 08:06:24,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 504 transitions. [2018-09-26 08:06:24,687 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 504 transitions. Word has length 8 [2018-09-26 08:06:24,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:24,687 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 504 transitions. [2018-09-26 08:06:24,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:24,688 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 504 transitions. [2018-09-26 08:06:24,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:24,688 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:24,688 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:24,689 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:24,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:24,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1119667118, now seen corresponding path program 1 times [2018-09-26 08:06:24,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:24,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:24,701 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:24,701 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:24,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:24,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:24,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:24,703 INFO L87 Difference]: Start difference. First operand 173 states and 504 transitions. Second operand 7 states. [2018-09-26 08:06:25,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:25,394 INFO L93 Difference]: Finished difference Result 301 states and 792 transitions. [2018-09-26 08:06:25,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:06:25,395 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 08:06:25,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:25,397 INFO L225 Difference]: With dead ends: 301 [2018-09-26 08:06:25,397 INFO L226 Difference]: Without dead ends: 297 [2018-09-26 08:06:25,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:06:25,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-09-26 08:06:25,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 166. [2018-09-26 08:06:25,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-09-26 08:06:25,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 479 transitions. [2018-09-26 08:06:25,638 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 479 transitions. Word has length 8 [2018-09-26 08:06:25,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:25,638 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 479 transitions. [2018-09-26 08:06:25,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:25,638 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 479 transitions. [2018-09-26 08:06:25,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:25,639 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:25,639 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:25,639 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:25,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:25,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1119664204, now seen corresponding path program 1 times [2018-09-26 08:06:25,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:25,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:25,654 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:25,654 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:25,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:25,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:25,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:25,655 INFO L87 Difference]: Start difference. First operand 166 states and 479 transitions. Second operand 7 states. [2018-09-26 08:06:26,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:26,432 INFO L93 Difference]: Finished difference Result 321 states and 842 transitions. [2018-09-26 08:06:26,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:06:26,433 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 08:06:26,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:26,435 INFO L225 Difference]: With dead ends: 321 [2018-09-26 08:06:26,435 INFO L226 Difference]: Without dead ends: 317 [2018-09-26 08:06:26,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:06:26,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-09-26 08:06:26,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 152. [2018-09-26 08:06:26,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-09-26 08:06:26,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 428 transitions. [2018-09-26 08:06:26,658 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 428 transitions. Word has length 8 [2018-09-26 08:06:26,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:26,659 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 428 transitions. [2018-09-26 08:06:26,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:26,659 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 428 transitions. [2018-09-26 08:06:26,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:06:26,659 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:26,659 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:26,660 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:26,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:26,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1958270560, now seen corresponding path program 1 times [2018-09-26 08:06:26,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:26,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:06:26,672 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:26,673 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 08:06:26,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:06:26,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:06:26,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:06:26,674 INFO L87 Difference]: Start difference. First operand 152 states and 428 transitions. Second operand 4 states. [2018-09-26 08:06:26,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:26,925 INFO L93 Difference]: Finished difference Result 288 states and 788 transitions. [2018-09-26 08:06:26,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:06:26,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-09-26 08:06:26,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:26,927 INFO L225 Difference]: With dead ends: 288 [2018-09-26 08:06:26,927 INFO L226 Difference]: Without dead ends: 137 [2018-09-26 08:06:26,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:06:26,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-09-26 08:06:27,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 124. [2018-09-26 08:06:27,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-09-26 08:06:27,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 302 transitions. [2018-09-26 08:06:27,170 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 302 transitions. Word has length 10 [2018-09-26 08:06:27,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:27,171 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 302 transitions. [2018-09-26 08:06:27,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:06:27,171 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 302 transitions. [2018-09-26 08:06:27,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:06:27,172 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:27,172 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:27,172 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:27,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:27,173 INFO L82 PathProgramCache]: Analyzing trace with hash -161849015, now seen corresponding path program 1 times [2018-09-26 08:06:27,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:27,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:06:27,185 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:27,185 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 08:06:27,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:06:27,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:06:27,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:06:27,186 INFO L87 Difference]: Start difference. First operand 124 states and 302 transitions. Second operand 4 states. [2018-09-26 08:06:27,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:27,491 INFO L93 Difference]: Finished difference Result 260 states and 641 transitions. [2018-09-26 08:06:27,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:06:27,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-09-26 08:06:27,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:27,493 INFO L225 Difference]: With dead ends: 260 [2018-09-26 08:06:27,493 INFO L226 Difference]: Without dead ends: 137 [2018-09-26 08:06:27,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:06:27,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-09-26 08:06:27,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 65. [2018-09-26 08:06:27,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:06:27,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 145 transitions. [2018-09-26 08:06:27,675 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 145 transitions. Word has length 10 [2018-09-26 08:06:27,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:27,675 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 145 transitions. [2018-09-26 08:06:27,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:06:27,675 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 145 transitions. [2018-09-26 08:06:27,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:27,676 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:27,676 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:27,678 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:27,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:27,679 INFO L82 PathProgramCache]: Analyzing trace with hash 564711112, now seen corresponding path program 1 times [2018-09-26 08:06:27,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:27,739 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:27,741 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:27,742 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:06:27,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:06:27,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:06:27,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:06:27,743 INFO L87 Difference]: Start difference. First operand 65 states and 145 transitions. Second operand 10 states. [2018-09-26 08:06:28,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:28,481 INFO L93 Difference]: Finished difference Result 201 states and 440 transitions. [2018-09-26 08:06:28,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:06:28,482 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-09-26 08:06:28,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:28,485 INFO L225 Difference]: With dead ends: 201 [2018-09-26 08:06:28,485 INFO L226 Difference]: Without dead ends: 197 [2018-09-26 08:06:28,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:06:28,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-09-26 08:06:28,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 70. [2018-09-26 08:06:28,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-26 08:06:28,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 157 transitions. [2018-09-26 08:06:28,680 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 157 transitions. Word has length 13 [2018-09-26 08:06:28,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:28,680 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 157 transitions. [2018-09-26 08:06:28,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:06:28,680 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 157 transitions. [2018-09-26 08:06:28,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:28,681 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:28,681 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:28,682 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:28,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:28,682 INFO L82 PathProgramCache]: Analyzing trace with hash -677740153, now seen corresponding path program 1 times [2018-09-26 08:06:28,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:28,705 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:28,705 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:28,705 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:06:28,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:06:28,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:06:28,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:06:28,706 INFO L87 Difference]: Start difference. First operand 70 states and 157 transitions. Second operand 10 states. [2018-09-26 08:06:29,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:29,622 INFO L93 Difference]: Finished difference Result 197 states and 439 transitions. [2018-09-26 08:06:29,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:06:29,622 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-09-26 08:06:29,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:29,624 INFO L225 Difference]: With dead ends: 197 [2018-09-26 08:06:29,624 INFO L226 Difference]: Without dead ends: 195 [2018-09-26 08:06:29,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:06:29,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-09-26 08:06:29,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 67. [2018-09-26 08:06:29,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 08:06:29,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 151 transitions. [2018-09-26 08:06:29,834 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 151 transitions. Word has length 13 [2018-09-26 08:06:29,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:29,834 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 151 transitions. [2018-09-26 08:06:29,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:06:29,834 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 151 transitions. [2018-09-26 08:06:29,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:29,835 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:29,835 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:29,835 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:29,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:29,835 INFO L82 PathProgramCache]: Analyzing trace with hash -599447802, now seen corresponding path program 1 times [2018-09-26 08:06:29,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:29,855 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:29,856 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:29,856 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:06:29,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:06:29,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:06:29,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:29,857 INFO L87 Difference]: Start difference. First operand 67 states and 151 transitions. Second operand 11 states. [2018-09-26 08:06:30,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:30,942 INFO L93 Difference]: Finished difference Result 179 states and 401 transitions. [2018-09-26 08:06:30,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:06:30,942 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2018-09-26 08:06:30,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:30,943 INFO L225 Difference]: With dead ends: 179 [2018-09-26 08:06:30,943 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 08:06:30,944 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=212, Invalid=780, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:06:30,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 08:06:30,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 08:06:30,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 08:06:30,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 08:06:30,945 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-09-26 08:06:30,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:30,945 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 08:06:30,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:06:30,945 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 08:06:30,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 08:06:30,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 08:06:32,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:37,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:38,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:38,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:38,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:38,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:40,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:41,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:41,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:41,698 WARN L178 SmtUtils]: Spent 10.74 s on a formula simplification. DAG size of input: 665 DAG size of output: 476 [2018-09-26 08:06:41,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:41,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:42,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:42,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:42,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:43,172 WARN L178 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 575 DAG size of output: 432 [2018-09-26 08:06:43,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:43,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:43,308 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 141 [2018-09-26 08:06:43,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:43,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:43,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:43,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:43,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:43,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:44,226 WARN L178 SmtUtils]: Spent 915.00 ms on a formula simplification. DAG size of input: 573 DAG size of output: 427 [2018-09-26 08:06:44,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:44,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:44,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:44,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:44,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:44,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:44,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:44,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:44,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:44,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:44,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:44,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:44,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:44,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:44,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:44,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:45,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:45,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:45,748 WARN L178 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 764 DAG size of output: 550 [2018-09-26 08:06:45,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:45,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:45,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:45,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:45,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:45,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:46,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:46,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:46,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:47,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:47,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:47,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:48,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:48,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:48,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:49,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:49,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:49,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:49,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:49,980 WARN L178 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 1006 DAG size of output: 723 [2018-09-26 08:06:49,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:50,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:50,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:50,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:50,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:50,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:50,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:50,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:50,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:50,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:50,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:50,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:50,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:50,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:51,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:51,641 WARN L178 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 670 DAG size of output: 488 [2018-09-26 08:06:51,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:51,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:51,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:51,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:51,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:51,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:52,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:52,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:52,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:52,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:52,620 WARN L178 SmtUtils]: Spent 977.00 ms on a formula simplification. DAG size of input: 513 DAG size of output: 356 [2018-09-26 08:06:52,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:52,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:53,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:53,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:53,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:53,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:56,459 WARN L178 SmtUtils]: Spent 3.84 s on a formula simplification. DAG size of input: 655 DAG size of output: 522 [2018-09-26 08:07:03,316 WARN L178 SmtUtils]: Spent 6.85 s on a formula simplification. DAG size of input: 465 DAG size of output: 50 [2018-09-26 08:07:05,377 WARN L178 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 394 DAG size of output: 43 [2018-09-26 08:07:05,660 WARN L178 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 39 [2018-09-26 08:07:06,967 WARN L178 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 394 DAG size of output: 79 [2018-09-26 08:07:08,677 WARN L178 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 504 DAG size of output: 84 [2018-09-26 08:07:11,956 WARN L178 SmtUtils]: Spent 3.27 s on a formula simplification. DAG size of input: 692 DAG size of output: 79 [2018-09-26 08:07:13,497 WARN L178 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 462 DAG size of output: 55 [2018-09-26 08:07:14,157 WARN L178 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 51 [2018-09-26 08:07:16,920 WARN L178 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 501 DAG size of output: 54 [2018-09-26 08:07:16,925 INFO L422 ceAbstractionStarter]: At program point L192(lines 72 210) the Hoare annotation is: (let ((.cse10 (+ product__local__threadpooling_working_1 2)) (.cse20 (+ product__local__threadpooling_working_0 1)) (.cse19 (+ product__local__threadpooling_end_1 1)) (.cse21 (+ product__local__threadpooling_i_0 1)) (.cse1 (+ product__local__threadpooling_end_0 1))) (let ((.cse3 (= product__local__threadpooling_end_1 product__global_next)) (.cse4 (<= (+ product__local__threadpooling_working_1 1) product__global_next)) (.cse8 (<= .cse1 product__global_next)) (.cse11 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse0 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse15 (<= .cse21 product__local__threadpooling_end_0)) (.cse18 (<= .cse19 product__local__threadpooling_working_0)) (.cse12 (<= .cse19 product__local__threadpooling_i_0)) (.cse17 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) (.cse2 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse14 (= product__local__threadpooling_end_0 product__global_next)) (.cse6 (<= product__local__threadpooling_end_0 .cse21)) (.cse5 (<= .cse20 product__global_next)) (.cse7 (<= .cse20 product__local__threadpooling_i_1)) (.cse13 (<= .cse10 product__global_next))) (or (let ((.cse9 (<= (+ product__local__threadpooling_working_0 2) product__global_next))) (or (and .cse0 (and (and (<= .cse1 product__local__threadpooling_i_1) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))) .cse8)) (and (and (= product__local__threadpooling_end_0 product__local__threadpooling_working_1) .cse3 .cse6 (= product__local__threadpooling_i_1 product__local__threadpooling_end_0)) .cse0 .cse9 .cse8) (and (and (or (and (<= .cse10 product__local__threadpooling_i_0) .cse6 (and .cse11 .cse12)) (and .cse6 (and .cse11 (= product__local__threadpooling_end_1 product__local__threadpooling_i_0)) .cse13)) .cse14 .cse9) .cse0 .cse15))) (let ((.cse16 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0))) (or (and .cse0 (and (and .cse11 .cse3) .cse16 .cse4 .cse5 .cse7) .cse8) (and .cse0 (and (= product__global_next product__local__threadpooling_end_0) (or (and .cse2 .cse16 .cse17) (and .cse16 .cse11 .cse18)) .cse5) (<= .cse10 product__local__threadpooling_end_0)))) (and (and .cse0 .cse15 (or (and (or (and .cse2 .cse18) (and .cse2 .cse12 .cse17)) .cse5 .cse14 .cse6) (and .cse2 (and (<= .cse19 product__local__threadpooling_end_0) .cse14 .cse6) .cse5 .cse7))) .cse13)))) [2018-09-26 08:07:16,927 INFO L422 ceAbstractionStarter]: At program point L209(lines 50 209) the Hoare annotation is: (let ((.cse11 (+ product__local__threadpooling_working_0 1))) (let ((.cse7 (<= .cse11 product__local__threadpooling_i_1)) (.cse3 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse2 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse6 (<= .cse11 product__global_next)) (.cse8 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1)))) (or (and (let ((.cse1 (+ product__local__threadpooling_working_0 2))) (let ((.cse0 (let ((.cse4 (= product__local__threadpooling_end_1 product__global_next)) (.cse5 (<= (+ product__local__threadpooling_working_1 1) product__global_next))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse5 (<= .cse1 product__local__threadpooling_working_1)))))) (or (and .cse0 (<= (+ product__local__threadpooling_end_0 1) product__global_next)) (and .cse0 (<= .cse1 product__global_next))))) .cse8) (and (let ((.cse10 (+ product__local__threadpooling_end_1 1))) (let ((.cse9 (and (<= .cse10 product__local__threadpooling_end_0) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) (<= .cse10 product__local__threadpooling_i_0)))) (or (and .cse3 .cse6 .cse9 .cse7) (and .cse3 (or (and .cse2 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) (and .cse9 (<= .cse10 product__local__threadpooling_working_0))) .cse6)))) .cse8 (= product__local__threadpooling_end_0 product__global_next) (<= (+ product__local__threadpooling_working_1 2) product__global_next))))) [2018-09-26 08:07:16,928 INFO L422 ceAbstractionStarter]: At program point L234(lines 97 234) the Hoare annotation is: (let ((.cse25 (+ product__local__threadpooling_working_1 2))) (let ((.cse22 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse20 (<= .cse25 product__local__threadpooling_i_0))) (let ((.cse10 (<= .cse25 product__local__threadpooling_working_0)) (.cse15 (and .cse22 .cse20)) (.cse9 (<= .cse25 product__global_next)) (.cse23 (= product__local__threadpooling_end_1 product__global_next)) (.cse21 (+ product__local__threadpooling_working_1 1)) (.cse2 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse24 (+ product__local__threadpooling_working_0 1))) (let ((.cse8 (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_end_0)) (.cse11 (= product__local__threadpooling_end_0 product__global_next)) (.cse7 (<= .cse24 product__local__threadpooling_i_1)) (.cse3 (and .cse23 (<= .cse21 product__global_next) .cse2)) (.cse6 (<= .cse24 product__global_next)) (.cse1 (<= (+ product__local__threadpooling_end_0 1) product__global_next)) (.cse5 (or (and .cse10 .cse15 .cse9) (and (<= .cse21 product__local__threadpooling_i_0) (and .cse22 .cse23) .cse9)))) (or (let ((.cse0 (let ((.cse4 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0))) (or (and (or (and .cse3 .cse4) (and .cse4 .cse5)) .cse6 .cse7) (and (or (and .cse8 .cse9) .cse10) .cse4 .cse6 .cse11))))) (or (and .cse0 .cse1) (and (= product__global_next product__local__threadpooling_end_0) .cse0 .cse2))) (let ((.cse19 (+ product__local__threadpooling_i_0 1))) (let ((.cse16 (<= product__local__threadpooling_end_0 .cse19)) (.cse13 (<= (+ product__local__threadpooling_working_0 2) product__global_next))) (let ((.cse17 (and .cse20 .cse13)) (.cse12 (and .cse16 .cse5)) (.cse14 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse18 (<= .cse19 product__local__threadpooling_end_0))) (or (and (and (and .cse12 .cse13) .cse1) .cse14) (and (or (and (or (and (and .cse8 .cse2) .cse9) .cse15) .cse6 .cse16) (and .cse17 .cse16)) .cse11 .cse18) (and (and (or (and (and (= product__global_next product__local__threadpooling_end_1) .cse17) .cse16) (and .cse6 .cse12 .cse7) (and (and .cse3 .cse6 .cse16) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)))) .cse1) .cse14 .cse18)))))))))) [2018-09-26 08:07:16,928 INFO L429 ceAbstractionStarter]: At program point productENTRY(lines 3 236) the Hoare annotation is: true [2018-09-26 08:07:16,928 INFO L426 ceAbstractionStarter]: For program point productFINAL(lines 3 236) no Hoare annotation was computed. [2018-09-26 08:07:16,928 INFO L426 ceAbstractionStarter]: For program point L119(lines 119 124) no Hoare annotation was computed. [2018-09-26 08:07:16,929 INFO L422 ceAbstractionStarter]: At program point productErr1ASSERT_VIOLATIONASSERT(line 82) the Hoare annotation is: false [2018-09-26 08:07:16,929 INFO L426 ceAbstractionStarter]: For program point L95(lines 95 190) no Hoare annotation was computed. [2018-09-26 08:07:16,929 INFO L422 ceAbstractionStarter]: At program point L203(lines 143 203) the Hoare annotation is: (let ((.cse5 (+ product__local__threadpooling_i_0 1)) (.cse3 (+ product__local__threadpooling_working_0 1))) (let ((.cse1 (<= .cse3 product__global_next)) (.cse0 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse4 (<= .cse5 product__local__threadpooling_end_0)) (.cse2 (<= product__local__threadpooling_end_0 .cse5))) (or (and .cse0 (and (and .cse1 (and (and (= product__local__threadpooling_end_1 product__global_next) (<= (+ product__local__threadpooling_working_1 1) product__global_next) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) .cse2) (<= .cse3 product__local__threadpooling_i_1)) (<= (+ product__local__threadpooling_end_0 1) product__global_next)) .cse4) (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) .cse1 .cse0 (= product__local__threadpooling_end_0 product__global_next) .cse4 (or (and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (= product__local__threadpooling_end_1 product__local__threadpooling_working_0) .cse2) (and (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_working_0) .cse2)) (<= (+ product__local__threadpooling_working_1 2) product__global_next))))) [2018-09-26 08:07:16,930 INFO L422 ceAbstractionStarter]: At program point productErr2ASSERT_VIOLATIONASSERT(line 171) the Hoare annotation is: false [2018-09-26 08:07:16,930 INFO L426 ceAbstractionStarter]: For program point L154(lines 154 159) no Hoare annotation was computed. [2018-09-26 08:07:16,931 INFO L422 ceAbstractionStarter]: At program point L121(lines 17 229) the Hoare annotation is: (let ((.cse1 (<= (+ product__local__threadpooling_working_0 2) product__global_next))) (let ((.cse0 (let ((.cse10 (+ product__local__threadpooling_working_1 1)) (.cse13 (+ product__local__threadpooling_working_1 2))) (let ((.cse4 (<= .cse13 product__global_next)) (.cse2 (= product__local__threadpooling_end_1 product__global_next)) (.cse3 (<= .cse10 product__global_next))) (or (or (and .cse2 .cse3 .cse1) (and .cse1 .cse4)) (let ((.cse9 (= product__local__threadpooling_end_0 product__global_next)) (.cse8 (+ product__local__threadpooling_working_0 1))) (let ((.cse5 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse6 (<= .cse8 product__global_next)) (.cse7 (let ((.cse12 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)))) (or (and (<= .cse10 product__local__threadpooling_i_0) (or (and (let ((.cse11 (+ product__local__threadpooling_end_1 1))) (and (<= .cse11 product__local__threadpooling_end_0) .cse12 (<= .cse11 product__local__threadpooling_i_0) .cse9)) .cse4) (and (<= .cse13 product__local__threadpooling_working_0) (<= .cse13 product__local__threadpooling_i_0) .cse4))) (and .cse12 .cse2 .cse3))))) (or (and .cse5 .cse6 .cse7 (<= .cse8 product__local__threadpooling_i_1)) (and .cse5 .cse6 .cse7 .cse9))))))))) (or (and .cse0 .cse1) (and .cse0 (<= (+ product__local__threadpooling_end_0 1) product__global_next)) (and (= product__global_next product__local__threadpooling_end_0) .cse0)))) [2018-09-26 08:07:16,931 INFO L426 ceAbstractionStarter]: For program point L196(lines 196 201) no Hoare annotation was computed. [2018-09-26 08:07:16,931 INFO L422 ceAbstractionStarter]: At program point productErr5ASSERT_VIOLATIONASSERT(line 186) the Hoare annotation is: false [2018-09-26 08:07:16,931 INFO L426 ceAbstractionStarter]: For program point productEXIT(lines 3 236) no Hoare annotation was computed. [2018-09-26 08:07:16,932 INFO L422 ceAbstractionStarter]: At program point L156(lines 126 185) the Hoare annotation is: (let ((.cse10 (+ product__local__threadpooling_i_0 1)) (.cse11 (+ product__local__threadpooling_working_1 2))) (let ((.cse8 (<= .cse11 product__local__threadpooling_working_0)) (.cse6 (+ product__local__threadpooling_working_1 1)) (.cse7 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse5 (<= product__local__threadpooling_end_0 .cse10))) (let ((.cse2 (or (and (and .cse8 (<= .cse11 product__local__threadpooling_i_0) (<= .cse11 product__global_next)) .cse5) (and (and (<= .cse6 product__global_next) (and (= product__local__threadpooling_end_1 product__global_next) .cse7)) .cse5))) (.cse1 (<= (+ product__local__threadpooling_end_0 1) product__global_next)) (.cse9 (<= .cse10 product__local__threadpooling_end_0))) (or (and (let ((.cse0 (let ((.cse4 (+ product__local__threadpooling_working_0 1))) (let ((.cse3 (<= .cse4 product__global_next))) (or (and .cse2 .cse3 (<= .cse4 product__local__threadpooling_i_1)) (and (and .cse3 .cse5 (or (and (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_end_0) (<= .cse6 product__local__threadpooling_i_0) .cse7) .cse8)) (= product__local__threadpooling_end_0 product__global_next))))))) (or (and .cse0 .cse1) (and (= product__global_next product__local__threadpooling_end_0) .cse0))) .cse9) (and (and (and (<= (+ product__local__threadpooling_working_0 2) product__global_next) .cse2) .cse1) (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1) .cse9))))) [2018-09-26 08:07:16,933 INFO L422 ceAbstractionStarter]: At program point L214(lines 161 214) the Hoare annotation is: (let ((.cse8 (+ product__local__threadpooling_i_0 1)) (.cse4 (+ product__local__threadpooling_working_0 1))) (let ((.cse1 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse2 (<= .cse4 product__global_next)) (.cse0 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse7 (= product__local__threadpooling_end_0 product__global_next)) (.cse3 (<= product__local__threadpooling_end_0 .cse8)) (.cse5 (<= .cse8 product__local__threadpooling_end_0)) (.cse6 (<= (+ product__local__threadpooling_working_1 2) product__global_next))) (or (or (and .cse0 (and (and .cse1 (= product__local__threadpooling_end_1 product__global_next) (<= (+ product__local__threadpooling_working_1 1) product__global_next) .cse2 .cse3 (<= .cse4 product__local__threadpooling_i_1)) (<= (+ product__local__threadpooling_end_0 1) product__global_next)) .cse5) (and .cse2 .cse0 (and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (= product__local__threadpooling_end_1 product__local__threadpooling_working_0) .cse3 .cse6) .cse7)) (and .cse1 .cse2 .cse0 .cse7 .cse3 (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_working_0) .cse5 .cse6)))) [2018-09-26 08:07:16,934 INFO L422 ceAbstractionStarter]: At program point L198(lines 32 219) the Hoare annotation is: (let ((.cse10 (+ product__local__threadpooling_working_0 1))) (let ((.cse5 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse3 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse6 (<= .cse10 product__global_next)) (.cse4 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse9 (<= .cse10 product__local__threadpooling_i_1)) (.cse8 (<= (+ product__local__threadpooling_working_1 2) product__global_next))) (or (and (let ((.cse1 (+ product__local__threadpooling_working_0 2))) (and (let ((.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse2 (<= (+ product__local__threadpooling_working_1 1) product__global_next))) (or (and (and .cse0 (<= .cse1 product__local__threadpooling_i_1)) .cse2) (and .cse3 (and .cse4 .cse0 .cse2)))) (<= .cse1 product__global_next))) .cse5) (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) .cse5 (and (= product__global_next product__local__threadpooling_end_0) (let ((.cse7 (+ product__local__threadpooling_end_1 1))) (or (and .cse3 .cse6 (and (or (<= .cse7 product__local__threadpooling_working_0) (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) .cse8)) (and .cse3 .cse6 (and (<= .cse7 product__local__threadpooling_end_0) .cse8) .cse9))))) (and (and .cse5 (and .cse3 .cse6 (and (= product__global_next product__local__threadpooling_end_1) .cse4) .cse9) (<= (+ product__local__threadpooling_end_0 1) product__global_next)) .cse8)))) [2018-09-26 08:07:16,934 INFO L422 ceAbstractionStarter]: At program point productErr4ASSERT_VIOLATIONASSERT(line 181) the Hoare annotation is: false [2018-09-26 08:07:16,934 INFO L426 ceAbstractionStarter]: For program point L207(lines 207 212) no Hoare annotation was computed. [2018-09-26 08:07:16,934 INFO L422 ceAbstractionStarter]: At program point productErr3ASSERT_VIOLATIONASSERT(line 176) the Hoare annotation is: false [2018-09-26 08:07:16,935 INFO L422 ceAbstractionStarter]: At program point L224(lines 84 224) the Hoare annotation is: (let ((.cse17 (+ product__local__threadpooling_end_0 1)) (.cse20 (+ product__local__threadpooling_i_0 1)) (.cse21 (+ product__local__threadpooling_working_0 2)) (.cse23 (+ product__local__threadpooling_working_0 1)) (.cse13 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse18 (= product__local__threadpooling_end_1 product__global_next)) (.cse19 (+ product__local__threadpooling_working_1 1)) (.cse22 (+ product__local__threadpooling_working_1 2)) (.cse12 (+ product__local__threadpooling_end_1 1))) (let ((.cse14 (<= .cse12 product__local__threadpooling_working_0)) (.cse7 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse15 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) (.cse6 (= product__local__threadpooling_end_0 product__global_next)) (.cse16 (<= .cse22 product__global_next)) (.cse4 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse8 (and .cse13 .cse18 (<= .cse19 product__global_next))) (.cse9 (<= .cse23 product__global_next)) (.cse2 (<= .cse21 product__global_next)) (.cse10 (<= .cse23 product__local__threadpooling_i_1)) (.cse0 (<= .cse22 product__local__threadpooling_i_0)) (.cse1 (<= .cse21 product__local__threadpooling_i_1)) (.cse3 (<= product__local__threadpooling_end_0 .cse20)) (.cse11 (<= .cse17 product__global_next)) (.cse5 (<= .cse20 product__local__threadpooling_end_0))) (or (and (and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (and (and (and .cse0 .cse1 .cse2) .cse3) .cse4 .cse5)) .cse6) (and (and (and .cse7 .cse8) .cse9 .cse10) .cse4 .cse11) (and (and .cse4 (and (= product__global_next product__local__threadpooling_end_0) (or (and .cse9 (and (<= .cse12 product__local__threadpooling_end_0) .cse13 .cse3) .cse10) (and .cse9 (or (and .cse13 .cse14) (and .cse13 (<= .cse12 product__local__threadpooling_i_0) .cse15)) .cse3))) .cse5) .cse16) (and .cse9 .cse4 (or (and .cse7 .cse13 .cse6 .cse14) (and .cse7 .cse13 .cse15 .cse6)) .cse16) (and .cse4 (or (and (and (<= .cse17 product__local__threadpooling_i_1) (or (and (and .cse8 .cse9 .cse3 .cse10) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))) (and (and .cse0 .cse18 .cse2) .cse3))) .cse11) (and (and (or (and .cse3 (and .cse13 .cse18 (<= .cse19 product__local__threadpooling_i_0)) .cse10) (and (and .cse0 .cse18 .cse1) .cse3)) (= product__local__threadpooling_i_1 product__local__threadpooling_end_0)) .cse11)) .cse5)))) [2018-09-26 08:07:16,935 INFO L426 ceAbstractionStarter]: For program point L43(lines 43 48) no Hoare annotation was computed. [2018-09-26 08:07:16,935 INFO L422 ceAbstractionStarter]: At program point productErr0ASSERT_VIOLATIONASSERT(line 60) the Hoare annotation is: false [2018-09-26 08:07:17,002 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:07:17 BoogieIcfgContainer [2018-09-26 08:07:17,002 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:07:17,003 INFO L168 Benchmark]: Toolchain (without parser) took 65822.03 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 275.4 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-09-26 08:07:17,006 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:07:17,006 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:07:17,007 INFO L168 Benchmark]: Boogie Preprocessor took 29.42 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:07:17,007 INFO L168 Benchmark]: RCFGBuilder took 314.13 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-26 08:07:17,009 INFO L168 Benchmark]: TraceAbstraction took 65416.72 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 264.8 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-09-26 08:07:17,018 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 51.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.42 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 314.13 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 65416.72 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 264.8 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 181]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 176]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 82]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 60]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 171]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 186]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_1 + 1 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) || (_local__threadpooling_end_0 <= _local__threadpooling_i_0 && (((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next)))) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || (((((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && _local__threadpooling_working_1 + 2 <= _global_next) || _local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_0 == _global_next)) && _local__threadpooling_end_0 + 1 <= _global_next) || ((_global_next == _local__threadpooling_end_0 && (((((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_1 + 1 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) || (_local__threadpooling_end_0 <= _local__threadpooling_i_0 && (((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next)))) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || (((((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && _local__threadpooling_working_1 + 2 <= _global_next) || _local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_0 == _global_next))) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1))) || (((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1 && (((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next))) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) || ((((((((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_working_1 + 2 <= _global_next) || (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0)) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || ((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1)) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0)) || (((((((_global_next == _local__threadpooling_end_1 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || ((_local__threadpooling_working_0 + 1 <= _global_next && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1 && (((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next))) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1)) || (((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_1 + 1 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0))) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) || (_local__threadpooling_working_0 + 2 <= _global_next && _local__threadpooling_working_1 + 2 <= _global_next)) || (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 1 <= _global_next) && ((_local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0 && (((((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next))) || ((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next))) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 1 <= _global_next) && ((_local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0 && (((((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next))) || ((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next))) && _local__threadpooling_end_0 == _global_next)) && _local__threadpooling_working_0 + 2 <= _global_next) || (((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) || (_local__threadpooling_working_0 + 2 <= _global_next && _local__threadpooling_working_1 + 2 <= _global_next)) || (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 1 <= _global_next) && ((_local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0 && (((((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next))) || ((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next))) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 1 <= _global_next) && ((_local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0 && (((((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next))) || ((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next))) && _local__threadpooling_end_0 == _global_next)) && _local__threadpooling_end_0 + 1 <= _global_next)) || (_global_next == _local__threadpooling_end_0 && ((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) || (_local__threadpooling_working_0 + 2 <= _global_next && _local__threadpooling_working_1 + 2 <= _global_next)) || (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 1 <= _global_next) && ((_local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0 && (((((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next))) || ((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next))) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 1 <= _global_next) && ((_local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0 && (((((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next))) || ((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next))) && _local__threadpooling_end_0 == _global_next))) - InvariantResult [Line: 143]: Loop Invariant Derived loop invariant: ((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && ((_local__threadpooling_working_0 + 1 <= _global_next && ((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_1 + 1 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) || ((((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && (((_local__threadpooling_end_1 == _local__threadpooling_i_0 && _local__threadpooling_end_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || (_local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1))) && _local__threadpooling_working_1 + 2 <= _global_next) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _global_next) || (_local__threadpooling_end_0 <= _local__threadpooling_i_0 && (!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next)) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) || ((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _global_next == _local__threadpooling_end_0 && (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 1 <= _global_next) && (_local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0 || _local__threadpooling_end_1 == _local__threadpooling_working_0) && _local__threadpooling_working_1 + 2 <= _global_next) || (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1)))) || (((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && ((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 1 <= _global_next) && _global_next == _local__threadpooling_end_1 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_working_1 + 2 <= _global_next) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && (((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) || (((_local__threadpooling_working_0 + 1 <= _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && ((_local__threadpooling_end_1 == _local__threadpooling_i_0 && _local__threadpooling_end_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_end_0 == _global_next)) || (((((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_1 + 2 <= _global_next) - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: (((((_local__threadpooling_end_1 == _local__threadpooling_i_0 && ((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_end_0 == _global_next) || (((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && (!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 + 1 <= _global_next)) || (((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _global_next == _local__threadpooling_end_0 && (((_local__threadpooling_working_0 + 1 <= _global_next && (_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || ((_local__threadpooling_working_0 + 1 <= _global_next && ((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0) || ((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_end_1 == _local__threadpooling_working_0))) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1))) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_1 + 2 <= _global_next)) || (((_local__threadpooling_working_0 + 1 <= _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && ((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0) || (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 == _global_next))) && _local__threadpooling_working_1 + 2 <= _global_next)) || ((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && (((_local__threadpooling_end_0 + 1 <= _local__threadpooling_i_1 && (((((((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) || (((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1))) && _local__threadpooling_end_0 + 1 <= _global_next) || (((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1 && (!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || (((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1)) && _local__threadpooling_i_1 == _local__threadpooling_end_0) && _local__threadpooling_end_0 + 1 <= _global_next))) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: ((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && ((_local__threadpooling_end_0 + 1 <= _local__threadpooling_i_1 && ((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) && _local__threadpooling_end_0 + 1 <= _global_next) || ((((((_local__threadpooling_end_0 == _local__threadpooling_working_1 && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_1 == _local__threadpooling_end_0) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 + 1 <= _global_next)) || (((((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) || ((_local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next)) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0)) || ((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && ((((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) && _local__threadpooling_end_0 + 1 <= _global_next) || ((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && (_global_next == _local__threadpooling_end_0 && (((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && _local__threadpooling_end_1 == _local__threadpooling_working_0) || ((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0))) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_end_0)) || (((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && ((((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0) || ((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_end_1 == _local__threadpooling_working_0)) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || (((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && (_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1))) && _local__threadpooling_working_1 + 2 <= _global_next) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (((((((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || ((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1)) && _local__threadpooling_end_0 + 1 <= _global_next) || (((((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || ((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1)) && _local__threadpooling_working_0 + 2 <= _global_next)) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) || (((((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 1 <= _global_next) && (_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || ((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && ((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 == _local__threadpooling_working_0) || (((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0))) && _local__threadpooling_working_0 + 1 <= _global_next)) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || ((_local__threadpooling_working_1 + 1 <= _global_next && _local__threadpooling_end_1 == _global_next && !(_local__threadpooling_working_1 == _local__threadpooling_working_0)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1)) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || (((_local__threadpooling_working_0 + 1 <= _global_next && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && (((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && _local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0) && !(_local__threadpooling_working_1 == _local__threadpooling_working_0)) || _local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0)) && _local__threadpooling_end_0 == _global_next)) && _local__threadpooling_end_0 + 1 <= _global_next) || (_global_next == _local__threadpooling_end_0 && (((((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || ((_local__threadpooling_working_1 + 1 <= _global_next && _local__threadpooling_end_1 == _global_next && !(_local__threadpooling_working_1 == _local__threadpooling_working_0)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1)) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || (((_local__threadpooling_working_0 + 1 <= _global_next && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && (((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && _local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0) && !(_local__threadpooling_working_1 == _local__threadpooling_working_0)) || _local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0)) && _local__threadpooling_end_0 == _global_next)))) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) || ((((_local__threadpooling_working_0 + 2 <= _global_next && ((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || ((_local__threadpooling_working_1 + 1 <= _global_next && _local__threadpooling_end_1 == _global_next && !(_local__threadpooling_working_1 == _local__threadpooling_working_0)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1))) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 6 error locations. SAFE Result, 65.2s OverallTime, 30 OverallIterations, 2 TraceHistogramMax, 14.4s AutomataDifference, 0.0s DeadEndRemovalTime, 45.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1393 SDtfs, 3055 SDslu, 1633 SDs, 0 SdLazy, 13797 SolverSat, 1756 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 371 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 340 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=267occurred in iteration=16, 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: 3.8s AutomataMinimizationTime, 30 MinimizatonAttempts, 2901 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 189 NumberOfFragments, 2501 HoareAnnotationTreeSize, 16 FomulaSimplifications, 7180967160426309022 FormulaSimplificationTreeSizeReduction, 25.5s HoareSimplificationTime, 16 FomulaSimplificationsInter, 122173963469419134 FormulaSimplificationTreeSizeReductionInter, 20.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 6779 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 11 PerfectInterpolantSequences, 16/66 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out2.mover.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-07-17-046.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out2.mover.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-07-17-046.csv Received shutdown request...