java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 20:06:16,296 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:06:16,298 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:06:16,310 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:06:16,311 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:06:16,312 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:06:16,313 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:06:16,316 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:06:16,318 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:06:16,318 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:06:16,320 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:06:16,320 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:06:16,321 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:06:16,322 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:06:16,323 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:06:16,324 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:06:16,325 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:06:16,327 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:06:16,329 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:06:16,331 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:06:16,333 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:06:16,334 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:06:16,337 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:06:16,337 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:06:16,337 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:06:16,338 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:06:16,339 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:06:16,340 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:06:16,341 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:06:16,342 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:06:16,343 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:06:16,344 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:06:16,344 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:06:16,344 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:06:16,345 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:06:16,346 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:06:16,346 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 20:06:16,370 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:06:16,370 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:06:16,371 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:06:16,371 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:06:16,375 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:06:16,375 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:06:16,375 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:06:16,375 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:06:16,376 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:06:16,376 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:06:16,376 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:06:16,376 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:06:16,377 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:06:16,378 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:06:16,378 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:06:16,378 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:06:16,378 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:06:16,378 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:06:16,379 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:06:16,379 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:06:16,379 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:06:16,379 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:06:16,379 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:06:16,381 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:06:16,381 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:06:16,381 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:06:16,381 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:06:16,381 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:06:16,382 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:06:16,382 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:06:16,433 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:06:16,445 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:06:16,449 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:06:16,451 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:06:16,452 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:06:16,452 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-30 20:06:16,453 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl' [2018-09-30 20:06:16,513 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:06:16,516 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:06:16,517 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:06:16,517 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:06:16,518 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:06:16,540 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 30.09 08:06:16" (1/1) ... [2018-09-30 20:06:16,554 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 30.09 08:06:16" (1/1) ... [2018-09-30 20:06:16,559 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 20:06:16,560 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 20:06:16,560 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 20:06:16,562 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:06:16,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:06:16,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:06:16,564 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:06:16,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:16" (1/1) ... [2018-09-30 20:06:16,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:16" (1/1) ... [2018-09-30 20:06:16,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:16" (1/1) ... [2018-09-30 20:06:16,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:16" (1/1) ... [2018-09-30 20:06:16,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:16" (1/1) ... [2018-09-30 20:06:16,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:16" (1/1) ... [2018-09-30 20:06:16,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:16" (1/1) ... [2018-09-30 20:06:16,588 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:06:16,589 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:06:16,589 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:06:16,589 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:06:16,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:06:16,669 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-30 20:06:16,670 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-30 20:06:16,670 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-30 20:06:17,182 INFO L345 CfgBuilder]: Using library mode [2018-09-30 20:06:17,182 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:06:17 BoogieIcfgContainer [2018-09-30 20:06:17,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:06:17,184 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:06:17,184 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:06:17,188 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:06:17,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:16" (1/2) ... [2018-09-30 20:06:17,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548494cd and model type threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:06:17, skipping insertion in model container [2018-09-30 20:06:17,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:06:17" (2/2) ... [2018-09-30 20:06:17,192 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out2.mover.bpl [2018-09-30 20:06:17,202 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:06:17,210 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-09-30 20:06:17,262 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:06:17,263 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:06:17,263 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:06:17,263 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:06:17,264 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:06:17,264 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:06:17,264 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:06:17,264 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:06:17,264 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:06:17,281 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-09-30 20:06:17,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 20:06:17,288 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:17,289 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 20:06:17,290 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:17,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:17,297 INFO L82 PathProgramCache]: Analyzing trace with hash 28852717, now seen corresponding path program 1 times [2018-09-30 20:06:17,299 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:17,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:17,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:17,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:17,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:17,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:17,522 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:17,522 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:06:17,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:06:17,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:06:17,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-30 20:06:17,545 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 5 states. [2018-09-30 20:06:18,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:18,233 INFO L93 Difference]: Finished difference Result 46 states and 83 transitions. [2018-09-30 20:06:18,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:06:18,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-30 20:06:18,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:18,251 INFO L225 Difference]: With dead ends: 46 [2018-09-30 20:06:18,251 INFO L226 Difference]: Without dead ends: 44 [2018-09-30 20:06:18,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:06:18,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-30 20:06:18,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2018-09-30 20:06:18,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-30 20:06:18,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 56 transitions. [2018-09-30 20:06:18,308 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 56 transitions. Word has length 5 [2018-09-30 20:06:18,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:18,309 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 56 transitions. [2018-09-30 20:06:18,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:06:18,309 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 56 transitions. [2018-09-30 20:06:18,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 20:06:18,310 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:18,310 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 20:06:18,311 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:18,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:18,311 INFO L82 PathProgramCache]: Analyzing trace with hash 32260834, now seen corresponding path program 1 times [2018-09-30 20:06:18,312 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:18,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:18,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:18,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:18,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:18,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:18,480 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:18,481 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:06:18,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:06:18,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:06:18,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-30 20:06:18,483 INFO L87 Difference]: Start difference. First operand 30 states and 56 transitions. Second operand 5 states. [2018-09-30 20:06:19,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:19,324 INFO L93 Difference]: Finished difference Result 75 states and 142 transitions. [2018-09-30 20:06:19,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 20:06:19,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-30 20:06:19,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:19,327 INFO L225 Difference]: With dead ends: 75 [2018-09-30 20:06:19,327 INFO L226 Difference]: Without dead ends: 71 [2018-09-30 20:06:19,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:06:19,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-30 20:06:19,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2018-09-30 20:06:19,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-30 20:06:19,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 113 transitions. [2018-09-30 20:06:19,348 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 113 transitions. Word has length 5 [2018-09-30 20:06:19,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:19,349 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 113 transitions. [2018-09-30 20:06:19,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:06:19,349 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 113 transitions. [2018-09-30 20:06:19,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:06:19,350 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:19,351 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:19,351 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:19,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:19,352 INFO L82 PathProgramCache]: Analyzing trace with hash -737820031, now seen corresponding path program 1 times [2018-09-30 20:06:19,352 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:19,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:19,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:19,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:19,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:19,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:19,502 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:19,502 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:06:19,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:06:19,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:06:19,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:06:19,507 INFO L87 Difference]: Start difference. First operand 52 states and 113 transitions. Second operand 7 states. [2018-09-30 20:06:21,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:21,065 INFO L93 Difference]: Finished difference Result 198 states and 420 transitions. [2018-09-30 20:06:21,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 20:06:21,066 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:06:21,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:21,068 INFO L225 Difference]: With dead ends: 198 [2018-09-30 20:06:21,069 INFO L226 Difference]: Without dead ends: 147 [2018-09-30 20:06:21,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-09-30 20:06:21,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-30 20:06:21,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 89. [2018-09-30 20:06:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-30 20:06:21,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 194 transitions. [2018-09-30 20:06:21,099 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 194 transitions. Word has length 8 [2018-09-30 20:06:21,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:21,099 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 194 transitions. [2018-09-30 20:06:21,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:06:21,099 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 194 transitions. [2018-09-30 20:06:21,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:06:21,100 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:21,101 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:21,101 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:21,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:21,102 INFO L82 PathProgramCache]: Analyzing trace with hash -791588849, now seen corresponding path program 1 times [2018-09-30 20:06:21,102 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:21,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:21,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:21,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:21,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:21,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:21,214 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:21,214 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:06:21,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:06:21,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:06:21,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:06:21,216 INFO L87 Difference]: Start difference. First operand 89 states and 194 transitions. Second operand 7 states. [2018-09-30 20:06:22,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:22,171 INFO L93 Difference]: Finished difference Result 227 states and 433 transitions. [2018-09-30 20:06:22,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:06:22,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:06:22,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:22,178 INFO L225 Difference]: With dead ends: 227 [2018-09-30 20:06:22,178 INFO L226 Difference]: Without dead ends: 223 [2018-09-30 20:06:22,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-09-30 20:06:22,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-09-30 20:06:22,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 112. [2018-09-30 20:06:22,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-09-30 20:06:22,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 252 transitions. [2018-09-30 20:06:22,215 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 252 transitions. Word has length 8 [2018-09-30 20:06:22,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:22,216 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 252 transitions. [2018-09-30 20:06:22,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:06:22,216 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 252 transitions. [2018-09-30 20:06:22,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:06:22,217 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:22,218 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:22,218 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:22,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:22,219 INFO L82 PathProgramCache]: Analyzing trace with hash 558061441, now seen corresponding path program 1 times [2018-09-30 20:06:22,219 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:22,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:22,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:22,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:22,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:22,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:22,301 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:22,301 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:06:22,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:06:22,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:06:22,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:06:22,302 INFO L87 Difference]: Start difference. First operand 112 states and 252 transitions. Second operand 7 states. [2018-09-30 20:06:23,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:23,885 INFO L93 Difference]: Finished difference Result 286 states and 570 transitions. [2018-09-30 20:06:23,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 20:06:23,886 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:06:23,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:23,888 INFO L225 Difference]: With dead ends: 286 [2018-09-30 20:06:23,889 INFO L226 Difference]: Without dead ends: 282 [2018-09-30 20:06:23,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-09-30 20:06:23,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-09-30 20:06:23,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 156. [2018-09-30 20:06:23,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-09-30 20:06:23,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 365 transitions. [2018-09-30 20:06:23,935 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 365 transitions. Word has length 8 [2018-09-30 20:06:23,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:23,936 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 365 transitions. [2018-09-30 20:06:23,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:06:23,936 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 365 transitions. [2018-09-30 20:06:23,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:06:23,938 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:23,938 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:23,938 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:23,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:23,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1066417550, now seen corresponding path program 1 times [2018-09-30 20:06:23,939 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:23,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:23,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:23,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:23,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:24,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:24,042 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:24,042 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:06:24,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:06:24,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:06:24,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:06:24,043 INFO L87 Difference]: Start difference. First operand 156 states and 365 transitions. Second operand 7 states. [2018-09-30 20:06:25,843 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-30 20:06:26,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:26,666 INFO L93 Difference]: Finished difference Result 351 states and 749 transitions. [2018-09-30 20:06:26,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:06:26,667 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:06:26,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:26,670 INFO L225 Difference]: With dead ends: 351 [2018-09-30 20:06:26,670 INFO L226 Difference]: Without dead ends: 347 [2018-09-30 20:06:26,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-09-30 20:06:26,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-09-30 20:06:26,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 202. [2018-09-30 20:06:26,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-09-30 20:06:26,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 490 transitions. [2018-09-30 20:06:26,722 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 490 transitions. Word has length 8 [2018-09-30 20:06:26,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:26,722 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 490 transitions. [2018-09-30 20:06:26,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:06:26,723 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 490 transitions. [2018-09-30 20:06:26,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:06:26,724 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:26,724 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:26,724 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:26,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:26,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1120186368, now seen corresponding path program 1 times [2018-09-30 20:06:26,725 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:26,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:26,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:26,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:26,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:26,891 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 6 [2018-09-30 20:06:26,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:26,942 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:26,942 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:06:26,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:06:26,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:06:26,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:06:26,943 INFO L87 Difference]: Start difference. First operand 202 states and 490 transitions. Second operand 7 states. [2018-09-30 20:06:28,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:28,220 INFO L93 Difference]: Finished difference Result 353 states and 758 transitions. [2018-09-30 20:06:28,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 20:06:28,222 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:06:28,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:28,224 INFO L225 Difference]: With dead ends: 353 [2018-09-30 20:06:28,225 INFO L226 Difference]: Without dead ends: 349 [2018-09-30 20:06:28,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-09-30 20:06:28,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-09-30 20:06:28,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 207. [2018-09-30 20:06:28,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-09-30 20:06:28,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 504 transitions. [2018-09-30 20:06:28,277 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 504 transitions. Word has length 8 [2018-09-30 20:06:28,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:28,278 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 504 transitions. [2018-09-30 20:06:28,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:06:28,278 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 504 transitions. [2018-09-30 20:06:28,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:06:28,279 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:28,279 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-09-30 20:06:28,280 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:28,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:28,280 INFO L82 PathProgramCache]: Analyzing trace with hash -990082056, now seen corresponding path program 1 times [2018-09-30 20:06:28,280 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:28,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:28,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:28,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:28,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:28,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:28,344 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:28,345 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:28,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:28,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:28,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:28,563 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 20:06:28,563 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2018-09-30 20:06:28,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:06:28,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:06:28,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:06:28,564 INFO L87 Difference]: Start difference. First operand 207 states and 504 transitions. Second operand 8 states. [2018-09-30 20:06:30,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:30,054 INFO L93 Difference]: Finished difference Result 396 states and 923 transitions. [2018-09-30 20:06:30,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 20:06:30,057 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:06:30,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:30,058 INFO L225 Difference]: With dead ends: 396 [2018-09-30 20:06:30,059 INFO L226 Difference]: Without dead ends: 242 [2018-09-30 20:06:30,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-09-30 20:06:30,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-09-30 20:06:30,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 202. [2018-09-30 20:06:30,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-09-30 20:06:30,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 479 transitions. [2018-09-30 20:06:30,113 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 479 transitions. Word has length 8 [2018-09-30 20:06:30,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:30,113 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 479 transitions. [2018-09-30 20:06:30,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:06:30,113 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 479 transitions. [2018-09-30 20:06:30,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:06:30,114 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:30,114 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:30,117 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:30,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:30,118 INFO L82 PathProgramCache]: Analyzing trace with hash -990897365, now seen corresponding path program 1 times [2018-09-30 20:06:30,118 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:30,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:30,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:30,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:30,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:30,354 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 6 [2018-09-30 20:06:30,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:30,437 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:30,437 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:06:30,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:06:30,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:06:30,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:06:30,438 INFO L87 Difference]: Start difference. First operand 202 states and 479 transitions. Second operand 7 states. [2018-09-30 20:06:31,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:31,413 INFO L93 Difference]: Finished difference Result 383 states and 823 transitions. [2018-09-30 20:06:31,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:06:31,413 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:06:31,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:31,416 INFO L225 Difference]: With dead ends: 383 [2018-09-30 20:06:31,416 INFO L226 Difference]: Without dead ends: 379 [2018-09-30 20:06:31,416 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-09-30 20:06:31,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-09-30 20:06:31,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 250. [2018-09-30 20:06:31,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-09-30 20:06:31,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 579 transitions. [2018-09-30 20:06:31,482 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 579 transitions. Word has length 8 [2018-09-30 20:06:31,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:31,482 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 579 transitions. [2018-09-30 20:06:31,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:06:31,483 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 579 transitions. [2018-09-30 20:06:31,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 20:06:31,484 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:31,484 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:31,484 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:31,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:31,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1739261140, now seen corresponding path program 1 times [2018-09-30 20:06:31,485 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:31,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:31,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:31,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:31,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:31,580 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-30 20:06:31,581 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:31,581 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:31,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:31,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:31,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:31,641 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 20:06:31,642 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2018-09-30 20:06:31,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:06:31,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:06:31,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:06:31,643 INFO L87 Difference]: Start difference. First operand 250 states and 579 transitions. Second operand 9 states. [2018-09-30 20:06:32,911 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-30 20:06:33,716 WARN L178 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-09-30 20:06:34,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:34,077 INFO L93 Difference]: Finished difference Result 648 states and 1427 transitions. [2018-09-30 20:06:34,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-30 20:06:34,078 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2018-09-30 20:06:34,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:34,081 INFO L225 Difference]: With dead ends: 648 [2018-09-30 20:06:34,081 INFO L226 Difference]: Without dead ends: 399 [2018-09-30 20:06:34,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2018-09-30 20:06:34,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-09-30 20:06:34,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 286. [2018-09-30 20:06:34,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-09-30 20:06:34,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 584 transitions. [2018-09-30 20:06:34,174 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 584 transitions. Word has length 10 [2018-09-30 20:06:34,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:34,174 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 584 transitions. [2018-09-30 20:06:34,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:06:34,175 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 584 transitions. [2018-09-30 20:06:34,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 20:06:34,176 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:34,176 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:34,176 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:34,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:34,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1246182800, now seen corresponding path program 1 times [2018-09-30 20:06:34,177 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:34,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:34,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:34,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:34,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:34,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:34,325 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:34,325 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:06:34,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:06:34,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:06:34,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 20:06:34,326 INFO L87 Difference]: Start difference. First operand 286 states and 584 transitions. Second operand 4 states. [2018-09-30 20:06:34,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:34,571 INFO L93 Difference]: Finished difference Result 471 states and 962 transitions. [2018-09-30 20:06:34,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 20:06:34,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-09-30 20:06:34,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:34,573 INFO L225 Difference]: With dead ends: 471 [2018-09-30 20:06:34,573 INFO L226 Difference]: Without dead ends: 212 [2018-09-30 20:06:34,574 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 20:06:34,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-09-30 20:06:34,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 175. [2018-09-30 20:06:34,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-09-30 20:06:34,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 321 transitions. [2018-09-30 20:06:34,617 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 321 transitions. Word has length 11 [2018-09-30 20:06:34,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:34,618 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 321 transitions. [2018-09-30 20:06:34,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:06:34,618 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 321 transitions. [2018-09-30 20:06:34,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 20:06:34,618 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:34,618 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:34,619 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:34,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:34,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1737860601, now seen corresponding path program 1 times [2018-09-30 20:06:34,619 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:34,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:34,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:34,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:34,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:34,711 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:34,711 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:34,711 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:34,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:34,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:34,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:34,812 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:34,812 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-09-30 20:06:34,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-30 20:06:34,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-30 20:06:34,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-09-30 20:06:34,813 INFO L87 Difference]: Start difference. First operand 175 states and 321 transitions. Second operand 12 states. [2018-09-30 20:06:36,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:36,846 INFO L93 Difference]: Finished difference Result 253 states and 430 transitions. [2018-09-30 20:06:36,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 20:06:36,847 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-09-30 20:06:36,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:36,848 INFO L225 Difference]: With dead ends: 253 [2018-09-30 20:06:36,849 INFO L226 Difference]: Without dead ends: 249 [2018-09-30 20:06:36,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=343, Invalid=847, Unknown=0, NotChecked=0, Total=1190 [2018-09-30 20:06:36,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-09-30 20:06:36,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 121. [2018-09-30 20:06:36,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-30 20:06:36,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 212 transitions. [2018-09-30 20:06:36,895 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 212 transitions. Word has length 11 [2018-09-30 20:06:36,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:36,895 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 212 transitions. [2018-09-30 20:06:36,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-30 20:06:36,895 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 212 transitions. [2018-09-30 20:06:36,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 20:06:36,896 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:36,896 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:36,896 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:36,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:36,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1883568488, now seen corresponding path program 1 times [2018-09-30 20:06:36,897 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:36,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:36,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:36,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:36,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:37,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:37,076 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:37,076 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:37,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:37,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:37,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:37,269 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:37,269 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-09-30 20:06:37,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 20:06:37,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 20:06:37,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-09-30 20:06:37,270 INFO L87 Difference]: Start difference. First operand 121 states and 212 transitions. Second operand 13 states. [2018-09-30 20:06:38,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:38,521 INFO L93 Difference]: Finished difference Result 229 states and 386 transitions. [2018-09-30 20:06:38,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 20:06:38,525 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-09-30 20:06:38,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:38,526 INFO L225 Difference]: With dead ends: 229 [2018-09-30 20:06:38,526 INFO L226 Difference]: Without dead ends: 225 [2018-09-30 20:06:38,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=333, Invalid=857, Unknown=0, NotChecked=0, Total=1190 [2018-09-30 20:06:38,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-09-30 20:06:38,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 79. [2018-09-30 20:06:38,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-30 20:06:38,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 135 transitions. [2018-09-30 20:06:38,572 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 135 transitions. Word has length 11 [2018-09-30 20:06:38,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:38,572 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 135 transitions. [2018-09-30 20:06:38,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 20:06:38,573 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 135 transitions. [2018-09-30 20:06:38,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:06:38,573 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:38,573 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:38,574 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:38,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:38,574 INFO L82 PathProgramCache]: Analyzing trace with hash -496063517, now seen corresponding path program 1 times [2018-09-30 20:06:38,574 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:38,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:38,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:38,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:38,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:38,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:38,665 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:38,665 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:38,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:38,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:38,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:06:38,741 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:38,741 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2018-09-30 20:06:38,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 20:06:38,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 20:06:38,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-09-30 20:06:38,742 INFO L87 Difference]: Start difference. First operand 79 states and 135 transitions. Second operand 11 states. [2018-09-30 20:06:40,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:40,314 INFO L93 Difference]: Finished difference Result 243 states and 409 transitions. [2018-09-30 20:06:40,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-30 20:06:40,314 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2018-09-30 20:06:40,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:40,317 INFO L225 Difference]: With dead ends: 243 [2018-09-30 20:06:40,317 INFO L226 Difference]: Without dead ends: 239 [2018-09-30 20:06:40,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=909, Unknown=0, NotChecked=0, Total=1260 [2018-09-30 20:06:40,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-09-30 20:06:40,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 73. [2018-09-30 20:06:40,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-30 20:06:40,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 125 transitions. [2018-09-30 20:06:40,363 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 125 transitions. Word has length 13 [2018-09-30 20:06:40,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:40,364 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 125 transitions. [2018-09-30 20:06:40,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 20:06:40,364 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 125 transitions. [2018-09-30 20:06:40,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:06:40,364 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:40,364 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:40,364 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:40,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:40,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1936277035, now seen corresponding path program 1 times [2018-09-30 20:06:40,365 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:40,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:40,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:40,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:40,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:40,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:40,439 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:40,439 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:40,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:40,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:40,483 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:06:40,505 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:40,505 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2018-09-30 20:06:40,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:06:40,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:06:40,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:06:40,506 INFO L87 Difference]: Start difference. First operand 73 states and 125 transitions. Second operand 9 states. [2018-09-30 20:06:41,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:41,579 INFO L93 Difference]: Finished difference Result 202 states and 340 transitions. [2018-09-30 20:06:41,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 20:06:41,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-09-30 20:06:41,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:41,581 INFO L225 Difference]: With dead ends: 202 [2018-09-30 20:06:41,581 INFO L226 Difference]: Without dead ends: 198 [2018-09-30 20:06:41,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=197, Invalid=453, Unknown=0, NotChecked=0, Total=650 [2018-09-30 20:06:41,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-09-30 20:06:41,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 58. [2018-09-30 20:06:41,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-09-30 20:06:41,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 100 transitions. [2018-09-30 20:06:41,626 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 100 transitions. Word has length 13 [2018-09-30 20:06:41,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:41,627 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 100 transitions. [2018-09-30 20:06:41,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:06:41,627 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 100 transitions. [2018-09-30 20:06:41,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:06:41,627 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:41,628 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:41,628 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:41,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:41,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1990045853, now seen corresponding path program 1 times [2018-09-30 20:06:41,628 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:41,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:41,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:41,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:41,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:41,707 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:41,707 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:41,707 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:41,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:41,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:41,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:06:41,791 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:41,791 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-09-30 20:06:41,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 20:06:41,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 20:06:41,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-09-30 20:06:41,792 INFO L87 Difference]: Start difference. First operand 58 states and 100 transitions. Second operand 10 states. [2018-09-30 20:06:43,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:43,070 INFO L93 Difference]: Finished difference Result 188 states and 317 transitions. [2018-09-30 20:06:43,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 20:06:43,070 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-09-30 20:06:43,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:43,071 INFO L225 Difference]: With dead ends: 188 [2018-09-30 20:06:43,071 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 20:06:43,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=236, Invalid=576, Unknown=0, NotChecked=0, Total=812 [2018-09-30 20:06:43,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 20:06:43,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 20:06:43,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 20:06:43,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 20:06:43,073 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-09-30 20:06:43,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:43,073 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 20:06:43,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 20:06:43,073 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 20:06:43,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 20:06:43,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 20:06:43,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:43,415 WARN L178 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 136 [2018-09-30 20:06:43,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:43,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:43,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:43,745 WARN L178 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 130 [2018-09-30 20:06:43,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:43,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:43,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:43,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:44,744 WARN L178 SmtUtils]: Spent 998.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 132 [2018-09-30 20:06:44,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:44,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:44,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:44,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:44,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:44,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:45,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:45,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:45,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:45,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:45,249 WARN L178 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 281 DAG size of output: 190 [2018-09-30 20:06:45,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:45,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:45,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:45,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:45,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:45,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:45,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:45,895 WARN L178 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 285 DAG size of output: 222 [2018-09-30 20:06:46,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:46,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:46,545 WARN L178 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 129 [2018-09-30 20:06:46,654 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 130 [2018-09-30 20:06:46,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:46,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:46,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:46,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:47,180 WARN L178 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 284 DAG size of output: 207 [2018-09-30 20:06:47,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:47,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:47,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:47,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:47,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:47,546 WARN L178 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 212 [2018-09-30 20:06:47,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:47,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:47,737 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 114 [2018-09-30 20:06:47,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:47,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:47,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:48,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:48,132 WARN L178 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 292 DAG size of output: 217 [2018-09-30 20:06:48,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:48,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:48,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:48,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:48,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:48,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:48,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:48,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:48,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:48,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:48,330 WARN L178 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 149 [2018-09-30 20:06:48,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:48,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:48,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:48,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:48,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:48,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:48,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:48,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:48,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:48,624 WARN L178 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 165 [2018-09-30 20:06:48,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:49,017 WARN L178 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 165 [2018-09-30 20:06:49,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:49,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:49,220 WARN L178 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 148 [2018-09-30 20:06:50,267 WARN L178 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 133 DAG size of output: 40 [2018-09-30 20:06:51,027 WARN L178 SmtUtils]: Spent 757.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 39 [2018-09-30 20:06:52,204 WARN L178 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 127 DAG size of output: 40 [2018-09-30 20:06:53,888 WARN L178 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 177 DAG size of output: 66 [2018-09-30 20:06:55,334 WARN L178 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 205 DAG size of output: 52 [2018-09-30 20:06:56,332 WARN L178 SmtUtils]: Spent 995.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 44 [2018-09-30 20:06:57,073 WARN L178 SmtUtils]: Spent 739.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 36 [2018-09-30 20:06:58,869 WARN L178 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 199 DAG size of output: 56 [2018-09-30 20:07:01,954 WARN L178 SmtUtils]: Spent 3.08 s on a formula simplification. DAG size of input: 198 DAG size of output: 82 [2018-09-30 20:07:02,495 WARN L178 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 34 [2018-09-30 20:07:04,699 WARN L178 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 210 DAG size of output: 76 [2018-09-30 20:07:06,148 WARN L178 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 137 DAG size of output: 54 [2018-09-30 20:07:07,606 WARN L178 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 149 DAG size of output: 52 [2018-09-30 20:07:08,878 WARN L178 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 165 DAG size of output: 39 [2018-09-30 20:07:09,571 WARN L178 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 35 [2018-09-30 20:07:09,575 INFO L422 ceAbstractionStarter]: At program point L192(lines 72 210) the Hoare annotation is: (let ((.cse14 (+ product__local__threadpooling_i_1 1)) (.cse10 (+ product__local__threadpooling_working_1 1)) (.cse13 (+ product__local__threadpooling_working_0 2))) (let ((.cse4 (+ product__local__threadpooling_i_0 2)) (.cse3 (<= .cse13 product__local__threadpooling_working_1)) (.cse2 (= product__local__threadpooling_end_1 product__global_next)) (.cse6 (<= .cse10 product__local__threadpooling_end_1)) (.cse5 (<= .cse14 product__global_next)) (.cse12 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse1 (<= product__local__threadpooling_end_0 (+ product__local__threadpooling_i_0 1))) (.cse0 (<= product__local__threadpooling_end_1 .cse14)) (.cse9 (= product__local__threadpooling_end_0 product__global_next)) (.cse11 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_end_0))) (or (and (and (= product__local__threadpooling_end_0 product__local__threadpooling_i_1) (= product__local__threadpooling_end_0 product__local__threadpooling_working_1) .cse0 .cse1 .cse2 .cse3) (<= .cse4 product__global_next)) (and .cse0 (<= .cse4 product__local__threadpooling_working_1) .cse1 .cse5 .cse2 .cse6 .cse3) (let ((.cse8 (and (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0) (and .cse12 .cse5 (not (= product__local__threadpooling_working_1 product__global_next))))) (.cse7 (+ product__local__threadpooling_working_0 1))) (or (and (<= .cse7 product__global_next) (and .cse2 .cse8 .cse0 .cse6)) (and .cse9 (and (<= .cse10 product__global_next) .cse0 (and .cse8 .cse11)) (<= .cse7 product__local__threadpooling_end_0)))) (and (and (and (and (and .cse12 .cse1) .cse0) (<= (+ product__local__threadpooling_working_1 2) product__global_next)) (<= .cse13 product__global_next)) .cse9 .cse11)))) [2018-09-30 20:07:09,575 INFO L426 ceAbstractionStarter]: For program point productErr3ASSERT_VIOLATIONASSERT(line 176) no Hoare annotation was computed. [2018-09-30 20:07:09,576 INFO L422 ceAbstractionStarter]: At program point L209(lines 50 209) the Hoare annotation is: (let ((.cse3 (+ product__local__threadpooling_i_1 1)) (.cse6 (+ product__local__threadpooling_working_1 1))) (let ((.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse2 (<= .cse6 product__local__threadpooling_end_1)) (.cse1 (<= product__local__threadpooling_end_1 .cse3)) (.cse5 (and (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0) (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= .cse3 product__global_next) (not (= product__local__threadpooling_working_1 product__global_next))))) (.cse4 (+ product__local__threadpooling_working_0 1))) (or (and .cse0 .cse1 .cse2 (<= .cse3 product__local__threadpooling_end_1) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_working_1)) (and (<= .cse4 product__global_next) (and .cse5 .cse0 .cse1 .cse2)) (and (and (<= .cse6 product__global_next) .cse1 (and .cse5 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_end_0))) (= product__local__threadpooling_end_0 product__global_next) (<= .cse4 product__local__threadpooling_end_0))))) [2018-09-30 20:07:09,576 INFO L422 ceAbstractionStarter]: At program point L234(lines 97 234) the Hoare annotation is: (let ((.cse15 (+ product__local__threadpooling_i_0 1)) (.cse13 (+ product__local__threadpooling_working_1 1)) (.cse10 (+ product__local__threadpooling_working_1 2)) (.cse14 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0))) (let ((.cse4 (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) .cse14 (not (= product__local__threadpooling_working_1 product__global_next)))) (.cse7 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse9 (<= .cse10 product__global_next)) (.cse5 (= product__local__threadpooling_end_0 product__global_next)) (.cse1 (+ product__local__threadpooling_working_0 1)) (.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse2 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse3 (<= .cse13 product__local__threadpooling_end_1)) (.cse12 (<= .cse15 product__global_next)) (.cse8 (<= product__local__threadpooling_end_0 .cse15)) (.cse11 (+ product__local__threadpooling_working_0 2))) (or (and .cse0 (<= .cse1 product__global_next) .cse2 .cse3 .cse4) (and (let ((.cse6 (<= .cse11 product__global_next))) (or (and .cse5 .cse6 (and .cse7 .cse2 .cse8 .cse9)) (and (<= .cse10 product__local__threadpooling_i_0) .cse5 .cse8 .cse6))) .cse12) (and (or (and (<= .cse13 product__global_next) (and (<= (+ product__local__threadpooling_i_1 1) product__global_next) .cse4) .cse2) (and (<= .cse10 product__local__threadpooling_working_0) .cse14) (and .cse14 .cse7 .cse2 .cse9)) .cse5 (<= .cse1 product__local__threadpooling_end_0)) (and .cse0 .cse2 .cse3 .cse12 .cse8 (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) (<= .cse11 product__local__threadpooling_working_1))))) [2018-09-30 20:07:09,576 INFO L426 ceAbstractionStarter]: For program point productENTRY(lines 3 236) no Hoare annotation was computed. [2018-09-30 20:07:09,576 INFO L426 ceAbstractionStarter]: For program point productFINAL(lines 3 236) no Hoare annotation was computed. [2018-09-30 20:07:09,577 INFO L422 ceAbstractionStarter]: At program point L119(lines 119 124) the Hoare annotation is: (let ((.cse5 (+ product__local__threadpooling_i_0 1))) (let ((.cse2 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse1 (<= product__local__threadpooling_end_0 .cse5)) (.cse4 (<= .cse5 product__local__threadpooling_end_0)) (.cse3 (+ product__local__threadpooling_working_0 2))) (or (and (let ((.cse0 (+ product__local__threadpooling_working_1 2))) (or (and (<= .cse0 product__local__threadpooling_i_0) .cse1) (and (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) .cse2 .cse1 (<= .cse0 product__global_next)))) (= product__local__threadpooling_end_0 product__global_next) (<= .cse3 product__global_next) .cse4) (and (= product__local__threadpooling_end_1 product__global_next) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) .cse2 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) (<= .cse5 product__global_next) .cse1 .cse4 (<= .cse3 product__local__threadpooling_working_1))))) [2018-09-30 20:07:09,577 INFO L422 ceAbstractionStarter]: At program point L95(lines 95 190) the Hoare annotation is: (let ((.cse5 (+ product__local__threadpooling_working_0 2))) (let ((.cse21 (+ product__local__threadpooling_i_1 1)) (.cse16 (+ product__local__threadpooling_i_0 1)) (.cse18 (+ product__local__threadpooling_working_1 2)) (.cse13 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse10 (<= .cse5 product__local__threadpooling_i_1)) (.cse15 (<= .cse5 product__global_next))) (let ((.cse1 (<= (+ product__local__threadpooling_i_0 2) product__global_next)) (.cse9 (or (and .cse13 .cse10 .cse15) (and .cse10 (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) .cse15))) (.cse7 (<= .cse18 product__local__threadpooling_i_0)) (.cse2 (<= product__local__threadpooling_end_0 .cse16)) (.cse12 (= product__local__threadpooling_end_0 product__global_next)) (.cse17 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_end_0)) (.cse4 (= product__local__threadpooling_end_1 product__global_next)) (.cse0 (<= product__local__threadpooling_end_1 .cse21)) (.cse6 (<= .cse18 product__global_next)) (.cse14 (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1))) (.cse11 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse3 (<= .cse21 product__local__threadpooling_end_1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 product__local__threadpooling_working_1) .cse6) (and (let ((.cse8 (= product__local__threadpooling_end_0 product__local__threadpooling_i_1))) (or (and .cse7 .cse4 .cse0 (and (and .cse8 .cse9) .cse2)) (and .cse10 (and .cse4 .cse0 (and (and .cse8 .cse11) .cse2) .cse6)))) .cse1) (and .cse12 (or (and (and (and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) .cse9) .cse2) .cse7 .cse0) (and (and .cse7 (and .cse13 .cse2) .cse0 .cse14) .cse15 (<= .cse16 product__local__threadpooling_end_0))) .cse17) (let ((.cse19 (let ((.cse20 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0))) (or (and .cse20 (and .cse13 (<= .cse21 product__global_next)) .cse14) (and .cse20 .cse11 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0) (<= .cse21 product__local__threadpooling_i_0) .cse3))))) (or (and (<= .cse18 product__local__threadpooling_working_0) .cse0 .cse12 (and .cse19 .cse17) (<= (+ product__local__threadpooling_working_0 1) product__local__threadpooling_end_0)) (and (and .cse4 .cse0 .cse19 .cse6) .cse15))))))) [2018-09-30 20:07:09,577 INFO L426 ceAbstractionStarter]: For program point productErr1ASSERT_VIOLATIONASSERT(line 82) no Hoare annotation was computed. [2018-09-30 20:07:09,577 INFO L422 ceAbstractionStarter]: At program point L203(lines 143 203) the Hoare annotation is: (let ((.cse4 (+ product__local__threadpooling_i_0 1)) (.cse10 (+ product__local__threadpooling_working_1 2))) (let ((.cse6 (= product__local__threadpooling_end_0 product__global_next)) (.cse7 (= product__local__threadpooling_i_0 product__local__threadpooling_working_0)) (.cse9 (<= .cse10 product__local__threadpooling_working_0)) (.cse8 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse2 (<= product__local__threadpooling_end_0 .cse4)) (.cse3 (<= .cse4 product__local__threadpooling_end_0)) (.cse5 (<= .cse10 product__global_next))) (or (let ((.cse1 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1))) (or (and (<= (+ product__local__threadpooling_working_0 1) product__global_next) (and .cse0 .cse1 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) (and (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) .cse2) .cse3)) (<= .cse4 product__global_next)) (and (and (and .cse1 .cse2 .cse3) .cse5) .cse6 .cse7))) (and .cse8 .cse6 .cse2 .cse7 .cse9 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_working_0) .cse3) (and .cse8 .cse6 .cse2 .cse7 .cse9 (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) .cse3) (and (and (and .cse8 (and (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) .cse0) .cse2 .cse3 .cse5) (<= (+ product__local__threadpooling_working_0 2) product__global_next)) (<= (+ product__local__threadpooling_i_0 2) product__global_next))))) [2018-09-30 20:07:09,577 INFO L422 ceAbstractionStarter]: At program point L154(lines 154 159) the Hoare annotation is: (let ((.cse4 (+ product__local__threadpooling_i_0 1))) (let ((.cse6 (<= product__local__threadpooling_end_0 .cse4)) (.cse5 (+ product__local__threadpooling_i_1 1))) (let ((.cse3 (+ product__local__threadpooling_working_1 2)) (.cse0 (<= product__local__threadpooling_end_1 .cse5)) (.cse1 (and (<= .cse5 product__global_next) .cse6)) (.cse2 (<= .cse4 product__local__threadpooling_end_0))) (or (and (and (= product__local__threadpooling_end_1 product__global_next) .cse0 (and .cse1 .cse2) (<= .cse3 product__global_next)) (<= .cse4 product__global_next) (<= (+ product__local__threadpooling_working_0 2) product__global_next)) (and (<= .cse3 product__local__threadpooling_i_0) (= product__local__threadpooling_end_0 product__global_next) (or (and (and (and (= product__local__threadpooling_end_1 product__local__threadpooling_working_0) (<= .cse5 product__local__threadpooling_end_1)) .cse6) .cse0) (and .cse0 .cse1 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_i_0))) (= product__local__threadpooling_i_0 product__local__threadpooling_working_0) .cse2))))) [2018-09-30 20:07:09,578 INFO L422 ceAbstractionStarter]: At program point L121(lines 17 229) the Hoare annotation is: (let ((.cse7 (+ product__local__threadpooling_working_1 2)) (.cse8 (+ product__local__threadpooling_working_1 1))) (let ((.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse2 (<= .cse8 product__local__threadpooling_end_1)) (.cse1 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse3 (<= .cse7 product__global_next))) (or (and (or (and .cse0 .cse1 .cse2) .cse3) (<= (+ product__local__threadpooling_working_0 2) product__global_next)) (let ((.cse5 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse4 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse6 (+ product__local__threadpooling_working_0 1))) (or (and .cse4 .cse5 .cse0 (<= .cse6 product__global_next) .cse1 .cse2) (and (or (and (<= .cse7 product__local__threadpooling_working_0) .cse4) (and (<= .cse8 product__global_next) .cse1 (and .cse4 (<= (+ product__local__threadpooling_i_1 1) product__global_next) .cse5)) (and .cse4 .cse1 .cse3)) (= product__local__threadpooling_end_0 product__global_next) (<= .cse6 product__local__threadpooling_end_0))))))) [2018-09-30 20:07:09,578 INFO L422 ceAbstractionStarter]: At program point L196(lines 196 201) the Hoare annotation is: (let ((.cse15 (+ product__local__threadpooling_i_0 1)) (.cse19 (+ product__local__threadpooling_i_1 1)) (.cse9 (+ product__local__threadpooling_working_1 2)) (.cse20 (+ product__local__threadpooling_working_0 2))) (let ((.cse8 (+ product__local__threadpooling_i_1 2)) (.cse2 (= product__local__threadpooling_end_0 product__global_next)) (.cse3 (<= .cse20 product__global_next)) (.cse4 (<= .cse20 product__local__threadpooling_i_1)) (.cse5 (<= .cse9 product__local__threadpooling_i_0)) (.cse0 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse6 (<= product__local__threadpooling_end_1 .cse19)) (.cse14 (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))) (.cse7 (<= product__local__threadpooling_end_0 .cse15)) (.cse13 (= product__local__threadpooling_end_1 product__global_next)) (.cse10 (<= .cse15 product__local__threadpooling_end_0)) (.cse16 (<= .cse20 product__local__threadpooling_working_1)) (.cse12 (<= .cse9 product__global_next))) (or (and (let ((.cse1 (and .cse5 .cse6 (and .cse7 (= product__local__threadpooling_end_1 product__local__threadpooling_i_0))))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2))) (<= .cse8 product__local__threadpooling_end_0)) (and (and (<= .cse9 product__local__threadpooling_working_0) (and .cse2 .cse7) .cse6) .cse3 .cse10 (<= .cse8 product__local__threadpooling_i_0)) (let ((.cse11 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1))) (or (and .cse2 (and .cse0 .cse11 .cse7 .cse12) .cse3 .cse10) (and .cse13 .cse14 .cse11 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) (<= .cse15 product__global_next) .cse7 .cse10 .cse16))) (let ((.cse18 (<= .cse19 product__local__threadpooling_end_1))) (or (and (and .cse4 (let ((.cse17 (= product__local__threadpooling_end_0 product__local__threadpooling_i_1))) (or (and .cse5 .cse13 .cse6 (and .cse17 .cse7) .cse18) (and .cse17 .cse0 .cse13 .cse6 .cse14 .cse7 .cse18 .cse12)))) (<= (+ product__local__threadpooling_end_1 product__local__threadpooling_i_0 1) (+ product__global_next product__local__threadpooling_i_1))) (and (<= (+ product__local__threadpooling_i_0 2) product__local__threadpooling_i_1) .cse6 (and .cse14 .cse18) .cse7 .cse13 .cse10 .cse16 .cse12)))))) [2018-09-30 20:07:09,578 INFO L426 ceAbstractionStarter]: For program point productErr4ASSERT_VIOLATIONASSERT(line 181) no Hoare annotation was computed. [2018-09-30 20:07:09,578 INFO L426 ceAbstractionStarter]: For program point productErr5ASSERT_VIOLATIONASSERT(line 186) no Hoare annotation was computed. [2018-09-30 20:07:09,578 INFO L426 ceAbstractionStarter]: For program point productEXIT(lines 3 236) no Hoare annotation was computed. [2018-09-30 20:07:09,579 INFO L422 ceAbstractionStarter]: At program point L156(lines 126 185) the Hoare annotation is: (let ((.cse3 (+ product__local__threadpooling_i_0 1))) (let ((.cse0 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse1 (<= product__local__threadpooling_end_0 .cse3)) (.cse2 (<= .cse3 product__local__threadpooling_end_0))) (or (and (<= (+ product__local__threadpooling_working_0 1) product__global_next) (and (= product__local__threadpooling_end_1 product__global_next) .cse0 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) (and (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) .cse1) .cse2)) (<= .cse3 product__global_next)) (and (let ((.cse4 (+ product__local__threadpooling_working_1 2))) (or (and .cse1 .cse0 (<= .cse4 product__global_next)) (and (<= .cse4 product__local__threadpooling_i_0) .cse1))) (= product__local__threadpooling_end_0 product__global_next) (= product__local__threadpooling_i_0 product__local__threadpooling_working_0) .cse2)))) [2018-09-30 20:07:09,579 INFO L426 ceAbstractionStarter]: For program point productErr0ASSERT_VIOLATIONASSERT(line 60) no Hoare annotation was computed. [2018-09-30 20:07:09,579 INFO L422 ceAbstractionStarter]: At program point L214(lines 161 214) the Hoare annotation is: (let ((.cse4 (+ product__local__threadpooling_i_0 1)) (.cse0 (+ product__local__threadpooling_i_1 1))) (let ((.cse3 (+ product__local__threadpooling_working_1 1)) (.cse2 (<= product__local__threadpooling_end_1 .cse0)) (.cse1 (<= product__local__threadpooling_end_0 .cse4)) (.cse5 (<= .cse4 product__local__threadpooling_end_0))) (or (and (= product__local__threadpooling_end_1 product__global_next) (and (<= .cse0 product__global_next) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) .cse1) .cse2 (<= .cse3 product__local__threadpooling_end_1) (<= .cse4 product__global_next) (<= (+ product__local__threadpooling_working_0 2) product__global_next) .cse5) (and (= product__local__threadpooling_end_0 product__global_next) (and (<= .cse3 product__global_next) (and .cse2 .cse1 (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) (<= .cse0 product__local__threadpooling_i_0)))) (= product__local__threadpooling_i_0 product__local__threadpooling_working_0) .cse5)))) [2018-09-30 20:07:09,579 INFO L422 ceAbstractionStarter]: At program point L198(lines 32 219) the Hoare annotation is: (let ((.cse14 (+ product__local__threadpooling_working_0 1)) (.cse7 (+ product__local__threadpooling_i_1 1)) (.cse15 (+ product__local__threadpooling_working_1 2))) (let ((.cse3 (<= .cse15 product__local__threadpooling_working_0)) (.cse1 (<= product__local__threadpooling_end_1 .cse7)) (.cse6 (+ product__local__threadpooling_working_0 2)) (.cse2 (= product__local__threadpooling_end_0 product__global_next)) (.cse8 (<= .cse15 product__global_next)) (.cse4 (<= .cse14 product__local__threadpooling_end_0)) (.cse0 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse9 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse5 (= product__local__threadpooling_end_1 product__global_next)) (.cse10 (<= .cse14 product__global_next))) (or (and .cse0 .cse1 .cse2 .cse3 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_working_0) .cse4) (and .cse5 (<= .cse6 product__local__threadpooling_i_1) .cse1 (<= .cse7 product__local__threadpooling_end_1) .cse8) (and .cse3 (and .cse0 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) .cse1 .cse2 .cse4) (and (and (and .cse9 .cse5) .cse0 .cse1 (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1)) .cse8) .cse10) (let ((.cse13 (+ product__local__threadpooling_working_1 1))) (let ((.cse11 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse12 (<= .cse13 product__local__threadpooling_end_1))) (or (and .cse5 .cse11 .cse12 (<= .cse6 product__local__threadpooling_working_1)) (and .cse2 (or (and (and .cse0 (<= .cse7 product__global_next) .cse9 .cse11) (<= .cse13 product__global_next)) (and .cse0 .cse9 .cse11 .cse8)) .cse4) (and .cse0 .cse9 .cse5 .cse10 .cse11 .cse12))))))) [2018-09-30 20:07:09,579 INFO L422 ceAbstractionStarter]: At program point L207(lines 207 212) the Hoare annotation is: (let ((.cse7 (+ product__local__threadpooling_i_0 1)) (.cse4 (+ product__local__threadpooling_i_1 1)) (.cse6 (+ product__local__threadpooling_working_0 2))) (let ((.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse5 (<= .cse6 product__local__threadpooling_working_1)) (.cse1 (<= product__local__threadpooling_end_1 .cse4)) (.cse2 (<= product__local__threadpooling_end_0 .cse7)) (.cse3 (<= .cse7 product__local__threadpooling_end_0))) (or (and (<= (+ product__local__threadpooling_i_0 2) product__local__threadpooling_working_1) (and .cse0 .cse1 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) .cse2 .cse3 (<= .cse4 product__local__threadpooling_end_1) .cse5)) (or (and .cse0 .cse1 .cse2 (and (= product__local__threadpooling_end_0 product__local__threadpooling_i_1) (= product__local__threadpooling_end_0 product__local__threadpooling_working_1) (<= .cse4 product__global_next)) .cse3 .cse5) (and (and (and .cse1 .cse2 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_end_0)) (<= (+ product__local__threadpooling_working_1 2) product__global_next)) (= product__local__threadpooling_end_0 product__global_next) (<= .cse6 product__global_next) .cse3))))) [2018-09-30 20:07:09,580 INFO L422 ceAbstractionStarter]: At program point L224(lines 84 224) the Hoare annotation is: (let ((.cse11 (+ product__local__threadpooling_working_1 1)) (.cse14 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse7 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse3 (+ product__local__threadpooling_i_0 1)) (.cse12 (+ product__local__threadpooling_i_1 1)) (.cse28 (+ product__local__threadpooling_working_0 1)) (.cse27 (+ product__local__threadpooling_i_1 2)) (.cse29 (+ product__local__threadpooling_working_1 2)) (.cse30 (+ product__local__threadpooling_working_0 2))) (let ((.cse20 (<= (+ product__local__threadpooling_i_0 2) product__global_next)) (.cse5 (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))) (.cse6 (<= .cse30 product__local__threadpooling_working_1)) (.cse8 (<= .cse29 product__global_next)) (.cse10 (<= .cse30 product__global_next)) (.cse24 (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1))) (.cse19 (<= .cse29 product__local__threadpooling_i_0)) (.cse16 (<= .cse30 product__local__threadpooling_i_1)) (.cse22 (<= .cse27 product__local__threadpooling_working_0)) (.cse15 (<= .cse28 product__local__threadpooling_end_0)) (.cse18 (<= product__local__threadpooling_end_1 .cse12)) (.cse23 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) (.cse9 (= product__local__threadpooling_end_0 product__global_next)) (.cse4 (<= product__local__threadpooling_end_0 .cse3)) (.cse21 (<= .cse29 product__local__threadpooling_working_0)) (.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse25 (<= .cse28 product__global_next)) (.cse13 (and .cse14 .cse7 (not (= product__local__threadpooling_working_1 product__global_next)))) (.cse1 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse2 (<= .cse11 product__local__threadpooling_end_1))) (or (and .cse0 .cse1 .cse2 (<= .cse3 product__global_next) .cse4 .cse5 .cse6) (and (and .cse7 .cse1 .cse4 .cse8) .cse9 .cse10) (and (or (and (<= .cse11 product__global_next) (and (<= .cse12 product__global_next) .cse13 .cse1)) (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) .cse14 .cse1 .cse8)) .cse9 .cse15) (and (and .cse16 (let ((.cse17 (= product__local__threadpooling_end_0 product__local__threadpooling_i_1))) (or (and .cse17 .cse7 .cse0 .cse18 .cse5 .cse4 .cse8) (and .cse17 .cse19 .cse0 .cse18 .cse4)))) .cse20) (and .cse18 .cse20 .cse4 (and .cse0 .cse5) .cse6 .cse8) (and .cse18 .cse9 .cse4 .cse10 .cse21 .cse22) (and .cse14 .cse18 .cse23 .cse9 .cse21 .cse15) (and (and .cse18 (and .cse14 .cse7 .cse0) .cse24 .cse8) .cse25) (and (let ((.cse26 (= product__local__threadpooling_end_1 product__local__threadpooling_i_0))) (or (and .cse19 .cse18 .cse9 .cse10 .cse4 .cse24 .cse7 .cse26) (and .cse19 .cse18 .cse9 .cse4 .cse16 .cse26))) (<= .cse27 product__local__threadpooling_end_0)) (and .cse14 .cse18 .cse9 .cse21 .cse22 .cse15) (and .cse18 .cse23 .cse9 .cse4 (<= .cse27 product__local__threadpooling_i_0) .cse21 (<= .cse3 product__local__threadpooling_end_0)) (and .cse0 .cse25 .cse13 .cse1 .cse2)))) [2018-09-30 20:07:09,580 INFO L426 ceAbstractionStarter]: For program point productErr2ASSERT_VIOLATIONASSERT(line 171) no Hoare annotation was computed. [2018-09-30 20:07:09,580 INFO L422 ceAbstractionStarter]: At program point L43(lines 43 48) the Hoare annotation is: (let ((.cse7 (+ product__local__threadpooling_i_1 1))) (let ((.cse4 (+ product__local__threadpooling_working_1 2)) (.cse2 (<= .cse7 product__local__threadpooling_end_1))) (let ((.cse6 (+ product__local__threadpooling_working_0 1)) (.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse1 (<= product__local__threadpooling_end_1 .cse7)) (.cse5 (and (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0) (or (and (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= .cse7 product__global_next)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1))) (and (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) (= product__local__threadpooling_end_1 product__local__threadpooling_working_0) .cse2)))) (.cse3 (<= .cse4 product__global_next))) (or (and .cse0 (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_1) .cse1 .cse2 .cse3) (and (<= .cse4 product__local__threadpooling_working_0) .cse1 (and (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_end_0) .cse5) (= product__local__threadpooling_end_0 product__global_next) (<= .cse6 product__local__threadpooling_end_0)) (and (<= .cse6 product__global_next) (and .cse0 .cse1 .cse5 .cse3)))))) [2018-09-30 20:07:09,626 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:07:09 BoogieIcfgContainer [2018-09-30 20:07:09,626 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:07:09,627 INFO L168 Benchmark]: Toolchain (without parser) took 53113.75 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 526.9 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 276.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-09-30 20:07:09,628 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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-30 20:07:09,629 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.61 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-30 20:07:09,629 INFO L168 Benchmark]: Boogie Preprocessor took 25.18 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-30 20:07:09,630 INFO L168 Benchmark]: RCFGBuilder took 593.99 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-30 20:07:09,630 INFO L168 Benchmark]: TraceAbstraction took 52442.28 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 526.9 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 254.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-09-30 20:07:09,634 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.19 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 45.61 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 25.18 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 593.99 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 52442.28 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 526.9 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 254.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 60]: 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: 186]: 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: 171]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 181]: 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: 207]: Loop Invariant Derived loop invariant: (_local__threadpooling_i_0 + 2 <= _local__threadpooling_working_1 && (((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1) || (((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && (_local__threadpooling_end_0 == _local__threadpooling_i_1 && _local__threadpooling_end_0 == _local__threadpooling_working_1) && _local__threadpooling_i_1 + 1 <= _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1) || ((((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_end_0) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) - InvariantResult [Line: 154]: Loop Invariant Derived loop invariant: (((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && (_local__threadpooling_i_1 + 1 <= _global_next && _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_i_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) || ((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_0 == _global_next) && ((((_local__threadpooling_end_1 == _local__threadpooling_working_0 && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) || ((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _local__threadpooling_i_1 + 1 <= _global_next && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_i_0))) && _local__threadpooling_i_0 == _local__threadpooling_working_0) && _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_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) || _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_working_0 + 2 <= _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_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) || (((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_end_0 <= _local__threadpooling_i_0) || ((_local__threadpooling_working_1 + 1 <= _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && (_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_i_1 + 1 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1))) || ((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 2 <= _global_next)) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: (((((((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && (_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1 && _local__threadpooling_end_1 == _local__threadpooling_i_0) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) || ((_local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1 && (_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1 && _local__threadpooling_end_1 == _local__threadpooling_i_0) && _local__threadpooling_end_0 == _global_next)) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_end_0) || (((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_end_0 == _global_next && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_i_0)) || (((_local__threadpooling_end_0 == _global_next && ((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) || (((((((_local__threadpooling_end_1 == _global_next && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_i_0 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1)) || ((_local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1 && (((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 == _local__threadpooling_i_1 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1) || (((((((_local__threadpooling_end_0 == _local__threadpooling_i_1 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_working_1 + 2 <= _global_next))) && _local__threadpooling_end_1 + _local__threadpooling_i_0 + 1 <= _global_next + _local__threadpooling_i_1) || (((((((_local__threadpooling_i_0 + 2 <= _local__threadpooling_i_1 && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1) && _local__threadpooling_working_1 + 2 <= _global_next) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: (((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_working_1 + 2 <= _global_next) || ((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_end_0 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 && (((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_i_1 + 1 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_i_1)) || ((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _local__threadpooling_working_0) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1))) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0)) || (_local__threadpooling_working_0 + 1 <= _global_next && ((_local__threadpooling_end_1 == _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 && (((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_i_1 + 1 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_i_1)) || ((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _local__threadpooling_working_0) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1))) && _local__threadpooling_working_1 + 2 <= _global_next) - InvariantResult [Line: 143]: Loop Invariant Derived loop invariant: (((((_local__threadpooling_working_0 + 1 <= _global_next && ((_local__threadpooling_end_1 == _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && (!(_local__threadpooling_working_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_i_0 + 1 <= _global_next) || (((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 && _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_end_0 == _global_next) && _local__threadpooling_i_0 == _local__threadpooling_working_0)) || ((((((_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_i_0 == _local__threadpooling_working_0) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0)) || ((((((_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_i_0 == _local__threadpooling_working_0) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_end_1 == _local__threadpooling_i_0) && _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 + 1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_i_0 + 2 <= _global_next) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((_local__threadpooling_end_1 == _global_next && (_local__threadpooling_i_1 + 1 <= _global_next && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_i_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) || (((_local__threadpooling_end_0 == _global_next && _local__threadpooling_working_1 + 1 <= _global_next && (_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_i_0 == _local__threadpooling_working_0) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: ((((((((((((((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_i_0 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1) || (((((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _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_0 + 2 <= _global_next)) || ((((_local__threadpooling_working_1 + 1 <= _global_next && (_local__threadpooling_i_1 + 1 <= _global_next && (_local__threadpooling_end_0 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && !(_local__threadpooling_working_1 == _global_next)) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) || (((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 2 <= _global_next)) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0)) || ((_local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1 && (((((((_local__threadpooling_end_0 == _local__threadpooling_i_1 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_1 + 2 <= _global_next) || ((((_local__threadpooling_end_0 == _local__threadpooling_i_1 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1))) && _local__threadpooling_i_0 + 2 <= _global_next)) || (((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _local__threadpooling_i_0 + 2 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_1 == _global_next && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1) && _local__threadpooling_working_1 + 2 <= _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_working_0 + 2 <= _global_next) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_working_0)) || (((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0)) || ((((_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_1 == _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_i_1)) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_working_0 + 1 <= _global_next)) || (((((((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && !(_local__threadpooling_working_0 == _local__threadpooling_i_1)) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 == _local__threadpooling_i_0) || (((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _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_working_0 + 2 <= _local__threadpooling_i_1) && _local__threadpooling_end_1 == _local__threadpooling_i_0)) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_end_0)) || (((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0)) || ((((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _local__threadpooling_end_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0)) || ((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_0 + 1 <= _global_next) && (_local__threadpooling_end_0 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && !(_local__threadpooling_working_1 == _global_next)) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: ((((((((_local__threadpooling_end_0 == _local__threadpooling_i_1 && _local__threadpooling_end_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1) && _local__threadpooling_i_0 + 2 <= _global_next) || ((((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _local__threadpooling_i_0 + 2 <= _local__threadpooling_working_1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_1 + 1 <= _global_next) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1)) || (_local__threadpooling_working_0 + 1 <= _global_next && ((_local__threadpooling_end_1 == _global_next && _local__threadpooling_end_0 <= _local__threadpooling_i_0 && (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_i_1 + 1 <= _global_next) && !(_local__threadpooling_working_1 == _global_next)) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) || ((_local__threadpooling_end_0 == _global_next && (_local__threadpooling_working_1 + 1 <= _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && (_local__threadpooling_end_0 <= _local__threadpooling_i_0 && (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_i_1 + 1 <= _global_next) && !(_local__threadpooling_working_1 == _global_next)) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_end_0) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0)) || ((((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_end_0) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((_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 <= _local__threadpooling_i_1) && _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_0 + 2 <= _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) || (((((((_local__threadpooling_end_1 == _global_next && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_i_0 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _local__threadpooling_i_0 + 2 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1) && _local__threadpooling_working_1 + 2 <= _global_next) || (((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && (_local__threadpooling_end_0 == _local__threadpooling_i_1 && (((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) && _local__threadpooling_working_0 + 2 <= _global_next) || ((_local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1 && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) && _local__threadpooling_working_0 + 2 <= _global_next))) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || (_local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1 && ((_local__threadpooling_end_1 == _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && (_local__threadpooling_end_0 == _local__threadpooling_i_1 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_1 + 2 <= _global_next)) && _local__threadpooling_i_0 + 2 <= _global_next)) || ((_local__threadpooling_end_0 == _global_next && (((((_local__threadpooling_end_1 == _local__threadpooling_i_0 && (((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) && _local__threadpooling_working_0 + 2 <= _global_next) || ((_local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1 && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) && _local__threadpooling_working_0 + 2 <= _global_next))) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) || (((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && !(_local__threadpooling_working_0 == _local__threadpooling_i_1)) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0))) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_end_0)) || ((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 == _global_next) && (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_i_1 + 1 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_i_1)) || ((((_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_i_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1)) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_end_0) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0) || ((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_i_1 + 1 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_i_1)) || ((((_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_i_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1))) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && !(_local__threadpooling_working_1 == _global_next)) || ((((_local__threadpooling_end_0 == _global_next && _local__threadpooling_working_0 + 2 <= _global_next) && ((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_1 + 2 <= _global_next) || (((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 2 <= _global_next)) && _local__threadpooling_i_0 + 1 <= _global_next)) || ((((((_local__threadpooling_working_1 + 1 <= _global_next && _local__threadpooling_i_1 + 1 <= _global_next && (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && !(_local__threadpooling_working_1 == _global_next)) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) || (_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_end_0 <= _local__threadpooling_i_0)) || (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 2 <= _global_next)) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0)) || ((((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_i_0 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0) || ((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1) && _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_end_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0)) || ((((((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && !(_local__threadpooling_working_0 == _local__threadpooling_i_1)) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_working_0 + 1 <= _global_next)) || ((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1) || ((_local__threadpooling_end_0 == _global_next && (((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_i_1 + 1 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 <= _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 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 2 <= _global_next))) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0)) || (((((_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_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1) || (_local__threadpooling_working_0 + 1 <= _global_next && (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_i_1 + 1 <= _global_next) && !(_local__threadpooling_working_1 == _global_next)) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1)) || ((((_local__threadpooling_working_1 + 1 <= _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && (_local__threadpooling_end_0 <= _local__threadpooling_i_0 && (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_i_1 + 1 <= _global_next) && !(_local__threadpooling_working_1 == _global_next)) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_end_0) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((_local__threadpooling_working_0 + 1 <= _global_next && ((_local__threadpooling_end_1 == _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && (!(_local__threadpooling_working_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_i_0 + 1 <= _global_next) || ((((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1 && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 2 <= _global_next) || (_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1)) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_i_0 == _local__threadpooling_working_0) && _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, 52.3s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 21.9s AutomataDifference, 0.0s DeadEndRemovalTime, 26.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 702 SDtfs, 2102 SDslu, 1085 SDs, 0 SdLazy, 7962 SolverSat, 1217 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 344 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1277 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=286occurred in iteration=10, 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: 0.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 1514 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 198 NumberOfFragments, 2648 HoareAnnotationTreeSize, 15 FomulaSimplifications, 96326893123 FormulaSimplificationTreeSizeReduction, 6.1s HoareSimplificationTime, 15 FomulaSimplificationsInter, 63859721 FormulaSimplificationTreeSizeReductionInter, 20.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 9198 SizeOfPredicates, 28 NumberOfNonLiveVariables, 290 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 23 InterpolantComputations, 11 PerfectInterpolantSequences, 26/57 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_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_20-07-09-656.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out2.mover.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_20-07-09-656.csv Received shutdown request...