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-9f4048f [2018-10-04 12:13:55,355 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:13:55,358 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:13:55,372 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:13:55,372 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:13:55,373 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:13:55,374 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:13:55,376 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:13:55,378 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:13:55,379 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:13:55,380 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:13:55,380 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:13:55,381 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:13:55,382 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:13:55,383 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:13:55,384 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:13:55,385 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:13:55,387 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:13:55,388 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:13:55,390 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:13:55,391 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:13:55,392 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:13:55,395 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:13:55,395 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:13:55,395 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:13:55,396 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:13:55,397 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:13:55,398 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:13:55,399 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:13:55,400 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:13:55,400 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:13:55,401 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:13:55,401 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:13:55,401 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:13:55,402 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:13:55,403 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:13:55,403 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 12:13:55,425 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:13:55,425 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:13:55,426 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:13:55,426 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:13:55,427 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:13:55,427 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:13:55,427 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:13:55,428 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:13:55,428 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:13:55,428 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:13:55,428 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:13:55,428 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:13:55,428 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:13:55,429 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:13:55,429 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:13:55,429 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:13:55,429 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:13:55,429 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:13:55,430 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:13:55,430 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:13:55,430 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:13:55,430 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:13:55,430 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:13:55,431 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:13:55,431 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:13:55,431 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:13:55,432 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:13:55,432 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:13:55,432 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:13:55,432 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:13:55,500 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:13:55,515 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:13:55,521 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:13:55,523 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:13:55,523 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:13:55,525 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-10-04 12:13:55,525 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl' [2018-10-04 12:13:55,598 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:13:55,600 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:13:55,600 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:13:55,601 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:13:55,601 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:13:55,618 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 04.10 12:13:55" (1/1) ... [2018-10-04 12:13:55,629 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 04.10 12:13:55" (1/1) ... [2018-10-04 12:13:55,633 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:13:55,633 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:13:55,633 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:13:55,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:13:55,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:13:55,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:13:55,637 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:13:55,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:55" (1/1) ... [2018-10-04 12:13:55,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:55" (1/1) ... [2018-10-04 12:13:55,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:55" (1/1) ... [2018-10-04 12:13:55,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:55" (1/1) ... [2018-10-04 12:13:55,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:55" (1/1) ... [2018-10-04 12:13:55,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:55" (1/1) ... [2018-10-04 12:13:55,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:55" (1/1) ... [2018-10-04 12:13:55,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:13:55,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:13:55,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:13:55,662 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:13:55,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:13:55,734 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-04 12:13:55,735 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-04 12:13:55,735 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-04 12:13:56,174 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:13:56,175 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:13:56 BoogieIcfgContainer [2018-10-04 12:13:56,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:13:56,177 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:13:56,177 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:13:56,180 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:13:56,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:55" (1/2) ... [2018-10-04 12:13:56,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe8367b and model type threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:13:56, skipping insertion in model container [2018-10-04 12:13:56,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:13:56" (2/2) ... [2018-10-04 12:13:56,184 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out2.mover.bpl [2018-10-04 12:13:56,194 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:13:56,203 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-10-04 12:13:56,253 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:13:56,254 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:13:56,254 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:13:56,254 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:13:56,254 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:13:56,255 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:13:56,255 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:13:56,255 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:13:56,255 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:13:56,272 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-10-04 12:13:56,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:13:56,281 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:56,282 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 12:13:56,283 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:56,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:56,289 INFO L82 PathProgramCache]: Analyzing trace with hash 28852717, now seen corresponding path program 1 times [2018-10-04 12:13:56,291 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:56,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:56,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:56,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:56,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:56,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:56,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:13:56,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:13:56,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:13:56,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:13:56,507 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 5 states. [2018-10-04 12:13:57,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:57,236 INFO L93 Difference]: Finished difference Result 46 states and 83 transitions. [2018-10-04 12:13:57,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:13:57,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 12:13:57,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:57,253 INFO L225 Difference]: With dead ends: 46 [2018-10-04 12:13:57,254 INFO L226 Difference]: Without dead ends: 44 [2018-10-04 12:13:57,257 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-10-04 12:13:57,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-04 12:13:57,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2018-10-04 12:13:57,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:13:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 56 transitions. [2018-10-04 12:13:57,304 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 56 transitions. Word has length 5 [2018-10-04 12:13:57,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:57,305 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 56 transitions. [2018-10-04 12:13:57,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:13:57,305 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 56 transitions. [2018-10-04 12:13:57,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:13:57,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:57,306 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 12:13:57,307 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:57,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:57,307 INFO L82 PathProgramCache]: Analyzing trace with hash 32260834, now seen corresponding path program 1 times [2018-10-04 12:13:57,308 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:57,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:57,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:57,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:57,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:57,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:57,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:13:57,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:13:57,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:13:57,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:13:57,442 INFO L87 Difference]: Start difference. First operand 30 states and 56 transitions. Second operand 5 states. [2018-10-04 12:13:58,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:58,265 INFO L93 Difference]: Finished difference Result 75 states and 142 transitions. [2018-10-04 12:13:58,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:13:58,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 12:13:58,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:58,268 INFO L225 Difference]: With dead ends: 75 [2018-10-04 12:13:58,268 INFO L226 Difference]: Without dead ends: 71 [2018-10-04 12:13:58,269 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-10-04 12:13:58,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-04 12:13:58,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2018-10-04 12:13:58,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-04 12:13:58,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 113 transitions. [2018-10-04 12:13:58,288 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 113 transitions. Word has length 5 [2018-10-04 12:13:58,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:58,289 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 113 transitions. [2018-10-04 12:13:58,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:13:58,289 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 113 transitions. [2018-10-04 12:13:58,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:13:58,290 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:58,291 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:13:58,291 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:58,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:58,292 INFO L82 PathProgramCache]: Analyzing trace with hash -737820031, now seen corresponding path program 1 times [2018-10-04 12:13:58,292 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:58,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:58,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:58,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:58,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:58,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:58,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:58,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:13:58,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:13:58,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:13:58,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:13:58,434 INFO L87 Difference]: Start difference. First operand 52 states and 113 transitions. Second operand 7 states. [2018-10-04 12:13:59,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:59,623 INFO L93 Difference]: Finished difference Result 198 states and 420 transitions. [2018-10-04 12:13:59,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:13:59,624 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:13:59,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:59,628 INFO L225 Difference]: With dead ends: 198 [2018-10-04 12:13:59,629 INFO L226 Difference]: Without dead ends: 147 [2018-10-04 12:13:59,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:13:59,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-04 12:13:59,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 89. [2018-10-04 12:13:59,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-04 12:13:59,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 194 transitions. [2018-10-04 12:13:59,658 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 194 transitions. Word has length 8 [2018-10-04 12:13:59,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:59,658 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 194 transitions. [2018-10-04 12:13:59,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:13:59,659 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 194 transitions. [2018-10-04 12:13:59,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:13:59,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:59,660 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:13:59,660 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:59,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:59,661 INFO L82 PathProgramCache]: Analyzing trace with hash -791588849, now seen corresponding path program 1 times [2018-10-04 12:13:59,661 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:59,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:59,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:59,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:59,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:59,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:59,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:59,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:13:59,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:13:59,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:13:59,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:13:59,796 INFO L87 Difference]: Start difference. First operand 89 states and 194 transitions. Second operand 7 states. [2018-10-04 12:14:00,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:00,805 INFO L93 Difference]: Finished difference Result 227 states and 433 transitions. [2018-10-04 12:14:00,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:14:00,809 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:14:00,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:00,813 INFO L225 Difference]: With dead ends: 227 [2018-10-04 12:14:00,814 INFO L226 Difference]: Without dead ends: 223 [2018-10-04 12:14:00,814 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:14:00,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-04 12:14:00,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 112. [2018-10-04 12:14:00,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-04 12:14:00,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 252 transitions. [2018-10-04 12:14:00,852 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 252 transitions. Word has length 8 [2018-10-04 12:14:00,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:00,852 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 252 transitions. [2018-10-04 12:14:00,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:14:00,853 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 252 transitions. [2018-10-04 12:14:00,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:00,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:00,854 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:00,855 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:00,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:00,855 INFO L82 PathProgramCache]: Analyzing trace with hash 558061441, now seen corresponding path program 1 times [2018-10-04 12:14:00,855 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:00,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:00,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:00,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:00,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:00,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:00,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:00,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:14:00,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:14:00,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:14:00,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:14:00,976 INFO L87 Difference]: Start difference. First operand 112 states and 252 transitions. Second operand 7 states. [2018-10-04 12:14:02,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:02,439 INFO L93 Difference]: Finished difference Result 286 states and 570 transitions. [2018-10-04 12:14:02,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 12:14:02,440 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:14:02,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:02,442 INFO L225 Difference]: With dead ends: 286 [2018-10-04 12:14:02,442 INFO L226 Difference]: Without dead ends: 282 [2018-10-04 12:14:02,443 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-10-04 12:14:02,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-10-04 12:14:02,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 156. [2018-10-04 12:14:02,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-04 12:14:02,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 365 transitions. [2018-10-04 12:14:02,484 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 365 transitions. Word has length 8 [2018-10-04 12:14:02,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:02,484 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 365 transitions. [2018-10-04 12:14:02,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:14:02,484 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 365 transitions. [2018-10-04 12:14:02,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:02,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:02,486 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:02,486 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:02,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:02,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1066417550, now seen corresponding path program 1 times [2018-10-04 12:14:02,487 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:02,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:02,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:02,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:02,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:02,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:02,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:02,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:14:02,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:14:02,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:14:02,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:14:02,596 INFO L87 Difference]: Start difference. First operand 156 states and 365 transitions. Second operand 7 states. [2018-10-04 12:14:04,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:04,739 INFO L93 Difference]: Finished difference Result 351 states and 749 transitions. [2018-10-04 12:14:04,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:14:04,741 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:14:04,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:04,744 INFO L225 Difference]: With dead ends: 351 [2018-10-04 12:14:04,744 INFO L226 Difference]: Without dead ends: 347 [2018-10-04 12:14:04,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:14:04,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-10-04 12:14:04,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 202. [2018-10-04 12:14:04,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-04 12:14:04,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 490 transitions. [2018-10-04 12:14:04,806 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 490 transitions. Word has length 8 [2018-10-04 12:14:04,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:04,806 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 490 transitions. [2018-10-04 12:14:04,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:14:04,806 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 490 transitions. [2018-10-04 12:14:04,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:04,808 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:04,808 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:04,808 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:04,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:04,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1120186368, now seen corresponding path program 1 times [2018-10-04 12:14:04,809 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:04,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:04,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:04,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:04,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:05,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:05,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:05,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:14:05,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:14:05,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:14:05,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:14:05,008 INFO L87 Difference]: Start difference. First operand 202 states and 490 transitions. Second operand 7 states. [2018-10-04 12:14:06,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:06,285 INFO L93 Difference]: Finished difference Result 353 states and 758 transitions. [2018-10-04 12:14:06,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:14:06,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:14:06,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:06,292 INFO L225 Difference]: With dead ends: 353 [2018-10-04 12:14:06,292 INFO L226 Difference]: Without dead ends: 349 [2018-10-04 12:14:06,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:14:06,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-10-04 12:14:06,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 207. [2018-10-04 12:14:06,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-04 12:14:06,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 504 transitions. [2018-10-04 12:14:06,343 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 504 transitions. Word has length 8 [2018-10-04 12:14:06,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:06,344 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 504 transitions. [2018-10-04 12:14:06,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:14:06,344 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 504 transitions. [2018-10-04 12:14:06,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:06,345 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:06,345 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-10-04 12:14:06,346 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:06,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:06,346 INFO L82 PathProgramCache]: Analyzing trace with hash -990082056, now seen corresponding path program 1 times [2018-10-04 12:14:06,346 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:06,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:06,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:06,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:06,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:06,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:06,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:06,494 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:06,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:06,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:06,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:06,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:14:06,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2018-10-04 12:14:06,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:14:06,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:14:06,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:14:06,630 INFO L87 Difference]: Start difference. First operand 207 states and 504 transitions. Second operand 8 states. [2018-10-04 12:14:06,922 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-04 12:14:07,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:07,925 INFO L93 Difference]: Finished difference Result 396 states and 923 transitions. [2018-10-04 12:14:07,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:14:07,928 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:14:07,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:07,930 INFO L225 Difference]: With dead ends: 396 [2018-10-04 12:14:07,930 INFO L226 Difference]: Without dead ends: 242 [2018-10-04 12:14:07,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:14:07,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-10-04 12:14:07,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 202. [2018-10-04 12:14:07,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-04 12:14:07,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 479 transitions. [2018-10-04 12:14:07,985 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 479 transitions. Word has length 8 [2018-10-04 12:14:07,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:07,986 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 479 transitions. [2018-10-04 12:14:07,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:14:07,986 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 479 transitions. [2018-10-04 12:14:07,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:07,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:07,987 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:07,987 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:07,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:07,988 INFO L82 PathProgramCache]: Analyzing trace with hash -990897365, now seen corresponding path program 1 times [2018-10-04 12:14:07,988 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:07,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:07,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:07,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:07,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:08,215 WARN L178 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 6 [2018-10-04 12:14:08,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:08,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:08,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:14:08,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:14:08,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:14:08,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:14:08,295 INFO L87 Difference]: Start difference. First operand 202 states and 479 transitions. Second operand 7 states. [2018-10-04 12:14:09,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:09,560 INFO L93 Difference]: Finished difference Result 383 states and 823 transitions. [2018-10-04 12:14:09,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:14:09,562 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:14:09,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:09,565 INFO L225 Difference]: With dead ends: 383 [2018-10-04 12:14:09,565 INFO L226 Difference]: Without dead ends: 379 [2018-10-04 12:14:09,566 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-10-04 12:14:09,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-04 12:14:09,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 250. [2018-10-04 12:14:09,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-04 12:14:09,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 579 transitions. [2018-10-04 12:14:09,647 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 579 transitions. Word has length 8 [2018-10-04 12:14:09,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:09,648 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 579 transitions. [2018-10-04 12:14:09,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:14:09,648 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 579 transitions. [2018-10-04 12:14:09,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:14:09,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:09,649 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:09,650 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:09,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:09,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1739261140, now seen corresponding path program 1 times [2018-10-04 12:14:09,650 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:09,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:09,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:09,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:09,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:10,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:10,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:10,275 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:10,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:10,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:10,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:10,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:14:10,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2018-10-04 12:14:10,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:14:10,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:14:10,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:14:10,513 INFO L87 Difference]: Start difference. First operand 250 states and 579 transitions. Second operand 9 states. [2018-10-04 12:14:12,394 WARN L178 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-10-04 12:14:12,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:12,596 INFO L93 Difference]: Finished difference Result 648 states and 1427 transitions. [2018-10-04 12:14:12,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 12:14:12,596 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2018-10-04 12:14:12,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:12,599 INFO L225 Difference]: With dead ends: 648 [2018-10-04 12:14:12,599 INFO L226 Difference]: Without dead ends: 399 [2018-10-04 12:14:12,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2018-10-04 12:14:12,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-10-04 12:14:12,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 286. [2018-10-04 12:14:12,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-10-04 12:14:12,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 584 transitions. [2018-10-04 12:14:12,708 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 584 transitions. Word has length 10 [2018-10-04 12:14:12,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:12,709 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 584 transitions. [2018-10-04 12:14:12,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:14:12,709 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 584 transitions. [2018-10-04 12:14:12,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:14:12,710 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:12,710 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:12,711 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:12,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:12,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1246182800, now seen corresponding path program 1 times [2018-10-04 12:14:12,711 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:12,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:12,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:12,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:12,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:12,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:12,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:12,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:14:12,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:14:12,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:14:12,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:14:12,864 INFO L87 Difference]: Start difference. First operand 286 states and 584 transitions. Second operand 4 states. [2018-10-04 12:14:13,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:13,076 INFO L93 Difference]: Finished difference Result 471 states and 962 transitions. [2018-10-04 12:14:13,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:14:13,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-10-04 12:14:13,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:13,077 INFO L225 Difference]: With dead ends: 471 [2018-10-04 12:14:13,078 INFO L226 Difference]: Without dead ends: 212 [2018-10-04 12:14:13,079 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-10-04 12:14:13,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-10-04 12:14:13,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 175. [2018-10-04 12:14:13,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-04 12:14:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 321 transitions. [2018-10-04 12:14:13,126 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 321 transitions. Word has length 11 [2018-10-04 12:14:13,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:13,126 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 321 transitions. [2018-10-04 12:14:13,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:14:13,126 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 321 transitions. [2018-10-04 12:14:13,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:14:13,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:13,127 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:13,127 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:13,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:13,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1737860601, now seen corresponding path program 1 times [2018-10-04 12:14:13,128 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:13,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:13,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:13,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:13,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:13,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:13,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:13,225 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:13,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:13,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:13,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:13,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:13,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-10-04 12:14:13,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 12:14:13,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 12:14:13,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:14:13,336 INFO L87 Difference]: Start difference. First operand 175 states and 321 transitions. Second operand 12 states. [2018-10-04 12:14:15,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:15,153 INFO L93 Difference]: Finished difference Result 253 states and 430 transitions. [2018-10-04 12:14:15,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 12:14:15,153 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-10-04 12:14:15,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:15,155 INFO L225 Difference]: With dead ends: 253 [2018-10-04 12:14:15,155 INFO L226 Difference]: Without dead ends: 249 [2018-10-04 12:14:15,156 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-10-04 12:14:15,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-04 12:14:15,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 121. [2018-10-04 12:14:15,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-04 12:14:15,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 212 transitions. [2018-10-04 12:14:15,211 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 212 transitions. Word has length 11 [2018-10-04 12:14:15,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:15,212 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 212 transitions. [2018-10-04 12:14:15,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 12:14:15,212 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 212 transitions. [2018-10-04 12:14:15,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:14:15,212 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:15,213 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:15,213 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:15,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:15,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1883568488, now seen corresponding path program 1 times [2018-10-04 12:14:15,213 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:15,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:15,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:15,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:15,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:15,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:15,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:15,706 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:15,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:15,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:15,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:15,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:15,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-10-04 12:14:15,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:14:15,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:14:15,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:14:15,923 INFO L87 Difference]: Start difference. First operand 121 states and 212 transitions. Second operand 13 states. [2018-10-04 12:14:16,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:16,861 INFO L93 Difference]: Finished difference Result 229 states and 386 transitions. [2018-10-04 12:14:16,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 12:14:16,862 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-10-04 12:14:16,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:16,863 INFO L225 Difference]: With dead ends: 229 [2018-10-04 12:14:16,863 INFO L226 Difference]: Without dead ends: 225 [2018-10-04 12:14:16,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=333, Invalid=857, Unknown=0, NotChecked=0, Total=1190 [2018-10-04 12:14:16,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-04 12:14:16,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 79. [2018-10-04 12:14:16,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-04 12:14:16,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 135 transitions. [2018-10-04 12:14:16,911 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 135 transitions. Word has length 11 [2018-10-04 12:14:16,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:16,911 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 135 transitions. [2018-10-04 12:14:16,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:14:16,911 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 135 transitions. [2018-10-04 12:14:16,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:14:16,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:16,912 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:16,912 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:16,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:16,912 INFO L82 PathProgramCache]: Analyzing trace with hash -496063517, now seen corresponding path program 1 times [2018-10-04 12:14:16,913 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:16,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:16,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:16,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:16,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:17,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:17,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:17,034 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:17,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:17,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:17,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:14:17,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:17,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2018-10-04 12:14:17,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:14:17,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:14:17,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:14:17,147 INFO L87 Difference]: Start difference. First operand 79 states and 135 transitions. Second operand 11 states. [2018-10-04 12:14:18,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:18,813 INFO L93 Difference]: Finished difference Result 243 states and 409 transitions. [2018-10-04 12:14:18,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 12:14:18,813 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2018-10-04 12:14:18,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:18,815 INFO L225 Difference]: With dead ends: 243 [2018-10-04 12:14:18,816 INFO L226 Difference]: Without dead ends: 239 [2018-10-04 12:14:18,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=351, Invalid=909, Unknown=0, NotChecked=0, Total=1260 [2018-10-04 12:14:18,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-04 12:14:18,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 73. [2018-10-04 12:14:18,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-04 12:14:18,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 125 transitions. [2018-10-04 12:14:18,856 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 125 transitions. Word has length 13 [2018-10-04 12:14:18,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:18,857 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 125 transitions. [2018-10-04 12:14:18,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:14:18,857 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 125 transitions. [2018-10-04 12:14:18,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:14:18,857 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:18,857 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:18,858 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:18,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:18,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1936277035, now seen corresponding path program 1 times [2018-10-04 12:14:18,858 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:18,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:18,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:18,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:18,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:18,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:18,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:18,940 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:18,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:18,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:19,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:14:19,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:19,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2018-10-04 12:14:19,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:14:19,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:14:19,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:14:19,047 INFO L87 Difference]: Start difference. First operand 73 states and 125 transitions. Second operand 9 states. [2018-10-04 12:14:20,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:20,108 INFO L93 Difference]: Finished difference Result 202 states and 340 transitions. [2018-10-04 12:14:20,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:14:20,108 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-10-04 12:14:20,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:20,110 INFO L225 Difference]: With dead ends: 202 [2018-10-04 12:14:20,110 INFO L226 Difference]: Without dead ends: 198 [2018-10-04 12:14:20,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=453, Unknown=0, NotChecked=0, Total=650 [2018-10-04 12:14:20,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-04 12:14:20,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 58. [2018-10-04 12:14:20,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-04 12:14:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 100 transitions. [2018-10-04 12:14:20,158 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 100 transitions. Word has length 13 [2018-10-04 12:14:20,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:20,159 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 100 transitions. [2018-10-04 12:14:20,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:14:20,159 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 100 transitions. [2018-10-04 12:14:20,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:14:20,159 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:20,160 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:20,160 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:20,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:20,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1990045853, now seen corresponding path program 1 times [2018-10-04 12:14:20,160 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:20,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:20,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:20,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:20,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:20,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:20,280 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:20,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:20,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:20,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:14:20,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:20,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-10-04 12:14:20,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:14:20,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:14:20,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:14:20,388 INFO L87 Difference]: Start difference. First operand 58 states and 100 transitions. Second operand 10 states. [2018-10-04 12:14:21,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:21,590 INFO L93 Difference]: Finished difference Result 188 states and 317 transitions. [2018-10-04 12:14:21,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 12:14:21,591 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-10-04 12:14:21,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:21,591 INFO L225 Difference]: With dead ends: 188 [2018-10-04 12:14:21,591 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:14:21,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=576, Unknown=0, NotChecked=0, Total=812 [2018-10-04 12:14:21,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:14:21,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:14:21,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:14:21,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:14:21,593 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-10-04 12:14:21,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:21,593 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:14:21,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:14:21,593 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:14:21,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:14:21,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:14:21,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:21,948 WARN L178 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 136 [2018-10-04 12:14:21,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:22,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:22,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:22,266 WARN L178 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 130 [2018-10-04 12:14:22,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:22,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:22,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:22,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:23,066 WARN L178 SmtUtils]: Spent 798.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 132 [2018-10-04 12:14:23,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:23,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:23,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:23,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:23,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:23,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:23,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:23,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:23,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:23,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:23,460 WARN L178 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 281 DAG size of output: 190 [2018-10-04 12:14:23,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:23,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:23,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:23,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:23,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:23,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:23,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:24,066 WARN L178 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 285 DAG size of output: 222 [2018-10-04 12:14:24,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:24,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:24,613 WARN L178 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 129 [2018-10-04 12:14:24,726 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 130 [2018-10-04 12:14:25,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:25,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:25,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:25,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:25,349 WARN L178 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 284 DAG size of output: 207 [2018-10-04 12:14:25,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:25,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:25,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:25,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:25,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:25,756 WARN L178 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 212 [2018-10-04 12:14:25,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:25,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:25,989 WARN L178 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 114 [2018-10-04 12:14:26,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:26,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:26,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:26,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:26,490 WARN L178 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 292 DAG size of output: 217 [2018-10-04 12:14:26,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:26,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:26,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:26,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:26,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:26,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:26,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:26,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:26,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:26,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:26,762 WARN L178 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 149 [2018-10-04 12:14:26,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:26,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:26,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:26,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:26,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:27,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:27,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:27,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:27,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:27,197 WARN L178 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 165 [2018-10-04 12:14:27,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:27,591 WARN L178 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 165 [2018-10-04 12:14:27,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:27,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:27,766 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 148 [2018-10-04 12:14:28,819 WARN L178 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 133 DAG size of output: 40 [2018-10-04 12:14:29,594 WARN L178 SmtUtils]: Spent 772.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 39 [2018-10-04 12:14:30,854 WARN L178 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 127 DAG size of output: 40 [2018-10-04 12:14:32,458 WARN L178 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 177 DAG size of output: 66 [2018-10-04 12:14:33,867 WARN L178 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 205 DAG size of output: 52 [2018-10-04 12:14:34,824 WARN L178 SmtUtils]: Spent 954.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 44 [2018-10-04 12:14:35,596 WARN L178 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 36 [2018-10-04 12:14:37,378 WARN L178 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 199 DAG size of output: 56 [2018-10-04 12:14:40,423 WARN L178 SmtUtils]: Spent 3.04 s on a formula simplification. DAG size of input: 198 DAG size of output: 82 [2018-10-04 12:14:41,037 WARN L178 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 34 [2018-10-04 12:14:43,169 WARN L178 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 210 DAG size of output: 76 [2018-10-04 12:14:44,559 WARN L178 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 137 DAG size of output: 54 [2018-10-04 12:14:46,094 WARN L178 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 149 DAG size of output: 52 [2018-10-04 12:14:47,359 WARN L178 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 165 DAG size of output: 39 [2018-10-04 12:14:48,069 WARN L178 SmtUtils]: Spent 707.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 35 [2018-10-04 12:14:48,073 INFO L421 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-10-04 12:14:48,073 INFO L421 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-10-04 12:14:48,074 INFO L421 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-10-04 12:14:48,074 INFO L425 ceAbstractionStarter]: For program point productENTRY(lines 3 236) no Hoare annotation was computed. [2018-10-04 12:14:48,075 INFO L425 ceAbstractionStarter]: For program point productFINAL(lines 3 236) no Hoare annotation was computed. [2018-10-04 12:14:48,075 INFO L421 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-10-04 12:14:48,075 INFO L421 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-10-04 12:14:48,076 INFO L425 ceAbstractionStarter]: For program point productErr5ASSERT_VIOLATIONASSERT(line 186) no Hoare annotation was computed. [2018-10-04 12:14:48,076 INFO L421 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-10-04 12:14:48,076 INFO L421 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-10-04 12:14:48,076 INFO L421 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-10-04 12:14:48,077 INFO L421 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-10-04 12:14:48,077 INFO L425 ceAbstractionStarter]: For program point productErr0ASSERT_VIOLATIONASSERT(line 60) no Hoare annotation was computed. [2018-10-04 12:14:48,077 INFO L425 ceAbstractionStarter]: For program point productEXIT(lines 3 236) no Hoare annotation was computed. [2018-10-04 12:14:48,077 INFO L421 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-10-04 12:14:48,077 INFO L421 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-10-04 12:14:48,078 INFO L421 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-10-04 12:14:48,078 INFO L425 ceAbstractionStarter]: For program point productErr1ASSERT_VIOLATIONASSERT(line 82) no Hoare annotation was computed. [2018-10-04 12:14:48,078 INFO L425 ceAbstractionStarter]: For program point productErr2ASSERT_VIOLATIONASSERT(line 171) no Hoare annotation was computed. [2018-10-04 12:14:48,078 INFO L421 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-10-04 12:14:48,078 INFO L425 ceAbstractionStarter]: For program point productErr4ASSERT_VIOLATIONASSERT(line 181) no Hoare annotation was computed. [2018-10-04 12:14:48,079 INFO L421 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-10-04 12:14:48,079 INFO L425 ceAbstractionStarter]: For program point productErr3ASSERT_VIOLATIONASSERT(line 176) no Hoare annotation was computed. [2018-10-04 12:14:48,079 INFO L421 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-10-04 12:14:48,116 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:14:48 BoogieIcfgContainer [2018-10-04 12:14:48,116 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:14:48,118 INFO L168 Benchmark]: Toolchain (without parser) took 52519.66 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 503.8 MB). Free memory was 1.5 GB in the beginning and 979.5 MB in the end (delta: 493.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-04 12:14:48,119 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:14:48,120 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.58 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:14:48,120 INFO L168 Benchmark]: Boogie Preprocessor took 25.47 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:14:48,121 INFO L168 Benchmark]: RCFGBuilder took 513.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:14:48,122 INFO L168 Benchmark]: TraceAbstraction took 51939.58 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 503.8 MB). Free memory was 1.5 GB in the beginning and 979.5 MB in the end (delta: 471.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-10-04 12:14:48,125 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.58 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.47 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 513.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 51939.58 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 503.8 MB). Free memory was 1.5 GB in the beginning and 979.5 MB in the end (delta: 471.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 171]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 60]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 186]: 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 - PositiveResult [Line: 82]: 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 - 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, 51.8s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 20.2s AutomataDifference, 0.0s DeadEndRemovalTime, 26.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 702 SDtfs, 2102 SDslu, 1085 SDs, 0 SdLazy, 7962 SolverSat, 1217 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 344 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1277 ImplicationChecksByTransitivity, 7.1s 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.7s 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.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.6s 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-10-04_12-14-48-143.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-10-04_12-14-48-143.csv Received shutdown request...