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_PUPT.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:41:59,601 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:41:59,603 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:41:59,616 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:41:59,617 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:41:59,618 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:41:59,620 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:41:59,622 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:41:59,624 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:41:59,625 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:41:59,626 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:41:59,626 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:41:59,627 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:41:59,628 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:41:59,629 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:41:59,630 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:41:59,631 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:41:59,633 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:41:59,638 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:41:59,640 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:41:59,643 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:41:59,645 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:41:59,647 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:41:59,647 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:41:59,648 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:41:59,649 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:41:59,650 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:41:59,651 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:41:59,651 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:41:59,652 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:41:59,652 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:41:59,653 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:41:59,653 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:41:59,654 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:41:59,656 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:41:59,656 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:41:59,657 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 12:41:59,671 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:41:59,672 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:41:59,672 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:41:59,673 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:41:59,673 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:41:59,673 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:41:59,674 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:41:59,674 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:41:59,674 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:41:59,674 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:41:59,674 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:41:59,675 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:41:59,675 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:41:59,675 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:41:59,675 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:41:59,675 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:41:59,676 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:41:59,676 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:41:59,676 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:41:59,676 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:41:59,676 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:41:59,677 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:41:59,677 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:41:59,677 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:41:59,677 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:41:59,677 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:41:59,678 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:41:59,678 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:41:59,678 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:41:59,678 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:41:59,678 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:41:59,733 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:41:59,749 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:41:59,756 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:41:59,757 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:41:59,758 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:41:59,759 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:41:59,759 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl' [2018-10-04 12:41:59,834 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:41:59,836 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:41:59,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:41:59,840 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:41:59,840 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:41:59,861 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:41:59" (1/1) ... [2018-10-04 12:41:59,875 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:41:59" (1/1) ... [2018-10-04 12:41:59,880 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:41:59,881 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:41:59,881 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:41:59,883 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:41:59,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:41:59,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:41:59,885 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:41:59,897 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:41:59" (1/1) ... [2018-10-04 12:41:59,897 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:41:59" (1/1) ... [2018-10-04 12:41:59,898 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:41:59" (1/1) ... [2018-10-04 12:41:59,899 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:41:59" (1/1) ... [2018-10-04 12:41:59,904 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:41:59" (1/1) ... [2018-10-04 12:41:59,911 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:41:59" (1/1) ... [2018-10-04 12:41:59,912 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:41:59" (1/1) ... [2018-10-04 12:41:59,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:41:59,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:41:59,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:41:59,921 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:41:59,922 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:41:59" (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:41:59,997 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-04 12:41:59,998 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-04 12:41:59,998 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-04 12:42:00,564 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:42:00,565 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:42:00 BoogieIcfgContainer [2018-10-04 12:42:00,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:42:00,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:42:00,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:42:00,570 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:42:00,570 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:41:59" (1/2) ... [2018-10-04 12:42:00,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a019cb and model type threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:42:00, skipping insertion in model container [2018-10-04 12:42:00,572 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:42:00" (2/2) ... [2018-10-04 12:42:00,574 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out2.mover.bpl [2018-10-04 12:42:00,584 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:42:00,593 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-10-04 12:42:00,648 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:42:00,648 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:42:00,649 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:42:00,649 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:42:00,649 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:42:00,649 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:42:00,649 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:42:00,650 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:42:00,650 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:42:00,667 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-10-04 12:42:00,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:42:00,674 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:00,675 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 12:42:00,677 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:00,684 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:00,685 INFO L82 PathProgramCache]: Analyzing trace with hash 28852717, now seen corresponding path program 1 times [2018-10-04 12:42:00,687 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:00,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:00,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:00,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:00,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:00,980 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:42:00,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:00,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:00,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:42:01,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:42:01,003 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:01,005 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 5 states. [2018-10-04 12:42:01,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:01,711 INFO L93 Difference]: Finished difference Result 46 states and 83 transitions. [2018-10-04 12:42:01,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:42:01,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 12:42:01,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:01,728 INFO L225 Difference]: With dead ends: 46 [2018-10-04 12:42:01,728 INFO L226 Difference]: Without dead ends: 44 [2018-10-04 12:42:01,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 12:42:01,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-04 12:42:01,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2018-10-04 12:42:01,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:42:01,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 56 transitions. [2018-10-04 12:42:01,777 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 56 transitions. Word has length 5 [2018-10-04 12:42:01,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:01,778 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 56 transitions. [2018-10-04 12:42:01,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:42:01,778 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 56 transitions. [2018-10-04 12:42:01,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:42:01,779 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:01,779 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 12:42:01,780 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:01,780 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:01,781 INFO L82 PathProgramCache]: Analyzing trace with hash 32260834, now seen corresponding path program 1 times [2018-10-04 12:42:01,781 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:01,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:01,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:01,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:01,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:01,944 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:42:01,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:01,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:01,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:42:01,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:42:01,947 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:01,947 INFO L87 Difference]: Start difference. First operand 30 states and 56 transitions. Second operand 5 states. [2018-10-04 12:42:02,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:02,902 INFO L93 Difference]: Finished difference Result 75 states and 142 transitions. [2018-10-04 12:42:02,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:42:02,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 12:42:02,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:02,905 INFO L225 Difference]: With dead ends: 75 [2018-10-04 12:42:02,905 INFO L226 Difference]: Without dead ends: 71 [2018-10-04 12:42:02,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 6 [2018-10-04 12:42:02,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-04 12:42:02,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2018-10-04 12:42:02,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-04 12:42:02,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 113 transitions. [2018-10-04 12:42:02,947 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 113 transitions. Word has length 5 [2018-10-04 12:42:02,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:02,947 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 113 transitions. [2018-10-04 12:42:02,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:42:02,948 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 113 transitions. [2018-10-04 12:42:02,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:02,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:02,949 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:02,949 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:02,950 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:02,950 INFO L82 PathProgramCache]: Analyzing trace with hash -737820031, now seen corresponding path program 1 times [2018-10-04 12:42:02,950 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:02,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:02,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:02,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:02,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:03,129 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:42:03,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:03,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:42:03,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:42:03,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:42:03,131 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:03,131 INFO L87 Difference]: Start difference. First operand 52 states and 113 transitions. Second operand 7 states. [2018-10-04 12:42:04,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:04,260 INFO L93 Difference]: Finished difference Result 198 states and 420 transitions. [2018-10-04 12:42:04,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:42:04,264 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:42:04,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:04,267 INFO L225 Difference]: With dead ends: 198 [2018-10-04 12:42:04,267 INFO L226 Difference]: Without dead ends: 147 [2018-10-04 12:42:04,268 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 9 [2018-10-04 12:42:04,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-04 12:42:04,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 89. [2018-10-04 12:42:04,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-04 12:42:04,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 194 transitions. [2018-10-04 12:42:04,297 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 194 transitions. Word has length 8 [2018-10-04 12:42:04,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:04,297 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 194 transitions. [2018-10-04 12:42:04,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:42:04,297 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 194 transitions. [2018-10-04 12:42:04,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:04,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:04,299 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:04,299 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:04,299 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:04,300 INFO L82 PathProgramCache]: Analyzing trace with hash -791588849, now seen corresponding path program 1 times [2018-10-04 12:42:04,300 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:04,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:04,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:04,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:04,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:04,388 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:42:04,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:04,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:42:04,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:42:04,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:42:04,390 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:04,390 INFO L87 Difference]: Start difference. First operand 89 states and 194 transitions. Second operand 7 states. [2018-10-04 12:42:05,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:05,464 INFO L93 Difference]: Finished difference Result 227 states and 433 transitions. [2018-10-04 12:42:05,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:42:05,468 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:42:05,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:05,471 INFO L225 Difference]: With dead ends: 227 [2018-10-04 12:42:05,472 INFO L226 Difference]: Without dead ends: 223 [2018-10-04 12:42:05,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 9 [2018-10-04 12:42:05,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-04 12:42:05,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 112. [2018-10-04 12:42:05,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-04 12:42:05,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 252 transitions. [2018-10-04 12:42:05,508 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 252 transitions. Word has length 8 [2018-10-04 12:42:05,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:05,508 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 252 transitions. [2018-10-04 12:42:05,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:42:05,508 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 252 transitions. [2018-10-04 12:42:05,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:05,510 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:05,510 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:05,510 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:05,511 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:05,511 INFO L82 PathProgramCache]: Analyzing trace with hash 558061441, now seen corresponding path program 1 times [2018-10-04 12:42:05,511 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:05,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:05,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:05,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:05,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:05,622 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:42:05,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:05,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:42:05,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:42:05,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:42:05,625 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:05,625 INFO L87 Difference]: Start difference. First operand 112 states and 252 transitions. Second operand 7 states. [2018-10-04 12:42:07,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:07,087 INFO L93 Difference]: Finished difference Result 286 states and 570 transitions. [2018-10-04 12:42:07,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 12:42:07,096 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:42:07,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:07,100 INFO L225 Difference]: With dead ends: 286 [2018-10-04 12:42:07,100 INFO L226 Difference]: Without dead ends: 282 [2018-10-04 12:42:07,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 10 [2018-10-04 12:42:07,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-10-04 12:42:07,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 156. [2018-10-04 12:42:07,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-04 12:42:07,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 365 transitions. [2018-10-04 12:42:07,155 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 365 transitions. Word has length 8 [2018-10-04 12:42:07,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:07,156 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 365 transitions. [2018-10-04 12:42:07,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:42:07,156 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 365 transitions. [2018-10-04 12:42:07,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:07,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:07,158 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:07,158 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:07,158 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:07,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1066417550, now seen corresponding path program 1 times [2018-10-04 12:42:07,159 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:07,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:07,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:07,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:07,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:07,338 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:42:07,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:07,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:42:07,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:42:07,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:42:07,341 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:07,341 INFO L87 Difference]: Start difference. First operand 156 states and 365 transitions. Second operand 7 states. [2018-10-04 12:42:09,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:09,465 INFO L93 Difference]: Finished difference Result 351 states and 749 transitions. [2018-10-04 12:42:09,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:42:09,466 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:42:09,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:09,468 INFO L225 Difference]: With dead ends: 351 [2018-10-04 12:42:09,468 INFO L226 Difference]: Without dead ends: 347 [2018-10-04 12:42:09,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 10 [2018-10-04 12:42:09,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-10-04 12:42:09,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 202. [2018-10-04 12:42:09,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-04 12:42:09,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 490 transitions. [2018-10-04 12:42:09,521 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 490 transitions. Word has length 8 [2018-10-04 12:42:09,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:09,522 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 490 transitions. [2018-10-04 12:42:09,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:42:09,522 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 490 transitions. [2018-10-04 12:42:09,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:09,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:09,524 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:09,524 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:09,525 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:09,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1120186368, now seen corresponding path program 1 times [2018-10-04 12:42:09,525 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:09,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:09,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:09,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:09,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:09,770 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:42:09,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:09,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:42:09,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:42:09,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:42:09,773 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:09,773 INFO L87 Difference]: Start difference. First operand 202 states and 490 transitions. Second operand 7 states. [2018-10-04 12:42:10,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:10,711 INFO L93 Difference]: Finished difference Result 353 states and 758 transitions. [2018-10-04 12:42:10,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:42:10,711 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:42:10,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:10,714 INFO L225 Difference]: With dead ends: 353 [2018-10-04 12:42:10,714 INFO L226 Difference]: Without dead ends: 349 [2018-10-04 12:42:10,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 10 [2018-10-04 12:42:10,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-10-04 12:42:10,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 207. [2018-10-04 12:42:10,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-04 12:42:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 504 transitions. [2018-10-04 12:42:10,767 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 504 transitions. Word has length 8 [2018-10-04 12:42:10,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:10,767 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 504 transitions. [2018-10-04 12:42:10,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:42:10,768 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 504 transitions. [2018-10-04 12:42:10,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:10,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:10,769 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-10-04 12:42:10,769 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:10,770 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:10,770 INFO L82 PathProgramCache]: Analyzing trace with hash -990082056, now seen corresponding path program 1 times [2018-10-04 12:42:10,770 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:10,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:10,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:10,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:10,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:10,881 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:42:10,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:10,882 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:42:10,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:10,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:11,103 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:42:11,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:42:11,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2018-10-04 12:42:11,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:11,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:11,136 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:11,136 INFO L87 Difference]: Start difference. First operand 207 states and 504 transitions. Second operand 8 states. [2018-10-04 12:42:12,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:12,582 INFO L93 Difference]: Finished difference Result 396 states and 923 transitions. [2018-10-04 12:42:12,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:42:12,587 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:42:12,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:12,589 INFO L225 Difference]: With dead ends: 396 [2018-10-04 12:42:12,589 INFO L226 Difference]: Without dead ends: 242 [2018-10-04 12:42:12,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 8 [2018-10-04 12:42:12,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-10-04 12:42:12,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 202. [2018-10-04 12:42:12,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-04 12:42:12,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 479 transitions. [2018-10-04 12:42:12,652 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 479 transitions. Word has length 8 [2018-10-04 12:42:12,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:12,652 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 479 transitions. [2018-10-04 12:42:12,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:12,653 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 479 transitions. [2018-10-04 12:42:12,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:12,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:12,654 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:12,654 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:12,655 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:12,655 INFO L82 PathProgramCache]: Analyzing trace with hash -990897365, now seen corresponding path program 1 times [2018-10-04 12:42:12,655 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:12,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:12,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:12,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:12,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:13,238 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:42:13,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:13,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:42:13,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:42:13,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:42:13,239 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:13,240 INFO L87 Difference]: Start difference. First operand 202 states and 479 transitions. Second operand 7 states. [2018-10-04 12:42:15,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:15,047 INFO L93 Difference]: Finished difference Result 383 states and 823 transitions. [2018-10-04 12:42:15,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:42:15,048 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:42:15,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:15,051 INFO L225 Difference]: With dead ends: 383 [2018-10-04 12:42:15,051 INFO L226 Difference]: Without dead ends: 379 [2018-10-04 12:42:15,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 11 [2018-10-04 12:42:15,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-04 12:42:15,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 250. [2018-10-04 12:42:15,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-04 12:42:15,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 579 transitions. [2018-10-04 12:42:15,143 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 579 transitions. Word has length 8 [2018-10-04 12:42:15,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:15,143 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 579 transitions. [2018-10-04 12:42:15,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:42:15,144 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 579 transitions. [2018-10-04 12:42:15,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:42:15,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:15,145 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:15,145 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:15,146 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:15,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1739261140, now seen corresponding path program 1 times [2018-10-04 12:42:15,146 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:15,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:15,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:15,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:15,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:15,818 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:42:15,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:15,819 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) [2018-10-04 12:42:15,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:15,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:16,033 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:42:16,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:42:16,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2018-10-04 12:42:16,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:42:16,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:42:16,074 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:16,074 INFO L87 Difference]: Start difference. First operand 250 states and 579 transitions. Second operand 9 states. [2018-10-04 12:42:17,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:17,942 INFO L93 Difference]: Finished difference Result 648 states and 1427 transitions. [2018-10-04 12:42:17,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 12:42:17,944 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2018-10-04 12:42:17,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:17,947 INFO L225 Difference]: With dead ends: 648 [2018-10-04 12:42:17,947 INFO L226 Difference]: Without dead ends: 399 [2018-10-04 12:42:17,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.8s impTime 14 [2018-10-04 12:42:17,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-10-04 12:42:18,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 286. [2018-10-04 12:42:18,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-10-04 12:42:18,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 584 transitions. [2018-10-04 12:42:18,062 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 584 transitions. Word has length 10 [2018-10-04 12:42:18,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:18,062 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 584 transitions. [2018-10-04 12:42:18,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:42:18,062 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 584 transitions. [2018-10-04 12:42:18,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:42:18,063 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:18,064 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:18,064 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:18,064 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:18,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1246182800, now seen corresponding path program 1 times [2018-10-04 12:42:18,065 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:18,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:18,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:18,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:18,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:18,210 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:42:18,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:18,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:42:18,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:42:18,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:42:18,211 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:18,212 INFO L87 Difference]: Start difference. First operand 286 states and 584 transitions. Second operand 4 states. [2018-10-04 12:42:18,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:18,706 INFO L93 Difference]: Finished difference Result 471 states and 962 transitions. [2018-10-04 12:42:18,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:42:18,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-10-04 12:42:18,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:18,712 INFO L225 Difference]: With dead ends: 471 [2018-10-04 12:42:18,712 INFO L226 Difference]: Without dead ends: 212 [2018-10-04 12:42:18,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 2 [2018-10-04 12:42:18,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-10-04 12:42:18,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 175. [2018-10-04 12:42:18,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-04 12:42:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 321 transitions. [2018-10-04 12:42:18,764 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 321 transitions. Word has length 11 [2018-10-04 12:42:18,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:18,764 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 321 transitions. [2018-10-04 12:42:18,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:42:18,764 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 321 transitions. [2018-10-04 12:42:18,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:42:18,765 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:18,765 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:18,766 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:18,766 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:18,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1737860601, now seen corresponding path program 1 times [2018-10-04 12:42:18,766 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:18,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:18,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:18,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:18,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:18,867 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:42:18,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:18,867 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:42:18,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:18,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:18,933 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:42:18,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:18,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-10-04 12:42:18,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 12:42:18,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 12:42:18,955 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:18,956 INFO L87 Difference]: Start difference. First operand 175 states and 321 transitions. Second operand 12 states. [2018-10-04 12:42:20,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:20,228 INFO L93 Difference]: Finished difference Result 253 states and 430 transitions. [2018-10-04 12:42:20,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 12:42:20,229 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-10-04 12:42:20,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:20,230 INFO L225 Difference]: With dead ends: 253 [2018-10-04 12:42:20,230 INFO L226 Difference]: Without dead ends: 249 [2018-10-04 12:42:20,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 18 [2018-10-04 12:42:20,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-04 12:42:20,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 121. [2018-10-04 12:42:20,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-04 12:42:20,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 212 transitions. [2018-10-04 12:42:20,281 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 212 transitions. Word has length 11 [2018-10-04 12:42:20,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:20,281 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 212 transitions. [2018-10-04 12:42:20,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 12:42:20,282 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 212 transitions. [2018-10-04 12:42:20,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:42:20,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:20,282 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:20,283 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:20,283 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:20,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1883568488, now seen corresponding path program 1 times [2018-10-04 12:42:20,283 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:20,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:20,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:20,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:20,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:20,792 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:42:20,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:20,793 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:42:20,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:20,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:20,854 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:42:20,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:20,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-10-04 12:42:20,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:42:20,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:42:20,876 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:20,876 INFO L87 Difference]: Start difference. First operand 121 states and 212 transitions. Second operand 13 states. [2018-10-04 12:42:22,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:22,052 INFO L93 Difference]: Finished difference Result 229 states and 386 transitions. [2018-10-04 12:42:22,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 12:42:22,052 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-10-04 12:42:22,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:22,053 INFO L225 Difference]: With dead ends: 229 [2018-10-04 12:42:22,054 INFO L226 Difference]: Without dead ends: 225 [2018-10-04 12:42:22,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.6s impTime 17 [2018-10-04 12:42:22,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-04 12:42:22,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 79. [2018-10-04 12:42:22,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-04 12:42:22,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 135 transitions. [2018-10-04 12:42:22,108 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 135 transitions. Word has length 11 [2018-10-04 12:42:22,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:22,108 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 135 transitions. [2018-10-04 12:42:22,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:42:22,108 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 135 transitions. [2018-10-04 12:42:22,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:42:22,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:22,109 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:22,109 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:22,109 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:22,110 INFO L82 PathProgramCache]: Analyzing trace with hash -496063517, now seen corresponding path program 1 times [2018-10-04 12:42:22,110 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:22,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:22,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:22,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:22,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:22,197 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:42:22,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:22,198 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:42:22,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:22,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:22,274 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:42:22,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:22,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2018-10-04 12:42:22,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:42:22,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:42:22,297 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:22,297 INFO L87 Difference]: Start difference. First operand 79 states and 135 transitions. Second operand 11 states. [2018-10-04 12:42:23,248 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 7 [2018-10-04 12:42:23,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:23,801 INFO L93 Difference]: Finished difference Result 243 states and 409 transitions. [2018-10-04 12:42:23,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 12:42:23,802 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2018-10-04 12:42:23,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:23,804 INFO L225 Difference]: With dead ends: 243 [2018-10-04 12:42:23,804 INFO L226 Difference]: Without dead ends: 239 [2018-10-04 12:42:23,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 10 [2018-10-04 12:42:23,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-04 12:42:23,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 73. [2018-10-04 12:42:23,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-04 12:42:23,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 125 transitions. [2018-10-04 12:42:23,875 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 125 transitions. Word has length 13 [2018-10-04 12:42:23,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:23,875 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 125 transitions. [2018-10-04 12:42:23,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:42:23,876 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 125 transitions. [2018-10-04 12:42:23,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:42:23,876 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:23,876 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:23,876 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:23,877 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:23,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1936277035, now seen corresponding path program 1 times [2018-10-04 12:42:23,877 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:23,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:23,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:23,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:23,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:23,948 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:42:23,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:23,949 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:42:23,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:23,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:24,008 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:42:24,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:24,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2018-10-04 12:42:24,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:42:24,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:42:24,030 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:24,030 INFO L87 Difference]: Start difference. First operand 73 states and 125 transitions. Second operand 9 states. [2018-10-04 12:42:25,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:25,211 INFO L93 Difference]: Finished difference Result 202 states and 340 transitions. [2018-10-04 12:42:25,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:42:25,212 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-10-04 12:42:25,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:25,214 INFO L225 Difference]: With dead ends: 202 [2018-10-04 12:42:25,214 INFO L226 Difference]: Without dead ends: 198 [2018-10-04 12:42:25,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 18 [2018-10-04 12:42:25,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-04 12:42:25,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 58. [2018-10-04 12:42:25,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-04 12:42:25,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 100 transitions. [2018-10-04 12:42:25,260 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 100 transitions. Word has length 13 [2018-10-04 12:42:25,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:25,260 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 100 transitions. [2018-10-04 12:42:25,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:42:25,260 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 100 transitions. [2018-10-04 12:42:25,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:42:25,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:25,261 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:25,261 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:25,262 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:25,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1990045853, now seen corresponding path program 1 times [2018-10-04 12:42:25,262 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:25,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:25,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:25,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:25,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:25,350 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:42:25,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:25,351 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:42:25,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:25,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:25,439 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:42:25,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:25,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-10-04 12:42:25,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:42:25,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:42:25,461 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:25,461 INFO L87 Difference]: Start difference. First operand 58 states and 100 transitions. Second operand 10 states. [2018-10-04 12:42:26,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:26,877 INFO L93 Difference]: Finished difference Result 188 states and 317 transitions. [2018-10-04 12:42:26,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 12:42:26,877 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-10-04 12:42:26,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:26,877 INFO L225 Difference]: With dead ends: 188 [2018-10-04 12:42:26,877 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:42:26,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 18 [2018-10-04 12:42:26,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:42:26,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:42:26,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:42:26,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:42:26,879 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-10-04 12:42:26,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:26,879 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:42:26,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:42:26,879 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:42:26,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:42:26,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:42:26,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:26,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:27,277 WARN L178 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 151 [2018-10-04 12:42:27,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:27,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:27,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:27,626 WARN L178 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 144 [2018-10-04 12:42:27,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:27,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:27,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:27,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:28,662 WARN L178 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 210 DAG size of output: 134 [2018-10-04 12:42:28,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:28,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:29,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:29,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:29,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:29,202 WARN L178 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 289 DAG size of output: 205 [2018-10-04 12:42:29,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:29,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:29,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:29,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:29,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:29,864 WARN L178 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 294 DAG size of output: 203 [2018-10-04 12:42:30,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:30,571 WARN L178 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 138 [2018-10-04 12:42:30,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:30,719 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 132 [2018-10-04 12:42:31,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:31,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:31,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:31,408 WARN L178 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 290 DAG size of output: 225 [2018-10-04 12:42:31,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:31,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:31,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:31,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:31,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:31,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:31,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:31,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:31,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:31,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:31,808 WARN L178 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 303 DAG size of output: 207 [2018-10-04 12:42:31,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:31,999 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 124 [2018-10-04 12:42:32,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:32,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:32,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:32,345 WARN L178 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 301 DAG size of output: 252 [2018-10-04 12:42:32,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:32,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:32,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:32,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:32,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:32,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:32,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:32,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:32,603 WARN L178 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 169 [2018-10-04 12:42:32,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:32,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:32,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:32,995 WARN L178 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 304 DAG size of output: 186 [2018-10-04 12:42:33,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:33,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:33,395 WARN L178 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 159 [2018-10-04 12:42:33,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:33,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:33,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:33,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:33,570 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 143 [2018-10-04 12:42:35,105 WARN L178 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 150 DAG size of output: 43 [2018-10-04 12:42:36,199 WARN L178 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 142 DAG size of output: 42 [2018-10-04 12:42:37,344 WARN L178 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 127 DAG size of output: 39 [2018-10-04 12:42:38,954 WARN L178 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 195 DAG size of output: 67 [2018-10-04 12:42:40,696 WARN L178 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 187 DAG size of output: 47 [2018-10-04 12:42:41,618 WARN L178 SmtUtils]: Spent 919.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 40 [2018-10-04 12:42:42,429 WARN L178 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 34 [2018-10-04 12:42:44,368 WARN L178 SmtUtils]: Spent 1.94 s on a formula simplification. DAG size of input: 219 DAG size of output: 55 [2018-10-04 12:42:47,020 WARN L178 SmtUtils]: Spent 2.65 s on a formula simplification. DAG size of input: 193 DAG size of output: 79 [2018-10-04 12:42:47,636 WARN L178 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 34 [2018-10-04 12:42:49,856 WARN L178 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 246 DAG size of output: 69 [2018-10-04 12:42:51,566 WARN L178 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 163 DAG size of output: 54 [2018-10-04 12:42:53,227 WARN L178 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 170 DAG size of output: 54 [2018-10-04 12:42:54,353 WARN L178 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 158 DAG size of output: 39 [2018-10-04 12:42:55,023 WARN L178 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 32 [2018-10-04 12:42:55,026 INFO L421 ceAbstractionStarter]: At program point L192(lines 72 210) the Hoare annotation is: (let ((.cse2 (+ product__local__threadpooling_i_1 1)) (.cse12 (+ product__local__threadpooling_working_1 1)) (.cse6 (+ product__local__threadpooling_working_0 2))) (let ((.cse5 (<= .cse6 product__local__threadpooling_working_1)) (.cse1 (<= product__local__threadpooling_end_0 (+ product__local__threadpooling_i_0 1))) (.cse3 (= product__local__threadpooling_end_1 product__global_next)) (.cse4 (<= .cse12 product__local__threadpooling_end_1)) (.cse8 (= product__local__threadpooling_end_0 product__global_next)) (.cse9 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_end_0)) (.cse0 (<= product__local__threadpooling_end_1 .cse2)) (.cse7 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)))) (or (and .cse0 (<= (+ product__local__threadpooling_i_0 2) product__local__threadpooling_working_1) .cse1 (<= .cse2 product__local__threadpooling_end_1) .cse3 .cse4 .cse5) (and .cse0 (= product__local__threadpooling_end_0 product__local__threadpooling_i_1) .cse1 .cse3 .cse4 (= product__local__threadpooling_end_0 product__local__threadpooling_working_1) .cse5) (and (and (<= .cse6 product__global_next) (and (and (and .cse7 .cse1) .cse0) (<= (+ product__local__threadpooling_working_1 2) product__global_next))) .cse8 .cse9) (let ((.cse11 (and (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0) (and .cse7 (<= .cse2 product__global_next) (not (= product__local__threadpooling_working_1 product__global_next))))) (.cse10 (+ product__local__threadpooling_working_0 1))) (or (and (<= .cse10 product__global_next) (and .cse11 .cse3 .cse0 .cse4)) (and .cse8 (and (and .cse11 .cse9) (<= .cse12 product__global_next) .cse0) (<= .cse10 product__local__threadpooling_end_0))))))) [2018-10-04 12:42:55,026 INFO L421 ceAbstractionStarter]: At program point L209(lines 50 209) the Hoare annotation is: (let ((.cse5 (+ 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 .cse5)) (.cse3 (and (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0) (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= .cse5 product__global_next) (not (= product__local__threadpooling_working_1 product__global_next))))) (.cse4 (+ product__local__threadpooling_working_0 1))) (or (and (and .cse0 .cse1 .cse2 .cse3) (<= .cse4 product__global_next)) (and .cse0 .cse1 .cse2 (<= .cse5 product__local__threadpooling_end_1) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_working_1)) (and (and (<= .cse6 product__global_next) .cse1 (and .cse3 (<= (+ 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:42:55,027 INFO L425 ceAbstractionStarter]: For program point productErr2ASSERT_VIOLATIONASSERT(line 171) no Hoare annotation was computed. [2018-10-04 12:42:55,027 INFO L421 ceAbstractionStarter]: At program point L234(lines 97 234) the Hoare annotation is: (let ((.cse9 (+ product__local__threadpooling_working_1 2)) (.cse12 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse5 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse14 (+ product__local__threadpooling_i_0 1)) (.cse13 (+ product__local__threadpooling_working_1 1))) (let ((.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse3 (<= .cse13 product__local__threadpooling_end_1)) (.cse11 (<= .cse14 product__global_next)) (.cse6 (<= product__local__threadpooling_end_0 .cse14)) (.cse10 (+ product__local__threadpooling_working_0 2)) (.cse7 (= product__local__threadpooling_end_0 product__global_next)) (.cse4 (and .cse12 .cse5 (not (= product__local__threadpooling_working_1 product__global_next)))) (.cse2 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse8 (<= .cse9 product__global_next)) (.cse1 (+ product__local__threadpooling_working_0 1))) (or (and .cse0 (<= .cse1 product__global_next) .cse2 .cse3 .cse4) (and (and (or (and .cse5 .cse2 .cse6 .cse7 .cse8) (and (<= .cse9 product__local__threadpooling_i_0) .cse6 .cse7)) (<= .cse10 product__global_next)) .cse11) (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) .cse0 .cse2 .cse3 .cse11 .cse6 (<= .cse10 product__local__threadpooling_working_1)) (and .cse7 (or (and (<= .cse9 product__local__threadpooling_working_0) .cse12) (and (<= .cse13 product__global_next) .cse2 (and (<= (+ product__local__threadpooling_i_1 1) product__global_next) .cse4)) (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) .cse12 .cse2 .cse8)) (<= .cse1 product__local__threadpooling_end_0))))) [2018-10-04 12:42:55,027 INFO L425 ceAbstractionStarter]: For program point productENTRY(lines 3 236) no Hoare annotation was computed. [2018-10-04 12:42:55,027 INFO L425 ceAbstractionStarter]: For program point productFINAL(lines 3 236) no Hoare annotation was computed. [2018-10-04 12:42:55,027 INFO L421 ceAbstractionStarter]: At program point L119(lines 119 124) the Hoare annotation is: (let ((.cse1 (+ product__local__threadpooling_i_0 1))) (let ((.cse0 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse2 (<= product__local__threadpooling_end_0 .cse1)) (.cse4 (+ product__local__threadpooling_working_0 2)) (.cse3 (<= .cse1 product__local__threadpooling_end_0))) (or (and (= product__local__threadpooling_end_1 product__global_next) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) .cse0 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) (<= .cse1 product__global_next) .cse2 .cse3 (<= .cse4 product__local__threadpooling_working_1)) (and (let ((.cse6 (+ product__local__threadpooling_working_1 2)) (.cse5 (= product__local__threadpooling_end_0 product__global_next))) (or (and (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) .cse0 .cse2 .cse5 (<= .cse6 product__global_next)) (and (<= .cse6 product__local__threadpooling_i_0) .cse2 .cse5))) (<= .cse4 product__global_next) .cse3)))) [2018-10-04 12:42:55,028 INFO L421 ceAbstractionStarter]: At program point L95(lines 95 190) the Hoare annotation is: (let ((.cse4 (+ product__local__threadpooling_working_0 2)) (.cse2 (+ product__local__threadpooling_i_1 1))) (let ((.cse17 (<= .cse2 product__global_next)) (.cse9 (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1))) (.cse19 (+ product__local__threadpooling_i_0 1)) (.cse8 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse10 (<= .cse4 product__global_next)) (.cse18 (+ product__local__threadpooling_working_1 2))) (let ((.cse5 (<= .cse18 product__global_next)) (.cse6 (<= .cse18 product__local__threadpooling_i_0)) (.cse3 (= product__local__threadpooling_end_1 product__global_next)) (.cse7 (let ((.cse20 (<= .cse4 product__local__threadpooling_i_1))) (or (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) .cse20 .cse10) (and .cse8 .cse20 .cse10)))) (.cse1 (<= product__local__threadpooling_end_0 .cse19)) (.cse11 (<= .cse19 product__local__threadpooling_end_0)) (.cse15 (and (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0) (and .cse8 .cse17) .cse9)) (.cse12 (= product__local__threadpooling_end_0 product__global_next)) (.cse13 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_end_0)) (.cse0 (<= product__local__threadpooling_end_1 .cse2)) (.cse14 (+ product__local__threadpooling_working_0 1))) (or (and .cse0 (<= (+ product__local__threadpooling_i_0 2) product__global_next) .cse1 (<= .cse2 product__local__threadpooling_end_1) .cse3 (<= .cse4 product__local__threadpooling_working_1) .cse5) (and (or (and .cse6 .cse0 (and (and .cse7 (= product__local__threadpooling_end_1 product__local__threadpooling_i_0)) .cse1)) (and (and (and (and .cse8 .cse1) .cse9) .cse6 .cse0) .cse10 .cse11)) .cse12 .cse13) (and (<= .cse14 product__global_next) (and .cse15 .cse3 .cse0 .cse5)) (let ((.cse16 (and (and (and (and .cse17 .cse7) (= product__local__threadpooling_end_0 product__local__threadpooling_i_1)) .cse1) .cse11))) (or (and .cse8 .cse3 .cse0 .cse16 .cse5) (and .cse6 .cse3 .cse0 .cse16))) (and (<= .cse18 product__local__threadpooling_working_0) (and .cse15 .cse12 .cse13) .cse0 (<= .cse14 product__local__threadpooling_end_0)))))) [2018-10-04 12:42:55,028 INFO L421 ceAbstractionStarter]: At program point L203(lines 143 203) the Hoare annotation is: (let ((.cse10 (+ product__local__threadpooling_i_0 1)) (.cse11 (+ product__local__threadpooling_working_1 2))) (let ((.cse0 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse4 (<= .cse11 product__local__threadpooling_working_0)) (.cse8 (<= .cse11 product__global_next)) (.cse2 (= product__local__threadpooling_end_0 product__global_next)) (.cse3 (= product__local__threadpooling_i_0 product__local__threadpooling_working_0)) (.cse7 (= product__local__threadpooling_end_1 product__global_next)) (.cse6 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse1 (<= product__local__threadpooling_end_0 .cse10)) (.cse5 (<= .cse10 product__local__threadpooling_end_0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_working_0) .cse5) (and (and (<= (+ product__local__threadpooling_working_0 2) product__global_next) (and (and .cse6 .cse1 .cse5) .cse7 .cse0 .cse8)) (<= (+ product__local__threadpooling_i_0 2) product__global_next)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) .cse5) (let ((.cse9 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1))) (or (and (and (and .cse9 .cse1) .cse8) .cse2 .cse3 .cse5) (and .cse7 .cse6 (<= (+ product__local__threadpooling_working_0 1) product__global_next) .cse9 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) .cse1 (<= .cse10 product__global_next) .cse5)))))) [2018-10-04 12:42:55,028 INFO L425 ceAbstractionStarter]: For program point productErr5ASSERT_VIOLATIONASSERT(line 186) no Hoare annotation was computed. [2018-10-04 12:42:55,028 INFO L421 ceAbstractionStarter]: At program point L154(lines 154 159) the Hoare annotation is: (let ((.cse4 (+ product__local__threadpooling_i_0 1))) (let ((.cse7 (<= product__local__threadpooling_end_0 .cse4)) (.cse6 (+ product__local__threadpooling_i_1 1))) (let ((.cse2 (<= product__local__threadpooling_end_1 .cse6)) (.cse0 (and .cse7 (<= .cse6 product__global_next))) (.cse3 (+ product__local__threadpooling_working_1 2)) (.cse1 (<= .cse4 product__local__threadpooling_end_0))) (or (and (and (= product__local__threadpooling_end_1 product__global_next) (and (and .cse0 (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1))) .cse1) .cse2 (<= .cse3 product__global_next)) (<= (+ product__local__threadpooling_working_0 1) product__global_next) (<= .cse4 product__global_next)) (and (let ((.cse5 (= product__local__threadpooling_end_0 product__global_next)) (.cse8 (+ product__local__threadpooling_i_1 2))) (or (and .cse2 (and (and .cse5 (<= .cse6 product__local__threadpooling_end_1)) .cse7) (<= .cse8 product__local__threadpooling_end_0)) (and .cse2 .cse0 .cse5 (<= .cse8 product__local__threadpooling_i_0)))) (<= .cse3 product__local__threadpooling_i_0) (= product__local__threadpooling_i_0 product__local__threadpooling_working_0) .cse1))))) [2018-10-04 12:42:55,029 INFO L421 ceAbstractionStarter]: At program point L121(lines 17 229) the Hoare annotation is: (let ((.cse9 (+ product__local__threadpooling_working_1 2))) (let ((.cse0 (<= (+ product__local__threadpooling_working_0 2) product__global_next)) (.cse1 (<= .cse9 product__global_next))) (or (and .cse0 .cse1) (let ((.cse8 (+ product__local__threadpooling_working_1 1))) (let ((.cse2 (= product__local__threadpooling_end_1 product__global_next)) (.cse4 (<= .cse8 product__local__threadpooling_end_1)) (.cse6 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse3 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse5 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse7 (+ product__local__threadpooling_working_0 1))) (or (and .cse2 .cse0 .cse3 .cse4) (and .cse5 .cse6 .cse2 (<= .cse7 product__global_next) .cse3 .cse4) (and (= product__local__threadpooling_end_0 product__global_next) (or (and (<= .cse8 product__global_next) .cse3 (and .cse5 (<= (+ product__local__threadpooling_i_1 1) product__global_next) .cse6)) (and .cse5 .cse3 .cse1) (and (<= .cse9 product__local__threadpooling_working_0) .cse5)) (<= .cse7 product__local__threadpooling_end_0)))))))) [2018-10-04 12:42:55,029 INFO L421 ceAbstractionStarter]: At program point L196(lines 196 201) the Hoare annotation is: (let ((.cse13 (+ 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)) (.cse1 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse5 (<= .cse9 product__local__threadpooling_i_0)) (.cse4 (<= .cse20 product__local__threadpooling_i_1)) (.cse7 (<= product__local__threadpooling_end_1 .cse19)) (.cse6 (<= product__local__threadpooling_end_0 .cse13)) (.cse11 (= product__local__threadpooling_end_1 product__global_next)) (.cse14 (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))) (.cse10 (<= .cse13 product__local__threadpooling_end_0)) (.cse15 (<= .cse20 product__local__threadpooling_working_1)) (.cse16 (<= .cse9 product__global_next))) (or (and (let ((.cse0 (and (and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) .cse5 .cse6) .cse7))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2))) (<= .cse8 product__local__threadpooling_end_0)) (and (and (<= .cse9 product__local__threadpooling_working_0) .cse6 .cse7) .cse2 .cse3 .cse10 (<= .cse8 product__local__threadpooling_i_0)) (let ((.cse12 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1))) (or (and .cse11 .cse12 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) (<= .cse13 product__global_next) .cse6 .cse14 .cse10 .cse15) (and (and .cse1 .cse12 .cse6 .cse2 .cse16) .cse3 .cse10))) (let ((.cse18 (+ product__local__threadpooling_i_0 2))) (or (and (and (let ((.cse17 (or (= product__local__threadpooling_end_0 product__local__threadpooling_i_1) (= product__local__threadpooling_end_0 product__local__threadpooling_i_0)))) (or (and .cse7 .cse14 .cse17 .cse6 .cse1 .cse11 .cse10 .cse16) (and (and .cse10 (and .cse5 (and .cse17 .cse11) .cse6)) .cse7))) .cse4) (<= .cse18 product__global_next)) (and (<= .cse18 product__local__threadpooling_i_1) .cse7 .cse6 (and .cse11 .cse14 (<= .cse19 product__local__threadpooling_end_1)) .cse10 .cse15 .cse16)))))) [2018-10-04 12:42:55,029 INFO L425 ceAbstractionStarter]: For program point productErr4ASSERT_VIOLATIONASSERT(line 181) no Hoare annotation was computed. [2018-10-04 12:42:55,029 INFO L425 ceAbstractionStarter]: For program point productErr1ASSERT_VIOLATIONASSERT(line 82) no Hoare annotation was computed. [2018-10-04 12:42:55,029 INFO L425 ceAbstractionStarter]: For program point productEXIT(lines 3 236) no Hoare annotation was computed. [2018-10-04 12:42:55,030 INFO L421 ceAbstractionStarter]: At program point L156(lines 126 185) the Hoare annotation is: (let ((.cse2 (+ product__local__threadpooling_i_0 1))) (let ((.cse0 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse1 (<= product__local__threadpooling_end_0 .cse2)) (.cse3 (<= .cse2 product__local__threadpooling_end_0))) (or (and (= product__local__threadpooling_end_1 product__global_next) (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= (+ product__local__threadpooling_working_0 1) product__global_next) .cse0 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) .cse1 (<= .cse2 product__global_next) .cse3) (and (let ((.cse4 (+ product__local__threadpooling_working_1 2))) (or (and (<= .cse4 product__local__threadpooling_i_0) .cse1) (and .cse0 .cse1 (<= .cse4 product__global_next)))) (= product__local__threadpooling_end_0 product__global_next) (= product__local__threadpooling_i_0 product__local__threadpooling_working_0) .cse3)))) [2018-10-04 12:42:55,030 INFO L421 ceAbstractionStarter]: At program point L214(lines 161 214) the Hoare annotation is: (let ((.cse1 (+ product__local__threadpooling_i_0 1)) (.cse3 (+ product__local__threadpooling_i_1 1))) (let ((.cse0 (<= product__local__threadpooling_end_1 .cse3)) (.cse4 (<= product__local__threadpooling_end_0 .cse1)) (.cse2 (<= .cse1 product__local__threadpooling_end_0))) (or (and (= product__local__threadpooling_end_1 product__global_next) .cse0 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) (<= .cse1 product__global_next) (<= (+ product__local__threadpooling_working_0 2) product__global_next) .cse2 (and (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) (<= .cse3 product__global_next) .cse4)) (and (and .cse0 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_end_0) .cse4 (<= (+ product__local__threadpooling_working_1 2) product__global_next)) (= product__local__threadpooling_end_0 product__global_next) (= product__local__threadpooling_i_0 product__local__threadpooling_working_0) .cse2)))) [2018-10-04 12:42:55,030 INFO L425 ceAbstractionStarter]: For program point productErr0ASSERT_VIOLATIONASSERT(line 60) no Hoare annotation was computed. [2018-10-04 12:42:55,030 INFO L421 ceAbstractionStarter]: At program point L198(lines 32 219) the Hoare annotation is: (let ((.cse9 (+ product__local__threadpooling_i_1 1)) (.cse11 (+ product__local__threadpooling_working_1 1)) (.cse13 (+ product__local__threadpooling_working_0 1)) (.cse14 (+ product__local__threadpooling_working_1 2))) (let ((.cse0 (<= .cse14 product__local__threadpooling_working_0)) (.cse3 (= product__local__threadpooling_end_0 product__global_next)) (.cse4 (<= .cse13 product__local__threadpooling_end_0)) (.cse6 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse7 (<= .cse11 product__local__threadpooling_end_1)) (.cse8 (+ product__local__threadpooling_working_0 2)) (.cse10 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse5 (= product__local__threadpooling_end_1 product__global_next)) (.cse1 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse2 (<= product__local__threadpooling_end_1 .cse9)) (.cse12 (<= .cse14 product__global_next))) (or (and (and .cse0 (and .cse1 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) .cse2) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse0 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_working_0) .cse4) (and .cse5 .cse6 .cse7 (<= .cse8 product__local__threadpooling_working_1)) (and .cse3 (or (and (and .cse1 (<= .cse9 product__global_next) .cse10 .cse6) (<= .cse11 product__global_next)) (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) .cse1 .cse6 .cse12)) .cse4) (and .cse1 .cse10 .cse5 (<= .cse13 product__global_next) .cse6 .cse7) (or (and .cse5 (<= .cse8 product__local__threadpooling_i_1) .cse2 (<= .cse9 product__local__threadpooling_end_1) .cse12) (and (<= .cse8 product__global_next) (and (and .cse10 .cse5) .cse1 .cse2 .cse12)))))) [2018-10-04 12:42:55,030 INFO L425 ceAbstractionStarter]: For program point productErr3ASSERT_VIOLATIONASSERT(line 176) no Hoare annotation was computed. [2018-10-04 12:42:55,031 INFO L421 ceAbstractionStarter]: At program point L207(lines 207 212) the Hoare annotation is: (let ((.cse4 (+ product__local__threadpooling_i_1 1)) (.cse6 (+ product__local__threadpooling_i_0 1)) (.cse7 (+ product__local__threadpooling_working_0 2))) (let ((.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse5 (<= .cse7 product__local__threadpooling_working_1)) (.cse2 (<= product__local__threadpooling_end_0 .cse6)) (.cse1 (<= product__local__threadpooling_end_1 .cse4)) (.cse3 (<= .cse6 product__local__threadpooling_end_0))) (or (and (and .cse0 .cse1 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) .cse2 .cse3 (<= .cse4 product__local__threadpooling_end_1) .cse5) (<= (+ product__local__threadpooling_i_0 2) product__local__threadpooling_working_1)) (or (and .cse0 (and (= product__local__threadpooling_end_0 product__local__threadpooling_working_1) (= product__local__threadpooling_end_0 product__local__threadpooling_i_1) (not (= product__local__threadpooling_working_1 product__global_next))) .cse1 (<= .cse6 product__global_next) .cse2 .cse3 .cse5) (and (and (and (and .cse2 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_end_0)) .cse1) (<= (+ product__local__threadpooling_working_1 2) product__global_next)) (= product__local__threadpooling_end_0 product__global_next) (<= .cse7 product__global_next) .cse3))))) [2018-10-04 12:42:55,031 INFO L421 ceAbstractionStarter]: At program point L224(lines 84 224) the Hoare annotation is: (let ((.cse22 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse11 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse18 (+ product__local__threadpooling_working_0 1)) (.cse25 (+ product__local__threadpooling_i_1 2)) (.cse29 (+ product__local__threadpooling_i_0 1)) (.cse26 (+ product__local__threadpooling_working_1 1)) (.cse30 (+ product__local__threadpooling_working_0 2)) (.cse27 (+ product__local__threadpooling_i_1 1)) (.cse28 (+ product__local__threadpooling_working_1 2))) (let ((.cse14 (<= .cse28 product__local__threadpooling_i_0)) (.cse13 (<= .cse27 product__local__threadpooling_end_1)) (.cse10 (<= .cse30 product__local__threadpooling_i_1)) (.cse7 (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))) (.cse21 (<= .cse26 product__local__threadpooling_end_1)) (.cse17 (<= .cse29 product__global_next)) (.cse8 (<= .cse30 product__local__threadpooling_working_1)) (.cse6 (= product__local__threadpooling_end_1 product__global_next)) (.cse5 (<= .cse25 product__local__threadpooling_working_0)) (.cse2 (<= .cse30 product__global_next)) (.cse0 (<= product__local__threadpooling_end_1 .cse27)) (.cse23 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) (.cse1 (<= product__local__threadpooling_end_0 .cse29)) (.cse4 (<= .cse28 product__local__threadpooling_working_0)) (.cse15 (<= .cse29 product__local__threadpooling_end_0)) (.cse3 (= product__local__threadpooling_end_0 product__global_next)) (.cse24 (<= .cse18 product__local__threadpooling_end_0)) (.cse19 (and .cse22 .cse11 (not (= product__local__threadpooling_working_1 product__global_next)))) (.cse20 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse9 (<= .cse28 product__global_next))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (<= (+ product__local__threadpooling_i_0 2) product__global_next) .cse1 (and .cse6 .cse7) .cse8 .cse9) (and .cse10 (let ((.cse12 (= product__local__threadpooling_end_0 product__local__threadpooling_i_1))) (or (and .cse11 .cse6 .cse0 .cse7 .cse12 .cse1 .cse13 .cse9) (and .cse14 .cse6 .cse0 .cse12 .cse1 .cse15 .cse13)))) (and (let ((.cse16 (= product__local__threadpooling_end_1 product__local__threadpooling_i_0))) (or (and .cse14 .cse0 .cse2 .cse1 .cse3 (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1)) .cse11 .cse16) (and .cse14 .cse0 .cse1 .cse3 .cse13 .cse10 .cse16))) .cse17) (and .cse6 (<= .cse18 product__global_next) .cse19 .cse20 .cse21) (and .cse7 .cse6 .cse20 .cse21 .cse17 .cse1 .cse8) (and (and (and .cse22 .cse11 .cse6) .cse0 .cse9) .cse2) (and .cse22 .cse0 .cse23 .cse3 .cse4 .cse24) (and .cse22 .cse0 .cse3 .cse4 .cse5 .cse24) (and (and .cse11 .cse20 .cse1 .cse3 .cse9) .cse2) (and .cse0 .cse23 .cse1 .cse3 (<= .cse25 product__local__threadpooling_i_0) .cse4 .cse15) (and .cse3 .cse24 (or (and (<= .cse26 product__global_next) (and (<= .cse27 product__global_next) .cse19 .cse20)) (and .cse22 .cse11 .cse20 .cse9)))))) [2018-10-04 12:42:55,031 INFO L421 ceAbstractionStarter]: At program point L43(lines 43 48) the Hoare annotation is: (let ((.cse4 (+ product__local__threadpooling_working_1 2)) (.cse2 (+ product__local__threadpooling_i_1 1))) (let ((.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse1 (<= product__local__threadpooling_end_1 .cse2)) (.cse3 (<= .cse4 product__global_next))) (or (and .cse0 (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_1) .cse1 (<= .cse2 product__local__threadpooling_end_1) .cse3) (let ((.cse6 (and (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0) (and (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= .cse2 product__global_next)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1))))) (.cse5 (+ product__local__threadpooling_working_0 1))) (or (and (<= .cse4 product__local__threadpooling_working_0) .cse1 (= product__local__threadpooling_end_0 product__global_next) (<= .cse5 product__local__threadpooling_end_0) (and .cse6 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_end_0))) (and (and .cse0 .cse1 .cse6 .cse3) (<= .cse5 product__global_next))))))) [2018-10-04 12:42:55,068 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:42:55 BoogieIcfgContainer [2018-10-04 12:42:55,069 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:42:55,070 INFO L168 Benchmark]: Toolchain (without parser) took 55234.48 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 512.2 MB). Free memory was 1.5 GB in the beginning and 984.0 MB in the end (delta: 474.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-04 12:42:55,071 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:42:55,071 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.37 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:42:55,072 INFO L168 Benchmark]: Boogie Preprocessor took 30.59 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:42:55,072 INFO L168 Benchmark]: RCFGBuilder took 650.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:42:55,073 INFO L168 Benchmark]: TraceAbstraction took 54502.45 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 512.2 MB). Free memory was 1.4 GB in the beginning and 984.0 MB in the end (delta: 453.2 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-10-04 12:42:55,080 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 46.37 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 30.59 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 650.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 54502.45 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 512.2 MB). Free memory was 1.4 GB in the beginning and 984.0 MB in the end (delta: 453.2 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: 60]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 176]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 186]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 171]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 181]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 82]: 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_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_i_0 + 2 <= _local__threadpooling_working_1) || ((((((_local__threadpooling_end_1 == _global_next && (_local__threadpooling_end_0 == _local__threadpooling_working_1 && _local__threadpooling_end_0 == _local__threadpooling_i_1) && !(_local__threadpooling_working_1 == _global_next)) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 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_end_0 <= _local__threadpooling_i_0 + 1 && _local__threadpooling_i_1 + 2 <= _local__threadpooling_end_0) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 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) - InvariantResult [Line: 154]: Loop Invariant Derived loop invariant: (((((_local__threadpooling_end_1 == _global_next && ((_local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1 && _local__threadpooling_i_1 + 1 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_i_1)) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_i_0 + 1 <= _global_next) || ((((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && (_local__threadpooling_end_0 == _global_next && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_end_0) || (((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1 && _local__threadpooling_i_1 + 1 <= _global_next) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_i_0)) && _local__threadpooling_working_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_working_0 + 2 <= _global_next && _local__threadpooling_working_1 + 2 <= _global_next) || ((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_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 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_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) && (_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_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_end_0 <= _local__threadpooling_i_0))) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: ((((((((((_local__threadpooling_end_1 == _local__threadpooling_i_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_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_working_1)) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) || (((((_local__threadpooling_end_1 == _local__threadpooling_i_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) && _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 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 == _global_next) && _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_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_i_0 + 1 <= _local__threadpooling_end_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_end_0 == _global_next) && _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 <= _local__threadpooling_i_1 + 1 && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) && (_local__threadpooling_end_0 == _local__threadpooling_i_1 || _local__threadpooling_end_0 == _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 == _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0 && (_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && (_local__threadpooling_end_0 == _local__threadpooling_i_1 || _local__threadpooling_end_0 == _local__threadpooling_i_0) && _local__threadpooling_end_1 == _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 <= _local__threadpooling_i_1) && _local__threadpooling_i_0 + 2 <= _global_next) || ((((((_local__threadpooling_i_0 + 2 <= _local__threadpooling_i_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_1 == _local__threadpooling_i_0)) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1) && _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_end_0 == _global_next) && _local__threadpooling_working_0 + 1 <= _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_i_1 + 2 <= _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_working_1 + 2 <= _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) - InvariantResult [Line: 143]: Loop Invariant Derived loop invariant: ((((((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _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_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_working_0 + 2 <= _global_next && ((((!(_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_end_1 == _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_i_0 + 2 <= _global_next)) || ((((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _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_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 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_i_0 == _local__threadpooling_working_0) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) || (((((((_local__threadpooling_end_1 == _global_next && !(_local__threadpooling_working_1 == _local__threadpooling_working_0)) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_0 + 1 <= _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) - InvariantResult [Line: 161]: 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_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && (!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_i_1 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || ((((((_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 + 1) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_end_0 == _global_next) && _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 <= _local__threadpooling_i_1 + 1 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 2 <= _global_next) && _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_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_working_0 + 2 <= _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_1) && _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_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_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1)))) || (((((((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_0 == _global_next) && !(_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 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) && _local__threadpooling_end_1 == _local__threadpooling_i_0)) && _local__threadpooling_i_0 + 1 <= _global_next)) || ((((_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)) || ((((((!(_local__threadpooling_working_1 == _local__threadpooling_i_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_0 + 2 <= _local__threadpooling_working_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_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 <= _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_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_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_end_0 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_working_0 + 2 <= _global_next)) || ((((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _local__threadpooling_end_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_0 == _global_next) && _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_0 == _global_next && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0) && ((_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_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))) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: ((((((((_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 <= _local__threadpooling_end_1) && _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_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_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_end_0 == _local__threadpooling_working_1) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1)) || (((_local__threadpooling_working_0 + 2 <= _global_next && ((!(_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_end_0 == _global_next) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_end_0)) || (_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_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_1 == _global_next)) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_end_0) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((((_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 == _local__threadpooling_working_1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_0 == _global_next) && _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_working_0 + 2 <= _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) - 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 <= _local__threadpooling_i_1 + 1) && ((((!(_local__threadpooling_working_1 == _local__threadpooling_i_0) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) && _local__threadpooling_working_0 + 2 <= _global_next) || ((!(_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_end_1 == _local__threadpooling_i_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || ((((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && !(_local__threadpooling_working_0 == _local__threadpooling_i_1)) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _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_end_0 == _global_next) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_end_0)) || (_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_0 == _local__threadpooling_i_1)) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_1 + 2 <= _global_next)) || ((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && (((_local__threadpooling_i_1 + 1 <= _global_next && (((!(_local__threadpooling_working_1 == _local__threadpooling_i_0) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) && _local__threadpooling_working_0 + 2 <= _global_next) || ((!(_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_end_0 == _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_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && (((_local__threadpooling_i_1 + 1 <= _global_next && (((!(_local__threadpooling_working_1 == _local__threadpooling_i_0) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) && _local__threadpooling_working_0 + 2 <= _global_next) || ((!(_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_end_0 == _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 <= _local__threadpooling_working_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_end_0 == _global_next) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_end_0) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0) - 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_end_0 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && !(_local__threadpooling_working_1 == _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_end_0 == _global_next) && _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_working_0 + 2 <= _global_next) && _local__threadpooling_i_0 + 1 <= _global_next)) || ((((((!(_local__threadpooling_working_1 == _local__threadpooling_i_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_0 + 2 <= _local__threadpooling_working_1)) || ((_local__threadpooling_end_0 == _global_next && (((_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_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_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_working_0 + 1 <= _local__threadpooling_end_0) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((((((_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_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_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_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_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)) || ((((_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_0 + 2 <= _global_next && (((!(_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_1 + 2 <= _global_next) - 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_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_working_0 + 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_i_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_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_end_1 == _global_next && !(_local__threadpooling_working_1 == _local__threadpooling_working_0)) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_0 + 1 <= _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) || (((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 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_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, 54.3s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 20.6s AutomataDifference, 0.0s DeadEndRemovalTime, 28.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 702 SDtfs, 2038 SDslu, 1072 SDs, 0 SdLazy, 7853 SolverSat, 1166 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 343 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s 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.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 1514 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 198 NumberOfFragments, 2637 HoareAnnotationTreeSize, 15 FomulaSimplifications, 101354211071 FormulaSimplificationTreeSizeReduction, 6.6s HoareSimplificationTime, 15 FomulaSimplificationsInter, 170126110 FormulaSimplificationTreeSizeReductionInter, 21.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 9695 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_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-42-55-108.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out2.mover.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-42-55-108.csv Received shutdown request...